CONTENTS

UNIT – I

• Introduction
• Views
• Components of Computer
• Types of System
• OS Structure
• Operations
• Services
• Interface
• System Calls
• System Structure
• System Design and Implementation.
• Process Management
• Process
• Process Scheduling
• Inter-process Communication.
• CPU Scheduling:
• CPU Schedulers
• Scheduling Criteria
• Scheduling Algorithms.
• First-Come, First-Served Scheduling 
• Shortest Job First
• Round Robin
• Priority Scheduling
• Multilevel Queue Scheduling and Multilevel Feedback Queue

UNIT II

• Process Synchronization
• Critical- Section Problem
• Synchronization Hardware
• Semaphores
• Classical Problems of Synchronization
• The Bounded-Buffer Problem
• The readers-writers problem
• The Dining-Philosophers Problem
• Monitors
• Deadlocks
• Necessary Conditions for Deadlock
• Resource-Allocation-Graph Algorithm
• Methods for Handling Deadlocks
• Deadlock Prevention
• Deadlock Avoidance
• Resource-Allocation-Graph Algorithm
• Banker’s Algorithm
• Deadlock Detection
• Deadlock Recovery

UNIT III

• Memory Management
• Hardware
• Address Binding
• Address Space
• Dynamic Loading and Linking
• Swapping
• Contiguous Allocation
• Segmentation
• Paging
• Structure of the Page Table.

UNIT IV

Virtual Memory Management: Demand Paging – Page Replacement Algorithms – Thrashing. File System:
File Concept -. Access Methods – Directory and Disk Structure – Protection – File System Structures –
Allocation Methods – Free Space Management.

UNIT V

• I/O Systems
• I/O Hardware
• Polling
• Interrupts
• Direct Memory Access
• Application I/O Interface
• Kernel I/O Subsystem
• Transforming I/O Requests to Hardware Operations
• Performance
• System Protection
• Goals and Principles of Protection
• Domain of Protection
• Access matrix
• System Security
• The Security Problem
• Threats
• System and Network Threats
• Encryption
• User Authentication.

QUESTION BANK

UNIT I

UNIT II

UNIT III

UNIT IV

UNIT V