Other university, Computer Engineering , Operating Systems Syllabus

Operating Systems Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free

Unit - 1 Introduction

1.1 Concept of Operating Systems

1.2 Generations of Operating systems

1.3 Types of Operating Systems

1.4 OS Services

1.5 System Calls

1.6 Structure of an OS – Layered

1.7 Monolithic

1.8 Microkernel Operating Systems

1.9 Concept of Virtual Machine

1.10 Case study on UNIX and WINDOWS Operating System

Unit - 2 Processes

2.1 Processes Definition

2.2 Process Relationship

2.3 Different States of a Process

2.4 Process State transitions

2.5 Process Control Block PCB

2.6 Context Switching

2.7 Thread Definition Various States Benefits of Threads Types of Threads Concept of Multithreads

2.8 Process Scheduling Foundation and Scheduling Objectives

2.9 Types of Schedulers

2.10 Scheduling Criteria CPU Utilization Throughput Turnaround Time Waiting Time Response Time

2.11 Scheduling Algorithms Preemptive and Non preemptive FCFS SJF RR

2.12 Multiprocessor Scheduling Real Time Scheduling RM and EDF

Unit - 3 Inter-Process Communication

3.1 Critical Section

3.2 Race Conditions

3.3 Mutual Exclusion

3.4 Hardware Solution

3.5 Strict Alternation

3.6 Peterson’s Solution

3.7 The Producer Consumer Problem

3.8 Semaphores

3.9 Event Counters Monitors Message Passing Shared Memory

3.10 Classical IPC Problems Reader’s Writer Problem Dinning Philosopher Problem etc.

Unit - 4 Deadlocks

4.1 Definition Necessary and Sufficient Conditions for Deadlock

4.2 Deadlock Prevention

4.3 Deadlock Avoidance Banker’s algorithm

4.4 Deadlock Detection and Recovery

Unit - 5 Memory Management

5.1 Memory Management Basic concept

5.2 Logical and Physical Address Map

5.3 Memory Allocation Contiguous Memory allocation – Fixed and Variable Partition–Internal and External Fragmentation and Compaction

5.4 Paging and Segmentation Principle of operation

5.5 Page allocation

5.6 Hardware Support for Paging

5.7 Protection and Sharing

5.8 Advantages and Disadvantages of Paging and Segmentation

5.9 Virtual Memory Basics of Virtual Memory

5.10 Hardware and Control Structures

5.11 Locality of Reference

5.12 Page fault

5.13 Working Set

5.14 Dirty pageDirty Bit

5.15 Demand paging

5.16 Page Replacement Algorithms Optimal First In First Out FIFO Second Chance SC Not Recently Used NRU and Least Recently used LRU

Unit - 6 File Management

6.1 File Management Concept of File Access Methods File Types File Operation Directory Structure File System Structure

6.2 Allocation Methods Contiguous Linked Indexed

6.3 Free Space Management Bit Vector Linked List Grouping

6.4 Directory Implementation Linear List Hash Table

6.5 Efficiency and Performance

6.6 Disk Management Disk Structure

6.7 Disk scheduling FCFS SSTF SCAN CSCAN

6.8 Disk Reliability

6.9 Disk Formatting

6.10 BootBlock Bad Blocks

6.11 IO Hardware IO Devices Device Controllers Direct Memory Access

6.12 Principles of IO Software Goals of Interrupt Handlers Device Drivers Device Independent IO Software

6.13 SecondaryStorage Structure

Download CSE Second Year syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of second-year
Technical writing
Digital electronics
Discrete mathematics
Analog electronic circuits
Data structure & algorithm
Design & analysis of algorithms
Computer organization & architecture
Object oriented programming using c++
Mathematics-iii (differential calculus)
Human resource development and organizational behavior
Popular posts
Top 10 free online resources to learn coding
What is machine learning
What is cloud computing
What is DBMS architecture
Sorting algorithm overview
Share  
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us