Scribd
Upload
10 views3 pages

Os Cse Cat1 Set1

This document is a question paper for the Continuous Assessment Test I for the course IT3461 - Operating Systems at SRM Valliammai Engineering College. It includes various questions divided into two parts, covering topics such as objectives of operating systems, system calls, scheduling algorithms, and memory allocation. The test is designed for B. Tech students in the Artificial Intelligence and Data Science branch, with a total of 100 marks and a duration of 3 hours.

Uploaded by

halamadrid8031
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views3 pages

Os Cse Cat1 Set1

This document is a question paper for the Continuous Assessment Test I for the course IT3461 - Operating Systems at SRM Valliammai Engineering College. It includes various questions divided into two parts, covering topics such as objectives of operating systems, system calls, scheduling algorithms, and memory allocation. The test is designed for B. Tech students in the Artificial Intelligence and Data Science branch, with a total of 100 marks and a duration of 3 hours.

Uploaded by

halamadrid8031
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Reg.

No

Question Paper Code: IT3461

SRM VALLIAMMAI ENGINEERING COLLEGE


(An Autonomous Institution)
SRM Nagar, Kattankulathur-603203.

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

CONTINUOUS ASSESSMENT TEST – I

(Common to the Department Of Computer Science and Engineering, Cyber Security and Information Technology)
(EVEN SEMESTER 2024-2025)
IT3461 – OPERATING SYSTEMS
(Regulations 2023)

Branch: B. Tech – AI&DS Date :


Year : II Maximum : 100 Marks
Semester: IV Duration : 3 Hrs.
Answer ALL questions

PART A – (10 x 2 = 20 marks) COs BT


Level

1. Give the objectives of an operating system. CO1 BTL 2


2. What is system boot in operating system? CO1 BTL 1
3. Give the types of system calls in operating system. CO1 BTL 1
4. What are the services of an operating system? CO1 BTL 1
5. Define the term process. CO2 BTL 1
6. Write the use of resource-allocation graph. CO2 BTL 2
7. Define deadlock. CO2 BTL 1
8. List the CPU scheduling algorithms. CO2 BTL 1
9. How does the swapping process occur? CO3 BTL 2
10. Write about contiguous memory allocation. CO3 BTL 1
PART B – (5 x 16 = 80 marks) Cos BT
Level
11. a. Demonstrate the advantages of peer-to-peer systems over client-server systems? (16) CO1 BTL 5
OR
b Explain the evolution of operating system. 16 CO1 BTL 4

12 a i Explain the various structure of an operating system. (8) CO1 BTL 1


ii Identify system calls and system programs in detail with neat sketch. (8) CO1 BTL 1
OR
b Explain the different architecture of OS starting from simple structure, (16) CO1 BTL 3
layered structure, micro kernels, modules and hybrid systems, with
suitable examples OS structure, including Google’s Android.

13. a i Define scheduling .Explain SJF scheduling algorithm. (8) CO2 BTL 4
ii Compute the average waiting time for the processes using non- preemptive (8) CO2 BTL 4
SJF scheduling algorithm.

Process Arrival time Burst time


P1 0 7
P2 2 4
P3 4 1
P4 5 4
P5 3 4
OR
b Evaluate and explain the conditions for deadlock prevention. (16) CO2 BTL 5

14. a Demonstrate in detail the critical section problem and write the algorithm for (16) CO2 BTL 5
producer consumer problem.
OR
10 b (i) Illustrate deadlock with neat example.(6) (16) CO2 BTL 5
(ii) The operating system contains 3 resources, the number of instance of
each resource type are 7,7,10. The current resource allocation state is as
shown below.

Current Allocation Maximum need


Process
R1 R2 R3 R1 R2 R3
P1 2 2 3 3 6 8
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4
Is the current allocation in a safe state? (10)

15. a Compare paging with segmentation in terms of the amount of memory required by the (16) CO3 BTL 3
address translation structures in order to convert virtual addresses to physical
addresses.
OR
b Discuss about contiguous memory allocation with a neat diagram. (16) CO3 BTL 4

You might also like