Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
GATE CS 2026 Mastery Course
·
Module 11
Operating Systems
1
Process States and PCB in Context Switching
Trace the state transitions of a process and describe the role of the Process Control Block (PCB) in a context switch.
2
User vs. Kernel Threads and Multithreading Models
Compare user-level and kernel-level threads and analyze different multithreading models.
3
Solving Classical Synchronization Problems
Solve classical synchronization problems (e.g., Producer-Consumer) using semaphores and monitors.
4
Deadlock Detection and Avoidance
Analyze a system state for deadlock using a resource allocation graph and apply the Banker's algorithm for deadlock avoidance.
5
Process Scheduling Performance Analysis
Calculate the average waiting and turnaround time for a set of processes under FCFS, SJF, Priority, and Round Robin scheduling algorithms.
6
Effective Access Time with TLB
Calculate effective memory access time in a paging system with a TLB.
7
Page Replacement Algorithms: FIFO, LRU, Optimal
Trace the behavior of page replacement algorithms (FIFO, LRU, Optimal) for a given memory reference string.
File Allocation and Disk Scheduling
Compare file allocation methods (contiguous, linked, indexed) and disk scheduling algorithms (FCFS, SSTF, SCAN, C-SCAN).
Previous module
Compiler Design
Next module
Databases and Computer Networks