Detailed Contents

Module 1: Introduction

• Concept of Operating Systems
• Generations of Operating systems
• Types of Operating Systems
• OS Services, System Calls
• Structure of an OS - Layered, Monolithic, Microkernel Operating Systems
• Concept of Virtual Machine
• Case study on UNIX and WINDOWS Operating System

Module 2: Processes

• Definition, Process Relationship, Different states of a Process, Process State transitions, Process Control Block (PCB), Context switching
• Thread: Definition, Various states, Benefits of threads, Types of threads, Concept of multithreads
• Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers, Scheduling criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time; Scheduling algorithms: Pre-emptive and Non-pre-emptive, FCFS, SJF, RR; Multiprocessor scheduling: Real Time scheduling: RM and EDF.

Module 3: Inter-process Communication

• Critical Section, Race Conditions, Mutual Exclusion, Hardware Solution, Strict Alternation, Peterson’s Solution
• The Producer/Consumer Problem, Semaphores, Event Counters, Monitors, Message Passing
• Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem etc.

Module 4: Deadlocks

• Definition, Necessary and sufficient conditions for Deadlock
• Deadlock Prevention, Deadlock Avoidance: Banker’s algorithm
• Deadlock detection and Recovery

Module 5: Memory Management

• Basic concept, Logical and Physical address map
• Memory allocation: Contiguous Memory allocation – Fixed and variable partition – Internal and External fragmentation and Compaction
• Paging: Principle of operation – Page allocation – Hardware support for paging, Protection and sharing, Disadvantages of paging
• Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of reference, Page fault, Working Set, Dirty page/Dirty bit – Demand paging, Page Replacement algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) and Least Recently used (LRU)

Module 6: I/O Hardware & File Management

I/O Hardware

• I/O devices, Device controllers, Direct memory access
• Principles of I/O Software: Goals of Interrupt handlers, Device drivers, Device independent I/O software
• Secondary-Storage Structure: Disk structure, Disk scheduling algorithms

File Management

• Concept of File, Access methods, File types, File operation, Directory structure, File System structure
• Allocation methods (contiguous, linked, indexed), Free Space Management (bit vector, linked list, grouping), directory implementation (linear list, hash table), efficiency and performance
• Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk reliability, Disk formatting, Boot-block, Bad blocks

Course Outcomes

The student will be able to:

1. Explain basic operating system concepts such as overall architecture, system calls, user mode and kernel mode
2. Distinguish concepts related to processes, threads, process scheduling, race conditions and critical sections
3. Analyze and apply CPU scheduling algorithms, deadlock detection and prevention algorithms
4. Examine and categorize various memory management techniques like caching, paging, segmentation, virtual memory, and thrashing
5. Design and implement file management system
6. Appraise high-level operating systems concepts such as file systems, disk-scheduling algorithms and various file systems

Suggested Books

• Operating System Concepts Essentials by Avi Silberschatz, Peter Galvin, Greg Gagne
• Operating Systems: Internals and Design Principles by William Stallings

Reference Books

• Operating System: A Design-oriented Approach by Charles Crowley
• Operating Systems: A Modern Perspective by Gary J. Nutt
• Design of the Unix Operating Systems by Maurice Bach
• Understanding the Linux Kernel by Daniel P. Bovet, Marco Cesati

List of Experiments

1. Installation Process of various operating systems.
2. Implementation of CPU scheduling algorithms to find turnaround time and waiting time. a) FCFS b) SJF c) Round Robin (pre-emptive) d) Priority.
3. Virtualization, Installation of Virtual Machine Software and installation of Operating System on Virtual Machine.
4. Commands for files & directories: cd, ls, cp, md, rm, mkdir, rmdir. Creating and viewing files using cat. File comparisons. Disk related commands: checking disk free spaces. Processes in linux, connecting processes with pipes, background processing, managing multiple processes. Background process: changing process priority, scheduling of processes at command, batch commands, kill, ps, who, sleep. Printing commands, grep, fgrep, find, sort, cal, banner, touch, file. File related commands ws, sat, cut, grep.
5. Shell Programming: Basic of shell programming, various types of shell, Shell Programming in bash, conditional & looping statement, case statements, parameter passing and arguments, shell variables, shell keywords, creating shell programs for automate system tasks, report printing.
6. Implementation of Bankers algorithm for the purpose of deadlock avoidance.

Course Outcomes

The student will be able to:

1. Understand and implement basic services and functionalities of the operating system
2. Analyze and simulate CPU Scheduling Algorithms like FCFS, Round Robin, SJF, and Priority
3. Implement commands for files and directories
4. Understand and implement the concepts of shell programming
5. Simulate file allocation and organization techniques
6. Understand the concepts of deadlock in operating systems and implement them in multiprogramming system

Reference Books

• Operating Systems: Design and Implementation by Albert S. Woodhull and Andrew S. Tanenbaum