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: IntroductionUnit 2: Concurrent ProcessesUnit 3: CPU Scheduling and Deadlocks
- 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 Systems
- 4
Unit tests & assignmentsयूनिट टेस्टRegular tests in the university / board pattern.
- 5
Semester 2 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
5 topics+
- Operating system functions and services
- Types: batch, multiprogramming, time-sharing, real-time, distributed
- System calls and system programs
- OS structure: monolithic, layered, microkernel
- Kernel and user mode
02Unit 2: Concurrent Processes
6 topics+
- Process concept, PCB and process states
- Principle of concurrency and critical section
- Mutual exclusion: Dekker's and Peterson's solutions
- Semaphores and their operations
- Classical problems: producer-consumer, readers-writers, dining philosophers
- Inter-process communication
03Unit 3: CPU Scheduling and Deadlocks
6 topics+
- Scheduling criteria
- FCFS, SJF, SRTF, priority and round-robin scheduling
- Multilevel queue and multilevel feedback queue
- Deadlock characterisation
- Deadlock prevention and avoidance: Banker's algorithm
- Deadlock detection and recovery
04Unit 4: Memory Management
6 topics+
- Contiguous allocation and fragmentation
- Paging and page tables
- Segmentation
- Virtual memory and demand paging
- Page replacement: FIFO, optimal, LRU
- Thrashing and working set
05Unit 5: I-O Management, Disk Scheduling and File Systems
6 topics+
- I-O devices and buffering
- Disk structure
- Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK
- File concept, access methods and directories
- File allocation: contiguous, linked and indexed
- Free-space management
About this course
You will be able to
- Explain the functions, types and structure of an operating system and system calls
- Solve critical-section problems using Peterson's solution and semaphores
- Calculate waiting and turnaround times for FCFS, SJF, priority and round-robin scheduling
- Apply deadlock prevention, avoidance (Banker's algorithm) and detection
- Work out paging addresses and page faults for FIFO, optimal and LRU replacement
- Compare disk scheduling algorithms and file allocation methods
Who it is for
- MCA students of Semester 2 (AKTU, Lucknow)
- Students preparing for GATE / placement tests on operating system concepts
What you need
- Computer Organization & Architecture (Semester 1)
- 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 this Operating Systems course follow?
It follows the AKTU (Lucknow) MCA syllabus for Semester 2. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.
Are there many numericals?
Yes. CPU scheduling, Banker's algorithm, page replacement and disk scheduling numericals are solved step by step with practice sheets.
How are students tested at the centre?
Unit-wise MCQ tests, numerical / problem practice, previous AKTU question papers and a final mock paper before the semester exam.
