GUG · Second Year B.Tech. Computer Science and Engineering · NEP 2020
Operating Systems
STPCCCSE304 · Semester III · 3 credits · IE 10 + mid-semester 10 + ESE 80
Unit 1: Basics of OS and Processes
9 hoursTypes of operating systems and their services; booting and dual booting; system calls and their types. Processes: states, types and the PCB; schedulers and context switching; threads, their types and multithreading.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Operating system objectives, functions and types
- System calls and OS services
- Processes, process states and the PCB
- Context switching and schedulers
- Threads and multithreading
Unit 2: CPU Scheduling
9 hoursScheduling algorithms: FCFS, SJF, priority and round robin, with problems; multilevel queue and multilevel feedback queue scheduling; starvation and aging.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- CPU scheduling: FCFS, SJF, round robin and priority
- Multilevel feedback queue
Unit 3: Inter-Process Communication and Synchronisation
9 hoursThe need for IPC and its approaches: pipes, sockets, files, signals, shared memory and semaphores; process cooperation and synchronisation, race conditions and the critical section; the bounded-buffer (producer-consumer), dining-philosophers and readers-writers problems.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 4: Deadlocks, Disk Scheduling and File Systems
9 hoursConditions for deadlock and methods of handling it; resource allocation graphs; the banker's algorithm with problems. Disk scheduling: physical characteristics and the FCFS, SSTF, SCAN and C-SCAN algorithms. File systems: sequential, linked and indexed access.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 5: Memory Management
9 hoursContiguous and non-contiguous allocation and fragmentation; virtual memory, paging and segmentation; the TLB; demand paging, page faults and thrashing; page replacement algorithms.
Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Memory allocation and fragmentation
- Paging and segmentation
- Translation lookaside buffer
- Virtual memory and demand paging
- Page replacement: FIFO, LRU and optimal
- Thrashing
Unit contents are summarised from the official GUG syllabus . AiCanCode.org is not affiliated with Gondwana University, Gadchiroli.