Operating System

Course Title: Operating System

Course No: CACS251

Nature of the Course: Theory + Lab

Semester: 4

Full Marks: 20 + 20 + 60

Pass Marks: 8 + 8 + 24

Credit Hours: 3

Course Description

This course includes the topics that help students understand operating system and it's functionality along with its types.

Course Objectives

The general objectives of this subject are to provide the basic feature, function and interface with the hardware and application software to run the computer smoothly.

Course Contents

1. Introduction to Operating System

2 hrs

1.1. History, Introduction and Generation of Operating System

1.2. Objectives (Resource Manager and Extended Machine)

1.3. Types of Operating system

1.4. Function of Operating system

2. Operating System Structure

2 hrs

2.1. Introduction, Layered System, Kernel

2.2. Types of Kernel (Monolithic/Macro Kernel and Micro / Exo-Kernel)

2.3. Client-Server Model, Virtual Machines, Shell

3. Process Management

15 hrs

3.1. Process Concepts

Definitions of Process, The Process Model

Process States, Process State Transition

The Process Control Block

Operations on Processes (Creation, Termination, Hierarchies, Implementation)

Cooperating Processes

System Calls (Process Management, File management, Directory Management)

3.2. Threads

Definitions of Threads

Types of Thread Process (Single and Multithreaded Process)

Benefits of Multithread

Multithreading Models (Many-to-One Model, One-to-One Model, Many-to-Many Model)

3.3. Inter-Process Communication and Synchronization

Introduction, Race Condition, Critical Regions

Avoiding Critical Region: Mutual Exclusion And Serializability

Mutual Exclusion Conditions, Proposals for Achieving Mutual Exclusion

Disabling Interrupts, Lock Variable, Strict Alteration

The TSL Instruction, Sleep and Wakeup

Types of Mutual Exclusion (Semaphore, Monitors, Mutexes, Message Passing, Bounded Buffer)

Serializability: Locking Protocols and Time Stamp Protocols

Classical IPC Problems (Dining Philosophers Problems, The Readers and Writers Problem, The Sleeping Barber's Problem)

3.4. Process Scheduling

Basic Concept, Type of Scheduling (Preemptive Scheduling, Nonpreemptive Scheduling)

Batch, Interactive, Real Time Scheduling

Scheduling Criteria or Performance Analysis

Scheduling Algorithm (Round-Robin, First Come First Served, Shortest-Job-First, Shortest Process Next, Shortest Remaining Time Next, Real Time, Priority Fair Share, Guaranteed, Lottery Scheduling, HRN, Multiple Queue, Multilevel Feedback Queue)

Some Numerical Examples on Scheduling

4. Deadlocks

4 hrs

4.1. System Model, System Resources: Preemptable and Non-Preemptable

4.2. Conditions for Resource Deadlocks, Deadlock Modeling

4.3. The OSTRICH Algorithm, Method of Handling Deadlocks

4.4. Deadlock Prevention, Deadlock Avoidance: Banker's Algorithm

4.5. Deadlock Detection: Resource Allocation Graph, Recovery from Deadlock

5. Memory Management

7 hrs

5.1. Basic Memory Management

Introduction, Memory Hierarchy

Logical Versus Physical Address Space

Memory Management with Swapping

Memory Management with Bitmaps and with Linked List

Memory Management without Swapping

5.2. Contiguous-Memory Allocation

Memory Protection, Memory Allocation

Fragmentation (Internal and External Fragmentation)

Non-Contiguous Memory Allocation, Fixed Partitioning Vs. Variable Partitioning

Relocation and Protection, Coalescing and Compaction

5.3. Virtual Memory

Background, Paging, Structure of Page Table

Hierarchical Page Table, Hashed Page Table, Inverted Page Table, Shared Page Table

Block Mapping Vs. Direct Mapping, Demand Paging

Page Replacement and Page Faults

Page Replacement Algorithms: FIFO, OPR, LRU, SCP

Some Numerical Examples on Page Replacement

Thrashing, Segmentation, Segmentation With Paging

6. Input/Output Device Management

4 hrs

6.1. Principle of I/O Hardware: I/O Devices, Device Controllers, Memory Mapped I/O, Direct Memory Access

6.2. Principle of I/O Software: Goals of I/O Software, Program I/O, Interrupt -Driven I/O, I/O Using DMA

6.3. I/O Software Layers: Interrupts Handler, Device Drivers, Device Independent I/O Software

6.4. User - Space I/O Software, Disk: Disk Hardware, Disk Scheduling: Seek Time, Rotational Delay, Transfer Time

6.5. Disk Scheduling Algorithms: FCFS Scheduling, SSTF Scheduling, SCAN Scheduling, C-SCAN Scheduling, Lock Scheduling

7. File System Interface Management

2 hrs

7.1. File Concept: File Naming, File Structure, File Type, File Access, File Attributes

7.2. File Operation and File Descriptors

7.3. Directories: Single-Level Directory Systems, Hierarchical Directory Systems

7.4. Path Names, Directory Operation, Access Methods: Sequential, Direct

7.5. Protection: Types of Access, Access Control List, Access Control Matrix

8. Security Management

3 hrs

8.1. Introduction, Security Problems

8.2. User Authentication: Passwords, password Vulnerabilities, Encrypted password, One Time Password and Biometrics password

8.3. User Authorization, Program Threats: Trojan Horse, Trap Door, Stack and Buffer Overflow

8.4. System Threats: Worms, Viruses, Denial of Services

9. Distributed Operating System

4 hrs

9.1. Introduction, Advantages of Distributed System over Centralized System

9.2. Advantages of Distributed System over Independent PCs

9.3. Disadvantages of Distributed System, Hardware and Software Concepts

9.4. Communication in Distributed Systems, Message Passing, Remote Procedure Call

9.5. Process in Distribution System, Clock Synchronization

10. Case Study

2 hrs

10.1. DOS and Windows Operating System

10.2. Unix Operating System

10.3. Linux Operating System

Laboratory Works

Lab works should be done covering all the topics listed above and a small project work should be carried out using the concept learnt in this course. Project should be assigned on Individual Basis.

1.Laboratory Works

Text Books

1.Andrew S. Tanenbaum, “Modern Operating System 4/e”, PHI, 2011/12
2.Silberschatz, P.B. Galvin, G. Gagne, “Operating System Concepts 8/e”, Wiley India, 2014 ISBN: 9788126520510

Reference Books

1.Andrew S. Tanenbaum, “Distributed Operating System”, Pearson
2.D M Dhamdhere, “System Programming and Operating System”, Tata McGraw-Hill, 2009
3.P. Pal Choudhury, “Operating Systems Principles and Design”, PHI, 2011

Notes:

This syllabus follows the official BCA curriculum of Tribhuvan University. In case of any doubt or revision, the university's published syllabus shall be considered authoritative.

Operating System

Operating System

Select University

Select Program

TabFlux . Operating System . TU . BCA-OLD