Operating System PYQ 2024-25 AKTU Question Paper

AKTU · BTECH · Semester 4 · Operating System · Session 2024-25 · PYQ

AKTU Operating System previous year question paper 2024-25 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 2024-25

  1. Q1a. What are the primary functions of an operating system? (2 marks, 2024-25)
  2. Q1a. What are the primary functions of an operating system? (2 marks, 2024-25)
  3. Q1b. A system has 3 processors and 5 programs ready for execution. In how many ways can the processors be assigned to the programs assuming each processor executes one program at a time? (2 marks, 2024-25)
  4. Q1b. A system has 3 processors and 5 programs ready for execution. In how many ways can the processors be assigned to the programs assuming each processor executes one program at a time? (2 marks, 2024-25)
  5. Q1c. What is the difference between a process and a program? (2 marks, 2024-25)
  6. Q1c. What is the difference between a process and a program? (2 marks, 2024-25)
  7. Q1d. In a Producer-Consumer system, the buffer size is 4. If Producer produces 6 items and Consumer consumes 3, find the number of items in the buffer at the end. (2 marks, 2024-25)
  8. Q1d. In a Producer-Consumer system, the buffer size is 4. If Producer produces 6 items and Consumer consumes 3, find the number of items in the buffer at the end. (2 marks, 2024-25)
  9. Q1e. A process executes the following code: fork(); fork(); fork(); How many processes are created in total, including the original? (2 marks, 2024-25)
  10. Q1e. A process executes the following code: fork(); fork(); fork(); How many processes are created in total, including the original? (2 marks, 2024-25)
  11. Q1f. List three components stored in a PCB. (2 marks, 2024-25)
  12. Q1f. List three components stored in a PCB. (2 marks, 2024-25)
  13. Q1g. What is the purpose of a page replacement algorithm? (2 marks, 2024-25)
  14. Q1g. What is the purpose of a page replacement algorithm? (2 marks, 2024-25)
  15. Q2a. Explain the process concept in detail with its states and state transition diagram. (7 marks, 2024-25)
  16. Q2a. Explain the process concept in detail with its states and state transition diagram. (7 marks, 2024-25)
  17. Q2b. Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. P1(AT=0,BT=11,Pri=2), P2(AT=5,BT=28,Pri=0), P3(AT=12,BT=2,Pri=3), P4(AT=2,BT=10,Pri=1), P5(AT=9,BT=16,Pri=4). Draw the Gantt chart and find… (7 marks, 2024-25)
  18. Q2b. Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. P1(AT=0,BT=11,Pri=2), P2(AT=5,BT=28,Pri=0), P3(AT=12,BT=2,Pri=3), P4(AT=2,BT=10,Pri=1), P5(AT=9,BT=16,Pri=4). Draw the Gantt chart and find… (7 marks, 2024-25)
  19. Q2c. Compare and contrast FCFS, SJF, and Round Robin scheduling algorithms. (7 marks, 2024-25)
  20. Q2c. Compare and contrast FCFS, SJF, and Round Robin scheduling algorithms. (7 marks, 2024-25)
  21. Q2d. In optimal page replacement algorithm, information about all future page references is available to the OS. A modification: OS correctly predicts only up to next 4 page references. A process accesses pages: 1, 3, 2, 4, 2, 3, 1, 2, 4, 3, 1, 4. If the system has three memory frames that are… (7 marks, 2024-25)
  22. Q2d. In optimal page replacement algorithm, information about all future page references is available to the OS. A modification: OS correctly predicts only up to next 4 page references. A process accesses pages: 1, 3, 2, 4, 2, 3, 1, 2, 4, 3, 1, 4. If the system has three memory frames that are… (7 marks, 2024-25)
  23. Q3a. Discuss the differences between Batch, Interactive, and Time Sharing Operating Systems with real-world applications. (7 marks, 2024-25)
  24. Q3a. Discuss the differences between Batch, Interactive, and Time Sharing Operating Systems with real-world applications. (7 marks, 2024-25)
  25. Q3b. Two semaphores S1 and S2 are both initialized to 1. Process P1 executes wait(S1); wait(S2); and P2 executes wait(S2); wait(S1);. Explain how a deadlock may occur and under what sequence. (7 marks, 2024-25)
  26. Q3b. Two semaphores S1 and S2 are both initialized to 1. Process P1 executes wait(S1); wait(S2); and P2 executes wait(S2); wait(S1);. Explain how a deadlock may occur and under what sequence. (7 marks, 2024-25)
  27. Q4a. Define the Critical Section Problem and list the conditions that a solution must satisfy. (7 marks, 2024-25)
  28. Q4a. Define the Critical Section Problem and list the conditions that a solution must satisfy. (7 marks, 2024-25)
  29. Q4b. A system shares 9 tape drives. Current allocation and maximum requirement: P1(alloc=3, max=7), P2(alloc=1, max=6), P3(alloc=3, max=5). Which of the following best describes current state: 1. Safe, Deadlocked 2. Safe, Not Deadlocked 3. Not Safe, Deadlocked 4. Not Safe, Not deadlocked. Explain. (7 marks, 2024-25)
  30. Q4b. A system shares 9 tape drives. Current allocation and maximum requirement: P1(alloc=3, max=7), P2(alloc=1, max=6), P3(alloc=3, max=5). Which of the following best describes current state: 1. Safe, Deadlocked 2. Safe, Not Deadlocked 3. Not Safe, Deadlocked 4. Not Safe, Not deadlocked. Explain. (7 marks, 2024-25)
  31. Q5a. Discuss the limitations of Dekker's and Peterson's solutions when applied to modern multiprocessor architectures. (7 marks, 2024-25)
  32. Q5a. Discuss the limitations of Dekker's and Peterson's solutions when applied to modern multiprocessor architectures. (7 marks, 2024-25)
  33. Q5b. Explain file directories and directory structures in operating systems. (7 marks, 2024-25)
  34. Q5b. Explain file directories and directory structures in operating systems. (7 marks, 2024-25)
  35. Q6a. Discuss multiprogramming with variable partitions and how it improves memory utilization. (7 marks, 2024-25)
  36. Q6a. Discuss multiprogramming with variable partitions and how it improves memory utilization. (7 marks, 2024-25)
  37. Q6b. Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. 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.… (7 marks, 2024-25)
  38. Q6b. Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. 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.… (7 marks, 2024-25)
  39. Q7a. Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte addressable, what is the maximum number of entries in the page table? (7 marks, 2024-25)
  40. Q7a. Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte addressable, what is the maximum number of entries in the page table? (7 marks, 2024-25)

AKTU paper codes: BCS401, KCS401, RCS401

Operating System previous year papers

More Operating System resources

Browse all notes · Semester 4 notes