Operating System Unit 3 Handwritten Notes AKTU (BCS401)

AKTU · BTECH · Semester 4 · Operating System · Unit 3 · Handwritten Notes

AKTU Operating System (BCS401) Unit 3 handwritten notes for B.Tech Semester 4 – CPU Scheduling and Deadlock. Topics: CPU Scheduling, Threads and Management…

A preview is available. Sign in or check access options in the reader for the complete resource.

Unit 3: CPU Scheduling and Deadlock – AKTU syllabus topics

  • CPU Scheduling: Scheduling Concepts and Criteria, Process States and PCB, Scheduling Algorithms, Multiprocessor Scheduling
  • Threads and Management
  • Deadlock: Deadlock Characterization, Deadlock Prevention and Avoidance, Deadlock Detection and Recovery

Most asked AKTU PYQ questions from Unit 3

  1. 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)
  2. Q2a. Explain the process concept in detail with its states and state transition diagram. (7 marks, 2024-25)
  3. 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)
  4. Q4a. Explore the concept of deadlock and how it can occur in concurrent systems, discussing prevention and avoidance techniques? (7 marks, 2023-24)
  5. Q5a. Evaluate strategies for deadlock prevention, avoidance, detection, and recovery in concurrent systems, highlighting their effectiveness and trade-offs? (7 marks, 2023-24)
  6. Q1f. List three components stored in a PCB. (2 marks, 2024-25)
  7. 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)
  8. 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)
  9. Q2d. Define process and process control block. Also, describe process state transition diagram in detail. (10 marks, 2022-23)
  10. Q6a. Explain the following terms: (i) Multilevel feedback Queue Scheduling (ii) Fixed portioning vs. variable partitioning. (10 marks, 2022-23)

AKTU paper codes: BCS401, KCS401, RCS401

Other Operating System units

Operating System previous year papers

More Operating System resources

Browse all notes · Semester 4 notes