CS1035 Operating Systems Syllabus

CS 1035 OPERATING SYSTEMS 3 1 0 100

AIM
To introduce the basic concepts of operating systems, process management, storage
management, I/O systems and distributed systems.

OBJECTIVES
i. To study the basic concepts of operating system, computer system structures and operating system structures.
ii. To study about processes, threads, CPU scheduling, process synchronization and deadlocks.
iii. To study about memory management, virtual memory, file system interface and file system implementation.
iv. To study about I/O systems and mass-storage structure.
v. To study about distributed system structures,
distributed file systems and distributed coordination.

1. OPERATING SYSTEMS – AN OVERVIEW 8
What is an OS? – Mainframe systems – Desktop systems –Multiprocessor systems – Distributed systems – Clustered systems – Real time systems – Handheld systems.

Computer system operation – I/O structure – Storage structure – Storage hierarchy – Hardware protection – Network structure.

System components – Operating system services – System calls – System programs – System structure – Virtual machines – System design and implementation – System generation.

2. PROCESS MANAGEMENT 10
Process concept – Process scheduling – Operations on processes – Cooperating processes – Inter process communication – Communication in client-server systems. Threads - Overview - Multithreading models – Threading issues.

Basic concepts – Scheduling criteria – Scheduling algorithms – Multiple-processor scheduling – Real time scheduling – Process scheduling models. The critical section problem – Synchronization hardware – Semaphores – Classic problems of synchronization – Critical regions – Monitors – Atomic transactions.
System model – Deadlock characterization – Methods for handling deadlocks – Deadlock prevention – Deadlock avoidance – Deadlock detection – Recovery from deadlock.

3. STORAGE MANAGEMENT 10
Background – Swapping – Contiguous memory allocation – Paging – Segmentation – Segmentation with Paging. Background – Demand paging – Process creation – Page replacement – Allocation of frames – Thrashing.

File concept: Access methods – Directory structure – File system mounting – File sharing – Protection. File system structure – File system implementation – Directory implementation – Allocation methods – Free-space management – Efficiency and performance – Recovery.

4. I/O SYSTEMS 8
I/O hardware – Application I/O interface – Kernel I/O subsystem – Transforming I/O to hardware operations – Streams – Performance.

Disk structure – Disk scheduling – Disk management – Swap-space management – RAID structure – Disk attachment – Stable – Storage implementation – Tertiary storage structure.

5. DISTRIBUTED SYSTEMS 9
Background – Topology – Network types – Communication – Communication protocols – Robustness – Design issues. Naming and transparency – Remote file access – Stateful versus stateless service – File replication.

Event ordering – Mutual exclusion – Atomicity – Concurrency control – Deadlock handling – Election algorithms – Reaching agreement.

L = 45 T=15 Total = 60

TEXT BOOK
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, ‘Operating System Concepts’, Sixth Edition, Windows XP update, John Wiley & Sons (ASIA) Pvt. Ltd, 2002.


REFERENCE BOOKS
1. Harvey M. Deitel, ‘Operating Systems’, Second Edition, Pearson Education Pvt. Ltd., 2002.

2. Andrew S. Tanenbaum, ‘Modern Operating Systems’, 2nd Edition, Pearson Education, 2000 / PHI.

3. William Stallings, ‘Operating System’, Pearson Education, 4th Edition, 2003 / PHI.
Previous
Next Post »

If you still didn't find what you're looking for, you can search this website below: