BMC203

Operating Systems

L-T-P3-0-0 Credits3 Session2024-25 TypeTheory
Appears in 1 semester

MCA · Sem 2 (Core)

Syllabus

5 units · 40 lecture hours
Unit1

Unit 1: Introduction

8 hrs

Operating System Structure- Layered structure, System Components, Operating system functions, Classification of Operating systems- Batch, Interactive, Time-sharing, Real-Time System, Multiprocessor Systems, Multiuser Systems, Multi process Systems, Multithreaded Systems, Operating System services, Reentrant Kernels, Monolithic and Microkernel Systems.

Unit2

Unit 2: Concurrent Processes

8 hrs

Process Concept, Principle of Concurrency, Producer / Consumer Problem, Mutual Exclusion, Critical Section Problem, Dekker’s solution, Peterson’s solution, Semaphores, Test and Set operation, Classical Problem in Concurrency- Dining Philosopher Problem, Sleeping Barber Problem, Inter Process Communication models and Schemes, Process generation.

Unit3

Unit 3: CPU Scheduling

8 hrs

Scheduling Concepts, Performance Criteria, Process States, Process Transition Diagram, Schedulers, Process Control Block (PCB), Process address space, Process identification information, Threads and their management, Scheduling Algorithms, Multiprocessor Scheduling. Deadlock: System model, Deadlock characterization, Prevention, Avoidance and detection, Recovery from deadlock.

Unit4

Unit 4: Memory Management

8 hrs

Basic bare machine, Resident monitor, Multiprogramming with fixed partitions, Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation, Virtual memory concepts, Demand paging, Performance of demand paging, Page replacement algorithms, Thrashing, Cache memory organization, Locality of reference.

Unit5

Unit 5: I/O Management and Disk Scheduling

8 hrs

I/O devices, and I/O subsystems, I/O buffering, Disk storage and disk scheduling, RAID. File System: File concept, File organization and access mechanism, File directories, and File sharing, File system implementation issues, File system protection and security.

Course Outcomes (COs)5 outcomes

After completion of the course student will be able to:

  1. CO1Explain main components, services, types and structure of Operating Systems.K2
  2. CO2Apply the various algorithms and techniques to handle the various concurrency control issues.K3
  3. CO3Compare and apply various CPU scheduling algorithms for process execution.K2
  4. CO4Identify occurrence of deadlock and describe ways to handle it.K3
  5. CO5Explain and apply various memory, I/O and disk management techniques.K5

Suggested Readings

  1. Silberschatz A., Galvin P. B. and Gagne G., “Operating Systems Concepts”, Wiley Pub.
  2. Halder S. and Arvind A. A “Operating Systems”, Pearson Education.
  3. Dietel H. M, “ An Introduction to Operating System”, Pearson Education.
  4. Stallings W., “Operating Systems: Internals and Design Principles”, Pearson Education.
  5. Harris J.A., “Operating Systems (Schaum's Outlines)”, McGraw Hill Education.

Official AKTU syllabus

This subject is on page 22, 23 of the original AKTU PDF.

Official AKTU syllabus PDF ↗