Operating System

Text Book : –

Applied Operating Systems Concepts, A,Peterson [ Download ]

                          Applied Operating Systems 7th Edition ………………………[  Download  ]

References : –

• Modern Operating System 2nd Edition , Tanenbaum A.S 2001
• Operating System by William Stalling

Course Description : –

This course will introduce the core concepts of operating systems, such as processes and threads, scheduling, synchronization, memory management, file systems, input and output device management and security. The course will consist of assigned reading, weekly lectures, a midterm and final exam, and a sequence of programming assignments. The goal of the readings and lectures is to introduce the core concepts. Students are expected to read the assigned materials prior to each class, and to participate in in-class discussions.

Pre-requisite : –

CS211 Data Structures & Algorithms

• Introduction .
  • 1.1: Operating System History & Evolution .
  • 1.2: Types of operating system ( Batch, Real Time, Time Sharing, Single use, Multi-user) .
• Process Concepts .
  • 2.1: Definition of Process .
  • 2.2: Process States .
  • 2.3: State Transitions .
  • 2.4: 2-State , 3-State &  5-State Models .
  • 2.5: Process Control Block .
• Scheduling .
  • 3.1: Scheduling Definition .
  • 3.2: Scheduling levels ( High Level, Mid Level, Low Level) .
  • 3.3: Types of Scheduling ( Preemptive, Non Preemptive) .
  • 3.4: Scheduling Policies ( FIFO, Round Robin, SJF, SRT, HRN) .
• Parallel Processing .
  • 4.1: Definition .
  • 4.2: A Control Structure for Indicating Parallelism: Parabegin/Paraend .
  • 4.3: Mutual Exclusion .
  • 4.4: Critical Section .
  • 4.5: Software Solutions to Mutual Exclusion (Dekker’s Algorithm, Peterson’s Algorithm) .
  • 4.6: Hardware Solution to Mutual Exclusion ( Test and Set Instruction) .
  • 4.7: Interprocess Communication .
  • 4.8: Message Passing ( Mailboxes & Ports, Pipes, remote Procedure Calls ) .
• Deadlock .
  • 5.1: Definition .
  • 5.2: Example of Deadlock .
  • 5.3: Resource Concepts .
  • 5.4: Necessary Conditions for Deadlock .
  • 5.5: Deadlock Prevention .
  • 5.6: Deadlock Avoidance .
  • 5.7: Deadlock Detection .
  • 5.8: Deadlock Recovery .
• Real Storage .
  • 6.1: Storage Organization .
  • 6.2: Storage Management .
  • 6.3: Storage Hierarchy .
  • 6.4: Storage Management Strategies ( Fetch Strategies, Placement Strategies, Replacement Strategies) .
  • 6.5: Contiguous VS Noncontiguous Storage Allocation .
  • 6.6: Fixed Partition Multiprogramming ( Absolute Translation & Loading, Relocatable Translation & Loading, Protection, Fragmentation) .
  • 6.7: Variable Partition Multiprogramming ( Coalescing Holes, Storage Compaction, Storage Placement Strategies) .
  • 6.8: Swapping .
• Virtual Storage .
  • 7.1: Basic Concepts .
  • 7.2: Block Mapping .
  • 7.3: Paging .
  • 7.4: Paging Address Translation with Direct Mapping .
  • 7.5: Paging Address Translation with Associative Mapping .
  • 7.6: Paging Address Translation with Combined Associative/ Direct Mapping .
  • 7.7: Segmentation .
  • 7.8: Segmented Address Translation by Direct Mapping .
  • 7.9: Dynamic Address Translation in Paging/ Segmentation Systems .
• Virtual Storage Management .
  • 8.1: Virtual Storage Management Strategies ( Fetch Strategies, Placement Strategies, Replacement Strategies) .
  • 8.2: Page Replacement Strategies ( Principle of Optimality, Random Page Replacement, First-in-first-out, Least-Recently-used, Least-Frequently-Used, Not-Used-Recently .
  • 8.3: Demand Paging .
• File System .
  • 9.1: File System Basics .
  • 9.2: File System Functions .
  • 9.3: Data Hierarchy .
  • 9.4: File Organization ( Sequential, Direct, Indexed Sequential, Partitioned) .
•        Chapter No 1 Notes……………   [ Download ]
•       Chapter No 2 Notes……………   [ Download ]