Operating System

BATHULA PRAVEEN (BP)
0

Operating System 

SYLLABUS 

Unit 1

Computer System and Operating System Overview

Overview of Operating System - What operating systems do, User view, System view, defining operating systems; Operating Systems functions- Process Management, Memory Management, Storage Management, FileSystem Management, Mass-Storage Management, Caching, Protection and security; Distributed systems, Special purpose systems, Real-Time Embedded Systems, Multimedia Systems, Handheld Systems, Operating Systems Structures, Simple Structure, Layered Approach, Micro Kernels, Modules; Systems Calls- Process control, File management, Device management, Information maintenance, Communication; Operating systems generation. 

UNIT - II 

Process Management

Process, Process States, Process Control Block, Process Scheduling- Scheduling Queues, Schedulers; Operations- Process Creation, Process termination; Inter process communication- Shared-Memory Systems, Message-Passing Systems, Naming, Synchronization, Buffering; Multi Thread programming models- Many to one, One to one, Many to Many model; Process Scheduling Criteria- CPU scheduler, Preemptive scheduling, Dispatcher, Scheduling Criteria; CPU Scheduling Algorithms- First Come First Serve, Shortest job first, Priority Scheduling, Round robin scheduling. 

UNIT - III 

Concurrency

 Process Synchronization, The Critical-Section Problem, Peterson’s Solution, Synchronization Hardware.SemaphoresUsage,Implementation, Deadlock and Starvation; Classic Problems of Synchronization- Bounded buffer problem,Readers writers’ problem, DiningPhilosophers problem; Monitors- Usage, Dining-Philosophers solution using monitors. 

 Memory Management: 

Swapping, Contiguous Memory Allocation- Memory Allocation, Fragmentation; Paging- Basic Method, Hardware Method, Protection, shared pages; Structure of the Page table- Hierarchical Paging, Hashed Page Tables. Segmentation- Basic Method, hardware. 

UNIT - IV 

Virtual Memory Management

 Virtual Memory. Demand Paging- Basic concept, copy on write; Page-Replacement Algorithms- Basic page replacement, FIFO page replacement, optimal page replacement, LRU page replacement, LFU page replacement; Thrashing- Cause of Thrashing, Working set model, Page fault frequency 

Principles of Deadlock: 

Deadlock System Model. Deadlock Characterization- Necessary Conditions, Resource allocation graph; Deadlock Prevention- Mutual exclusion, Hold and wait, No preemption, Circular wait; Deadlock Detection and Avoidance- Resource allocation Graph algorithm, Banker’s algorithm, Single instance of each resource type, several instances of each resource type; Recovery Form Deadlock- Process termination, Resource preemption

 UNIT - V 

File System

The Concept of a File- file attributes, file operations, file types, file structures; Access Methods- sequential access, direct access, other access methods; Directory Structure- single level directory, two level directories, tree structured directory, general graph directory; File Sharing- multiple users, remote file systems; Protection- types of access, access control

 Implementing File System: 

File System Structure. File System Implementation- overview, partitions and mounting, virtual file systems; Allocation Methods- contiguous allocation, linked allocation, indexed allocation; Free-Space Management- linked list, grouping, counting. Disk Scheduling- FCFS scheduling, SSTF scheduling, SCAN scheduling, C-SCAN scheduling, LOOK scheduling.  


 UNIT 1

UNIT 2

UNIT 3

UNIT-4

UNIT 5 A

UNIT 5 B


Post a Comment

0Comments

Post a Comment (0)