Your roadmap · आपका रोडमैप
- 1
Admission & first meetingप्रवेश और पहली मुलाकातEnquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.
- 2
Part 1 of the syllabusपाठ्यक्रम भाग 1Unit-wise coaching with notes and doubt classes.
Unit 1: Introduction and OS StructureUnit 2: Concurrent Processes and SynchronisationUnit 3: CPU Scheduling and Deadlock
- 3
Part 2 of the syllabusपाठ्यक्रम भाग 2Unit-wise coaching with notes and doubt classes.
Unit 4: Memory ManagementUnit 5: I-O Management, Disk Scheduling and File System
- 4
Unit tests & assignmentsयूनिट टेस्टRegular tests in the university / board pattern.
- 5
Semester 4 exam (university / board)विश्वविद्यालय / बोर्ड परीक्षाPrevious papers and full revision before the exam.
- 6
Online tests & resultऑनलाइन टेस्ट और रिज़ल्टTake the tests online; your marks and result show in your student login and at the centre.
Syllabus · पाठ्यक्रम
1 subject · 5 chapters · 29 topics
01Unit 1: Introduction and OS Structure
5 topics+
- Operating system and its functions
- Batch, interactive, time-sharing, real-time, multiprocessor, multiuser and multithreaded systems
- Layered, monolithic and microkernel structures
- System components, OS services and system calls
- Reentrant kernels
02Unit 2: Concurrent Processes and Synchronisation
6 topics+
- Process concept and principle of concurrency
- Producer-consumer problem and mutual exclusion
- Critical section problem, Dekker's and Peterson's solutions
- Semaphores and test-and-set
- Readers-writers, dining philosophers and sleeping barber problems
- Inter-process communication and process generation
03Unit 3: CPU Scheduling and Deadlock
6 topics+
- Process states, transition diagram and PCB
- Threads and their management
- Scheduling criteria and algorithms: FCFS, SJF, SRTF, priority, round robin
- Multiprocessor scheduling
- Deadlock characterisation and prevention
- Deadlock avoidance (Banker's algorithm), detection and recovery
04Unit 4: Memory Management
6 topics+
- Bare machine and resident monitor
- Fixed and variable partitions, protection
- Paging, segmentation and paged segmentation
- Virtual memory and demand paging
- Page replacement algorithms: FIFO, optimal, LRU
- Thrashing, cache memory and locality of reference
05Unit 5: I-O Management, Disk Scheduling and File System
6 topics+
- I-O devices, I-O subsystem and buffering
- Disk structure and disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK
- RAID levels
- File concept, access methods and directory structure
- Allocation methods and free-space management
- File sharing and protection
About this course
You will be able to
- Explain the functions, types and structures (monolithic, layered, microkernel) of operating systems
- Solve the critical-section problem using Peterson's solution, semaphores and monitors
- Compute waiting and turnaround times for FCFS, SJF, priority and round robin scheduling
- Detect and avoid deadlocks using resource allocation graphs and the Banker's algorithm
- Apply paging, segmentation and page replacement algorithms and explain thrashing
- Calculate disk head movement for disk scheduling algorithms and describe file allocation methods
Who it is for
- B.Tech Computer Science & Engineering, Information Technology students of Semester 4 (AKTU)
- Students of other universities studying the same subject who want unit-wise coaching
What you need
- Computer Organization and Architecture and Data Structure (Semester 3)
- Basic C programming
Online tests & result
Practice and unit tests online; marks and result show in your student login and at the centre.
Student login →
Questions
Which syllabus does the Operating System course follow?
It follows the AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus for Operating System. If your own university's syllabus differs, the centre follows your university syllabus.
Will this help in the university examination?
Yes. Teaching is unit-wise as per the AKTU scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.
Are scheduling and page replacement numericals practised?
Yes. Gantt charts, Banker's algorithm, page replacement and disk scheduling numericals are practised unit-wise.
