AMITY UNIVERSITY MAHARASHTRA
AMITY SCHOOL OF ENGINEERING & TECHNOLOGY
B. Tech Computer Science & Engineering
ACADEMIC YEAR: 2023-24 EVEN
CLASS/SEM: II/ 04 SPECIALIZATION: CSE
COURSE CODE: CSE2402 SUBJECT: Operating System
QUESTION BANK
MODULE 1
Q. No. Question CO
1. Elaborate on the operating system structure CO1
2. Explain batch system and Multiprogrammed System in detail. CO1
3. Define the Distributed system and explain its features CO1
4. Explain the concept of virtual machines. Bring out its advantages. CO1
5. Define spooling and the need for it. Explain its working with necessary diagrams. CO1
6. Explain in detail about System Calls CO1
MODULE 2
Q. No. Question CO
1. Explain about Inter-Process Communication. CO2
2. Explain CPU Scheduling with an Example CO2
3. List the main differences and similarities between threads and processes. CO2
4. Explain deadlock avoidance with a suitable example using a banker’s algorithm. CO2
For the following set of processes find the average waiting time using the Gantt chart
for
1. SJF
5. CO2
2. Priority scheduling process
Process Burst time Priority
P1 5 5
P2 3 4
P3 8 3
P4 2 1
P5 1 2
The process has arrived in the order p2, p1, p4, p3 and p5
6. Explain Process Control Block. Draw the block diagram of process transition states. CO2
MODULE 3
Q. No. Question CO
1. What is virtual memory and what are its advantages CO3
Consider the following page reference string.
2. 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2 How many page faults would occur for the CO3
following replacement algorithm, assuming four and six frames respectively?
Consider the reference stream 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. And 4-page
3. slots. Calculate the No. of page faults, Page faults Probability, and Page faults CO3
percentage. using FIFO Page replacement algorithms.
Explain about given memory management techniques. (i) Partitioned allocation (ii)
4. CO3
Paging and translation look-aside buffer.
5. Elaborate about the free space management on I/O buffering and blocking. CO3
What is the dynamic storage allocation problem? Mention the names of different
6. CO3
methods used to solve the above problem.
MODULE 4
Q. No. Question CO
1. What are the various disk space allocation methods? Explain in detail. CO4
2. Explain various disk scheduling algorithms. CO4
3. Analyze the concept of buffering. How is the double buffering scheme organized? CO4
4. What are the different modes of Interrupt? How is polling achieved? CO4
5. Explain file system mounting operation. CO4
6. What are the different access methods? Explain. CO4
MODULE 5
Q. No. Question CO
1. Explain the File System Structure in detail CO5
2. Illustrate the functions of file and file implementation. CO5
Compare the functionalities of FCFS, SSTF, C-SCAN, and C-LOOK with the
3. CO5
Example.
4. Define RAID Structure. Discuss different types of RAID levels. CO5
Explain the following file allocation methods
5. a) Contiguous allocation CO5
b) i-node
6. Compare file organization methods CO5
MODULE 6
Q. No. Question CO
1. Describe the access matrix model used for protection. CO6
Explain different methods used to solve the problem of security at the operating
2. CO6
system level
3. What are protection goals and principles? CO6
4. Explain in detail about Program threads in cryptography CO6
Faculty I/C
