JMS INSTITUTE OF TECHNOLOGY, GHAZIABAD
PRE UNIVERSITY Examination (2024-25)
Course: B. Tech Time: - 2 Hour 30 Min
Class: 2nd Year 4th Sem MM: - 60
Subject Code: BCS-401 Subject: - Operating System
**********************************************************************************************************
A. Attempt any three parts. 6 × 3 = 18
Q1. Difference between Process and Program.
Q2. Explain Context Switching.
Q3. Define operating system explain in short.
Q4. Write down the different types of operating system
B. Attempt any three parts. 7 × 3 = 21
Q1. What is Critical Section?
Q2. What are the various scheduling criteria for CPU scheduling?
Q3. What is Dining Philosophers problem? Discuss the solution to Dining philosopher’s problem using monitors.
Q4. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores.
C. Attempt any three parts. 7 × 3 = 21
Q1. Explain in detail about the Process Control Block (PCB) in CPU Scheduling
Q2. Explain in detail about the Threads and their management.
Q3. Define Process. Explain various steps involved in change of a process state with neat transition diagram.
Q4. Is it possible to have a deadlock involving only a single process? Explain.
JMS INSTITUTE OF TECHNOLOGY, GHAZIABAD
PRE UNIVERSITY Examination (2024-25)
Course: B. Tech Time: - 2 Hour 30 Min
Class: 2nd Year 4th Sem MM: - 60
Subject Code: BCS-403 Subject: - OOPs
**********************************************************************************************************
A. Attempt any three parts. 7 × 3 = 21
1. What do you mean by the safe state and an unsafe state?
2. Explain Paging with example. Differentiate Paging and Segmentation.
3. Explain the difference between External fragmentation and Internal fragmentation. How to solve the
fragmentation problem using paging?
4. What is the main function of the memory-management unit?
B. Attempt any three parts. 6 × 3 = 18
1. Illustrate the following page-replacement algorithms. i) FIFO ii) Optimal Page Replacement Use the reference
string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1 for a memory with three frames.
2. Explain in detail about the Disk storage and Disk scheduling.
3. Define SCAN and C-SCAN scheduling algorithm
4. Consider the following page reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 How many page faults
would occur for the optimal page replacement algorithm, assuming three frames and all frames are initially
empty.
B. Attempt any three parts. 7 × 3 = 21
1. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently serving the request at
cylinder 143,and the previous request was at cylinder 125.The status of the queue is as follows 86, 1470, 913,
1774,948,1509,1022,1750,130 What is the total distance (in cylinders) that the disk arm moves to satisfy the
entire pending request for each of the following disk scheduling algorithms? (i) SSTF (ii) FCFS
2. Define Seek time and Latency time.
3. Discuss the Linked, Contiguous and Index and multilevel Indexing file allocation schemes. Which allocation
scheme will minimize the amount of space required in directory structure and why?
4. What is Thrashing? What is the cause of Thrashing? How does the system detect Thrashing? What can the
system do to eliminate this problem?
