Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
183 views

Operating System Accenture

The document outlines the modules that will be covered in a course on operating systems. The course will provide an overview of OS history and components, including processes, CPU scheduling, process synchronization, deadlocks, memory management, storage, file systems, and secondary storage structures. Students will learn the algorithms and techniques used to implement major OS components through a combination of theory and hands-on programming assignments using Linux and C.

Uploaded by

Mangesh Abnave
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
183 views

Operating System Accenture

The document outlines the modules that will be covered in a course on operating systems. The course will provide an overview of OS history and components, including processes, CPU scheduling, process synchronization, deadlocks, memory management, storage, file systems, and secondary storage structures. Students will learn the algorithms and techniques used to implement major OS components through a combination of theory and hands-on programming assignments using Linux and C.

Uploaded by

Mangesh Abnave
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

OPERATING SYSTEM (Windows, Linux, UNIX)

Course Information:-

The purpose of this course is to provide an overview of computer operating systems. Topics to be discussed
include a brief history of OS’s and their design and development. The course will cover major components the and
the algorithms and implementation techniques used to create them. The class will presented using a both a mix
of theory and hands-on exercises. Some/most of the programming assignments will be done on Linux machines
using C.

Module 1: Overview of Operating Systems


What is an OS?
Brief history

Module 2: Processes
Definition
Process States
5 state model
Process structure
PCB and components
Operations on Processes
Threads

Module 3: CPU Scheduling


I/O burst cycle
Context Switching
Scheduling
Short Term
Long Term
Scheduling Criteria
Algorithms
First Come First Serve
Shortest Job First
Priority Scheduling
Round Robin

Module 4: Process Synchronization


Critical Section Problem
Mutual Exclusion
Races
Two Process Solutions
Algorithm 1
Algorithm 2
Algorithm 3
Bakery Algorithm
Synchronization Hardware
Test and Set
Swap
Semaphores
Deadlocks and Starvation
Classic Synchronization Problems
Readers/Writers
Dining Philosophers

Module 5: Deadlocks
System Model
Necessary Conditions for a deadlock
Mutual Exclusion
Hold and Wait
No Preemption
Circular wait
Resource Allocation Graphs
Handling Deadlocks
Prevention
Avoidance
Bankers Algorithm

Module 6: Memory Management


Address Binding
Compile time
Load time
Execution time
Logical versus Physical Address Space
Swapping
Contiguous Allocation
Single Partition
Multiple Partition
First Fit
Best Fit
Worst Fit
Internal and External Fragmentation
Paging and Virtual Memory
Basics
Demand Paging
Page Replacement
Page Replacement Algorithms
FIFO
Belady’s anomaly
Optimal
LRU
MFU
Thrashing

Module 7: Storage
Files
Attributes
Operations
File types
Structure
Access methods
Directory Structure
Protection
Module 8 File System Implementation
Allocation methods
Free Space Management

Module 9: Secondary Storage Structure


Disks
Structure
Scheduling
FCFS
SSTF
SCAN

You might also like