FREE
AKTU Operating System (BEEZ051) Syllabus PDF – B.Tech 3rd Year
Operating System BEEZ051
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 5
- 0 downloads
- 0 views
Official AKTU syllabus of Operating System (BEEZ051) for B.Tech 3rd Year – 3 credits, L-T-P 3-0-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
Syllabus — Operating System
Download PDFBEEZ051 · 3 credits · L-T-P 3-0-0
BEEZ051: Operating System
Course Outcomes
At the end of the course, the student will be able to:
| CO 1 | Understand the structure and functions of OS | K1, K2 |
| CO 2 | Learn about Processes, Threads and Scheduling algorithms. | K1, K2 |
| CO 3 | Understand the principles of concurrency and Deadlocks | K2 |
| CO 4 | Learn various memory management schemes. | K2 |
| CO 5 | Study I/O management and File systems. | K2, K4 |
Course Content
L-T-P: 3-1-0
| Unit | Topic | Proposed Lecture |
|---|---|---|
| I | Introduction: 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. | 08 |
| II | Concurrent Processes: 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. | 08 |
| III | CPU Scheduling: 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. | 08 |
| IV | Memory Management: 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. | 08 |
| V | I/O Management and Disk Scheduling: 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. | 08 |
Text Books
- Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
- Sibsankar Halder and Alex A Aravind, “Operating Systems”, Pearson Education
- Harvey M Dietel, “ An Introduction to Operating System”, Pearson Education
- D M Dhamdhere, “Operating Systems : A Concept based Approach”, 2nd Edition, TMH
- William Stallings, “Operating Systems: Internals and Design Principles”, 6th Edition, Pearson Education
Ratings & Reviews
No reviews yet — share your experience with this item.