Operating Systems (MCA)

Processes, CPU scheduling, synchronisation, deadlocks, memory management, file systems and I-O management.

6 महीनेअवधि 5Chapters29टॉपिक

सिलेबस · पाठ्यक्रम

Download PDF
01Unit 1: Introduction 5 टॉपिक
  1. Operating system functions and services
  2. Types: batch, multiprogramming, time-sharing, real-time, distributed
  3. System calls and system programs
  4. OS structure: monolithic, layered, microkernel
  5. Kernel and user mode
02Unit 2: Concurrent Processes 6 टॉपिक
  1. Process concept, PCB and process states
  2. Principle of concurrency and critical section
  3. Mutual exclusion: Dekker's and Peterson's solutions
  4. Semaphores and their operations
  5. Classical problems: producer-consumer, readers-writers, dining philosophers
  6. Inter-process communication
03Unit 3: CPU Scheduling and Deadlocks 6 टॉपिक
  1. Scheduling criteria
  2. FCFS, SJF, SRTF, priority and round-robin scheduling
  3. Multilevel queue and multilevel feedback queue
  4. Deadlock characterisation
  5. Deadlock prevention and avoidance: Banker's algorithm
  6. Deadlock detection and recovery
04Unit 4: Memory Management 6 टॉपिक
  1. Contiguous allocation and fragmentation
  2. Paging and page tables
  3. Segmentation
  4. Virtual memory and demand paging
  5. Page replacement: FIFO, optimal, LRU
  6. Thrashing and working set
05Unit 5: I-O Management, Disk Scheduling and File Systems 6 टॉपिक
  1. I-O devices and buffering
  2. Disk structure
  3. Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK
  4. File concept, access methods and directories
  5. File allocation: contiguous, linked and indexed
  6. Free-space management

परिचय

आप यह कर पाएँगे

  • 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

यह किसके लिए है

  • MCA students of Semester 2 (AKTU, Lucknow)
  • Students preparing for GATE / placement tests on operating system concepts

आपको क्या चाहिए

  • Computer Organization & Architecture (Semester 1)
  • Basic C programming

सवाल

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.

Download the syllabus (PDF)

Tell us who you are — your copy is made with your name, and our counsellor can help you choose the right course and centre.

Want to join right away? अभी पूछताछ करें — our centre will call you.