Operating System PYQ 2022-23 AKTU Question Paper

AKTU · BTECH · Semester 4 · Operating System · Session 2022-23 · PYQ

AKTU Operating System previous year question paper 2022-23 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 2022-23

  1. Q1a. Define two main functions of an operating system. (2 marks, 2022-23)
  2. Q1b. Explain the principal advantages of multiprogramming. (2 marks, 2022-23)
  3. Q1c. Define the term busy waiting. (2 marks, 2022-23)
  4. Q1d. Define semaphore and its types. (2 marks, 2022-23)
  5. Q1e. Explain starvation problem and its solution. (2 marks, 2022-23)
  6. Q1f. Explain internal and external fragmentation. (2 marks, 2022-23)
  7. Q1g. Explain thrashing and locality of reference. (2 marks, 2022-23)
  8. Q1h. Distinguish between physical and logical address space of a process. (2 marks, 2022-23)
  9. Q1i. Explain various operations associated with a file. (2 marks, 2022-23)
  10. Q1j. Explain tree level directory structure. (2 marks, 2022-23)
  11. Q2a. Explain the following terms in detail: (i) Multiprocessor operating system (ii) Real time system (iii) Time sharing system (10 marks, 2022-23)
  12. Q2b. For the following processes, draw Gantt chart to illustrate the execution using (i) Preemptive priority scheduling (ii) Non-Preemptive priority scheduling. Also, Calculate average waiting time and average turnaround time. Process A(AT=0,BT=5,Pri=4), B(AT=2,BT=4,Pri=2), C(AT=2,BT=2,Pri=6),… (10 marks, 2022-23)
  13. Q2c. Consider the given snapshot of a system with five processes (P0,P1,P2,P3,P4) and three resources (A,B,C). Allocation: P0(1,1,2), P1(2,1,2), P2(4,0,1), P3(0,2,0), P4(1,1,2). MAX: P0(4,3,3), P1(3,2,2), P2(9,0,2), P3(7,5,3), P4(11,2,3). Available: (2,1,0). (i) Calculate the content of Need Matrix.… (10 marks, 2022-23)
  14. Q2d. Define process and process control block. Also, describe process state transition diagram in detail. (10 marks, 2022-23)
  15. Q2e. Explain the concept of paging. Also, explain paging hardware support using TLB with suitable diagram. (10 marks, 2022-23)
  16. Q3a. Explain the term RAID and its characteristics. Also, explain various RAID levels with their advantages and disadvantages. (10 marks, 2022-23)
  17. Q3b. Explain the concept of file system management. Also, explain various file allocation and file access mechanisms in details. (10 marks, 2022-23)
  18. Q4a. Explain producer consumer problem and its solution using semaphore. (10 marks, 2022-23)
  19. Q4b. Explain dinning philosopher problem and its solution using semaphore. (10 marks, 2022-23)
  20. Q5a. Explain the concept of demand paging. Consider the given references to the following pages by a program: 0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3. How many pages faults will occur if the program has three-page frames available to it and uses: (i) FIFO replacement (ii) LRU replacement (iii) Optimal… (10 marks, 2022-23)
  21. Q5b. Explain the terms hit ratio and miss ratio. On a simple paged system, associative registers hold the most active page entries and the full-page table is stored in main memory. If references satisfied by associative registers take 100ns, and references through main memory page table takes 180 ns,… (10 marks, 2022-23)
  22. Q6a. Explain the following terms: (i) Multilevel feedback Queue Scheduling (ii) Fixed portioning vs. variable partitioning. (10 marks, 2022-23)
  23. Q6b. Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 49. Calculate the net head movement using: (i) SSTF (ii) SCAN (iii) CSCAN (iv) LOOK. (10 marks, 2022-23)
  24. Q7a. Explain Deadlock and necessary conditions for deadlock. Also, Explain resource allocation graph with suitable diagram. (10 marks, 2022-23)
  25. Q7b. Explain the followings: (i) Buffering (ii) Polling (iii) Direct Memory Access (DMA). (10 marks, 2022-23)

AKTU paper codes: BCS401, KCS401, RCS401

Operating System previous year papers

More Operating System resources

Browse all notes · Semester 4 notes