PYQ – OPERATING SYSTEM (2418302) | SEMESTER 3RD (2ND YEAR) | Year 2025

Operating System 2025 NEW PYQ.

Group A

Choose the most suitable answer from the following options: -   (1*20=20)

(i) The process of switching the CPU from one process to another is called ______.

(a) Deadlock

(b) Context Switch

(c) Paging

(d) Segmentation

(ii) Match the Following:

     Column A           Column B

     1. FIFO              A. Page not used for longest time

     2. RLU               B. Oldest page replaced

     3. Optimal          C. Page not needed in future

(iii) Choose Odd one:

(a) Batch OS

(b) Time Sharing OS

(c) Multiprocessing OS

(d) MS-Word

(iv) ______ holds process information like state, program counter, etc.

(a) PCB                                    

(b) Scheduler

(c) Context Switch

(d) Cache

(v) FCFS is a preemptive scheduling algorithm.

(a) True

(b) False

 

(vi) Which is not a file access method? 

(a) Sequential

(b) Direct

(c) Indexed

(d) Paging

(vii) ____ algorithm uses time quantum.

(a) FCFS

(b) Round Robinn

(c) Priority

(d) SJF

(viii) A process in the ____ state is currently using the CPU.

(a) Waiting

(b) Ready

(c) Running

(d) New

(ix) Match the following:

 

Column A	Column B
Throughput	Average waiting time
Turnaround time	Jobs completed per unit time
Waiting Time	Completion time – arrival time
Response Time	Time from request to first response

 

 
(x) Segmentation divides memory into fixed-size blocks.

(a) True

(b) False 

 

Group:-"B"

➥ Answer all Five Questions: -                         (5*4=20) 

 

2. Discuss the major function of an Operating System.  

 

                                                                              OR

Distinguish between process and thread.

 

3. Define CPU scheduling and its objectives. 

OR

State the concept of page fault.

 

4. Discuss deadlock and necessary condition of deadlock. 

OR

Distinguish between logical and physical address space.

 

5. Explain banker’s algorithm for deadlock avoidance. 

OR

Discuss on long-term, medium-term, and short-term schedulers.

 

6. Distinguish between User-level threads and Kernel-level threads.

OR

Write the advantages and disadvantages of Round Robin Scheduling.

 

Group:- "C"

➥ Answer all Five Questions: -                         (5*6=30) 

 

7. Discuss various File Operations in Operating Systems.  

OR

Explain Fixed and Variable Partitioning in Memory Management.

 

8. Consider the reference stream 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1, How many page faults using (using 3 frames). 

OR

Consider the following processes with their arrival times and burst times:

Process                      Arrival Time                     Burst Time

    P1                                     0                                         6

    P2                                     2                                         8

    P3                                     4                                         7

    P4                                     5                                         3 

Calculate the Waiting Time and Turnaround Time for each process, and find the Average Waiting Time and Average Turnaround Time using FCFS Scheduling.

 

9. Explain different process states with diagram.  

OR

Explain paging and segmentation in detail with diagram.

 

10. Explain how virtual memory allows a process to execute even if it is not completely in main memory.  

OR

Explain Single Level and Tow-Level Directory Structure.

 

11. Discuss the concept of page replacement algorithms with examples.  

OR

Write shorts notes on-

System call

Starvation

 

*****