Operating Systems

 Course Objectives :

1. To understand the basics of OS and their functions. To learn the scheduling policies of various operating systems.
2. Learn memory management methods.
3. To understand the characterization of deadlock, system deadlock, preventing & avoiding deadlock & related concepts.
4. To understand the meaning of a file, structure of the directories, file structure system and implementation, free-space management

Course Outcomes (CO)

• CO 1 Understand the role of operating system in a computing device, and Ability to understand paging and segmentation methods of memory binding and their pros & cons.
• CO 2 Understand scheduling of process over a processor. Ability to use concepts of semaphore and its usage in process synchronization.
• CO 3 Ability to synchronize programs and make the system deadlock free.
• CO 4 Ability to understand file system like file access methods, directory structures, file space allocation in disk and free space management in disk. Ability to understand disk scheduling and disk recovery procedures.

UNIT-I

Introduction: What is an Operating System, Simple Batch Systems, Multi-programmed Batches systems, Time Sharing Systems, Personal-computer systems, Parallel systems, Distributed Systems, Real-Time Systems, OS – A Resource Manager.

Processes: Introduction, Process states, process management, Interrupts, Interprocess Communication

Threads: Introduction, Thread states, Thread Operation, Threading Models. Processor Scheduling: Scheduling levels, preemptive vs no preemptive scheduling, priorities, scheduling objective, scheduling criteria, scheduling algorithms, demand scheduling, real time scheduling.

UNIT-II

Process Synchronization: Mutual exclusion, software solution to Mutual exclusion problem, hardware solution to Mutual exclusion problem, semaphores, Critical section problems. Case study on Dining philosopher problem, Barber shop problem etc.

Memory Organization & Management: Memory Organization, Memory Hierarchy, Memory Management Strategies, Contiguous versus non- Contiguous memory allocation, Partition Management Techniques, Logical versus Physical Address space, swapping, Paging, Segmentation, Segmentation with Paging Virtual Memory: Demand Paging, Page Replacement, Page-replacement Algorithms, Performance of Demand Paging, Thrashing, Demand Segmentation, and Overlay Concepts.

UNIT-III

Deadlocks: examples of deadlock, resource concepts, necessary conditions for deadlock, deadlock solution, deadlock prevention, deadlock avoidance with Bankers algorithms, deadlock detection, deadlock recovery.

Device Management: Disk Scheduling Strategies, Rotational Optimization, System Consideration, Caching and Buffering.

UNIT - IV

File System: Introduction, File Organization, Logical File System, Physical File System, File Allocation strategy, Free Space Management, File Access Control, Data Access Techniques, Data Integrity Protection, Case study on file system viz FAT32, NTFS, Ext2/Ext3 etc.

Textbook(s):

1. Deitel & Dietel, “Operating System”, Pearson, 3 rd Ed., 2011
2. Silbersachatz and Galvin, “Operating System Concepts”, Pearson, 5th Ed., 2001
3. Madnick & Donovan, “Operating System”, TMH,1st Ed., 2001

References:

1. Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000
2. Godbole, “Operating Systems”, Tata McGraw Hill, 3rd edition, 2014
3. Chauhan, “Principles of Operating Systems”, Oxford Uni. Press, 2014
4. Dhamdhere, “Operating Systems”, Tata McGraw Hill, 3rd edition, 2012 
5. Loomis, “Data Management & File Structure”, PHI, 2nd Ed.