BEEZ051

Operating System

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

B.Tech Electrical & Computer Engineering · Sem 5 (Departmental Elective-I)

Syllabus

5 units · 40 lecture hours
Unit1

Unit 1: Introduction

8 hrs

Operating system and functions, Classification of Operating systems- Batch, Interactive, Time sharing, Real-Time System, Multiprocessor Systems, Multiuser Systems, Multiprocess Systems, Multithreaded Systems, Operating System Structure- Layered structure, System Components, 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. CO1Understand the structure and functions of OSK1, K2
  2. CO2Learn about Processes, Threads and Scheduling algorithms.K1, K2
  3. CO3Understand the principles of concurrency and DeadlocksK2
  4. CO4Learn various memory management schemes.K2
  5. CO5Study I/O management and File systems.K2, K4

Text Books

  1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
  2. Sibsankar Halder and Alex A Aravind, “Operating Systems”, Pearson Education
  3. Harvey M Dietel, “ An Introduction to Operating System”, Pearson Education
  4. D M Dhamdhere, “Operating Systems : A Concept based Approach”, 2nd Edition, TMH
  5. William Stallings, “Operating Systems: Internals and Design Principles”, 6th Edition, Pearson Education

Official AKTU syllabus

This subject is on page 19 of the original AKTU PDF.

Official AKTU syllabus PDF ↗