Scribd
Upload
44 views

CS 405 Operating Systems

cv vd;clll;wrfl,lr,;

Uploaded by

karandeshreyansh09
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views

CS 405 Operating Systems

cv vd;clll;wrfl,lr,;

Uploaded by

karandeshreyansh09
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science and Engineering, IV-Semester

CS405 Operating Systems

RATIONALE:The purpose of this subject is to cover the underlying concepts Operating


System. This syllabus provides a comprehensive introduction of Operating System, Process
Management, Memory Management, File Management and I/O management.

PREREQUISITE:

UNIT 1. Introduction to Operating Systems: Function, Evolution, Different Types, Desirable


Characteristics and features of an O/S, Operating Systems Services: Types of Services,
Different ways of providing these Services – Utility Programs, System Calls.

UNIT 2. File Systems: File Concept, User’s and System Programmer’s view of File System,
Disk Organization, Tape Organization, Different Modules of a File System, Disk Space
Allocation Methods – Contiguous, Linked, Indexed. Directory Structures, File Protection,
System Calls for File Management, Disk Scheduling Algorithms.

UNIT 3. CPU Scheduling : Process Concept, Scheduling Concepts, Types of Schedulers,


Process State Diagram, Scheduling Algorithms, Algorithms Evaluation, System calls for
Process Management; Multiple Processor Scheduling; Concept of Threads.

Memory Management: Different Memory Management Techniques – Partitioning, Swapping,


Segmentation, Paging, Paged Segmentation, Comparison of these techniques, Techniques for
supporting the execution of large programs: Overlay, Dynamic Linking and Loading, Virtual
Memory – Concept, Implementation by Demand Paging etc.

UNIT 4. Input / Output : Principles and Programming, Input/Output Problems, Asynchronous


Operations, Speed gap Format conversion, I/O Interfaces, Programme Controlled I/O,
Interrupt Driven I/O, Concurrent I/O.

Concurrent Processes : Real and Virtual Concurrency, Mutual Exclusion, Synchronization,


Inter- Process Communication, Critical Section Problem, Solution to Critical Section
Problem : Semaphores – Binary and Counting Semaphores, WAIT & SIGNAL Operations
and their implementation. Deadlocks: Deadlock Problems, Characterization, Prevention,
Avoidance, Recovery.

UNIT 5. Introduction to Network, Distributed and Multiprocessor Operating Systems. Case


Studies: Unix/Linux, WINDOWS and other Contemporary Operating Systems.

TEXT BOOKS RECOMMENDED:

1. Silberschatz, Galvin, Gagne, “Operating System Concepts’’, Wiley, 9/E

2. William Stalling, “Operating Systems”, Pearson Education


REFERENCE BOOKS:

1. Andrew S. Tanenbaum, “Modern Operating Systems”, 3/e, Prentice Hall

2. Maurice J. Bach, “ The Design of Unix Operating System”, Prentice Hall of India,

3. Bovet & Cesati, “Understanding the Linux Kernel”, O’Reily, 2/E.

List of Experiment

1. Write a program to implement FCFS CPU scheduling algorithm.


2. Write a program to implement SJF CPU scheduling algorithm.
3. Write a program to implement Priority CPU Scheduling algorithm.
4. Write a program to implement Round Robin CPU scheduling algorithm.
5. Write a program to compare various CPU Scheduling Algorithms over different
Scheduling Criteria.
6. Write a program to implement classical inter process communication problem(producer
consumer).
7. Write a program to implement classical inter process communication problem(Reader
Writers).
8. Write a program to implement classical inter process communication
roblem(Dining_Philosophers).
9. Write a program to implement & Compare various page replacement algorithm.
10. Write a program to implement & Compare various Disk & Drum scheduling Algorithms
11. Write a program to implement Banker’s algorithms.
12. Write a program to implement Remote Proccedure Call(RPC).
13. Write a Devices Drivers for any Device or pheriperal.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy