Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify

HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify

HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify

Your companion for professional and national entrance exam preparation. Detailed syllabus, tracking, and more.

Top Exams

  • IIT JEE
  • NEET
  • UPSC Civil Services
  • SSC CGL
  • GATE

Legal & Support

  • Privacy Policy
  • Terms & Conditions
  • Contact Us

Get the App

GET IT ONGoogle Play
© 2026 Syllabify. All rights reserved.
Made with by Unitech Studio
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify

HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify

HomeBrowse Exams
Download App
Theme
  1. Exams
  2. GATE CS & IT
  3. Computer Science and Information Technology
  4. Operating System
medium8 marks

Operating System

System calls, processes, threads, IPC, concurrency and synchronization, deadlock, CPU and I/O scheduling, memory management, virtual memory, file systems.

10 Topics
35h prep
11.11% subject weight
10 Topics
1

System calls

Interface between user program and OS kernel.

1m1/10
📌 Key FormulaTransition from user to kernel mode.
2

Processes

Program in execution, with PCB, states: new, ready, running, waiting, terminated.

1m2/10
📌 Key FormulaContext switch time.
3

Threads

Lightweight process sharing same address space.

1m2/10
📌 Key FormulaUser-level vs kernel-level threads.
4

Inter-process communication

IPC mechanisms: pipe, message queue, shared memory, socket, signal.

1m2/10
📌 Key FormulaShared memory fastest, synchronization needed.
5

Concurrency and synchronization

Race conditions, critical sections, mutex, semaphores, monitors.

2m3/10
📌 Key FormulaSemaphore P (wait) and V (signal).
6

Deadlock

Four necessary conditions: mutual exclusion, hold and wait, no preemption, circular wait.

1m2/10
📌 Key FormulaBanker's algorithm for deadlock avoidance.
7

CPU and I/O scheduling

Scheduling algorithms: FCFS, SJF, priority, round-robin, multilevel queue. I/O scheduling: disk scheduling (FCFS, SSTF, SCAN, C-SCAN).

1m2/10
📌 Key FormulaTurnaround time = completion - arrival, waiting time = turnaround - burst.
8

Memory management

Contiguous allocation, partitioning, paging, segmentation. Swapping.

1m2/10
📌 Key FormulaLogical address to physical address translation.
9

Virtual memory

Demand paging, page fault, page replacement algorithms (FIFO, LRU, Optimal, Clock).

1m3/10
📌 Key FormulaEffective access time = (1-p)*memory access + p*page fault time.
10

File systems

File structure, directory implementation, allocation methods (contiguous, linked, indexed), free space management.

1m2/10
📌 Key FormulaInode structure in Unix.