Operating System PYQ 2025-26 AKTU Question Paper

AKTU · BTECH · Semester 4 · Operating System · Session 2025-26 · PYQ

AKTU Operating System previous year question paper 2025-26 for B.Tech Semester 4. Covers Introduction to Operating Systems, Concurrent Processes, CPU…

Open the interactive reader to study this resource on AcademicArk.

Operating System AKTU syllabus

  1. Unit 1: Introduction to Operating Systems
  2. Unit 2: Concurrent Processes
  3. Unit 3: CPU Scheduling and Deadlock
  4. Unit 4: Memory Management
  5. Unit 5: I/O Management and File Systems

Questions in Operating System AKTU PYQ 2025-26

  1. Q1a. What is the main advantage of the layered approach to system design? (2 marks, 2025-26)
  2. Q1b. What is interprocess communication? How can it be implemented? (2 marks, 2025-26)
  3. Q1c. A counting semaphore is initialized to 10. Then 6 P (wait) and 4 V (signal) operations are performed on this semaphore. What will be the resulting value of the semaphore? (2 marks, 2025-26)
  4. Q1d. Illustrate the reason for the convoy effect in process scheduling. (2 marks, 2025-26)
  5. Q1e. What are the necessary conditions for deadlock in an operating system? (2 marks, 2025-26)
  6. Q1f. What is locality of reference in demand paging? (2 marks, 2025-26)
  7. Q1g. Explain seek time and rotational latency while accessing the disk. (2 marks, 2025-26)
  8. Q2a. The services and functions provided by an operating system can be divided into two main categories. Briefly describe the two categories and discuss how they differ. (7 marks, 2025-26)
  9. Q2b. Describe the actions taken by a kernel to context-switch between processes. (7 marks, 2025-26)
  10. Q2c. Consider a system consisting of m resources of the same type being shared by n processes. A process can request or release only one resource at a time. Show that the system is deadlock free if the following two conditions hold: (i) The maximum need of each process is between one resource and m… (7 marks, 2025-26)
  11. Q2d. Explain the working of the Translation Lookaside Buffer (TLB) along with the page table in address translation, with a neat diagram. (7 marks, 2025-26)
  12. Q2e. What are the advantages of using RAID architecture in disk drive? Explain in detail. (7 marks, 2025-26)
  13. Q3a. What is the main advantage of the microkemel approach to system design? How do user programs and system services interact in a microkernel architecture? (7 marks, 2025-26)
  14. Q3b. Discuss the classification of operating systems and provide real-world examples for each type. (7 marks, 2025-26)
  15. Q4a. Consider the set of processes with arrival time (in milliseconds) and CPU burst time (in milliseconds) shown below. None of the processes have I/O burst time. Draw the Gantt chart and calculate the Average Waiting Time and Average Turnaround Time using the preemptive Shortest Job First (SJF)… (7 marks, 2025-26)
  16. Q4b. What is a Process Control Block? Explain its role in process management. (7 marks, 2025-26)
  17. Q5a. What do you mean by critical section? How semaphore can be used to ensure synchronization in critical section? Each process P_i, i=1…9 is coded as follows: Repeat P(mutex){ critical section } V(mutex) Forever The code for P10 is identical except that it uses V(mutex) in place of P(mutex). What is… (7 marks, 2025-26)
  18. Q5b. Consider the following snapshot of a system: | | Allocation A | Allocation B | Allocation C | Allocation D | Max A | Max B | Max C | Max D | Available A | Available B | Available C | Available D | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | T0 | 0 | 0 | 1 | 2… (7 marks, 2025-26)
  19. Q6a. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory? (7 marks, 2025-26)
  20. Q6b. Consider the virtual page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6 on a demand paged virtual memory system running on a computer system that has main memory size of 4 page frames which are initially empty. How many pages faults will occur if the program uses: LRU… (7 marks, 2025-26)
  21. Q7a. Consider a disk queue with requests for I/O to blocks on cylinders 47,38,121,191,87,11,92,10. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. What is the total head movement (in number of… (7 marks, 2025-26)
  22. Q7b. Explain the followings in detail: (i) Direct Memory Access (ii) Interrupt (iii) Polling (7 marks, 2025-26)

AKTU paper codes: BCS401, KCS401, RCS401

Operating System previous year papers

More Operating System resources

Browse all notes · Semester 4 notes · Operating System notes