Operating Systems Syllabus - BIM (TU)
View and download full syllabus of Operating Systems
Course Description
Course Objectives
This module aims to provide the concepts of Operating Systems and Implementation of Systems Utilities for Inter-process communication in a multiprocessor environment.
Course Description
Overview, Process Management, Scheduling, Basic Synchronization principles, Memory Management, File Management, Protection and Security, Device Management
Unit Contents
Detailed Course
Unit 1: Overview LH 5
1.1 |
Introduction |
|
1.2 |
System Structures |
|
1.3 |
The abstract Model of computing |
|
1.4 |
Resources: files |
|
1.5 |
Processes: Creating Processes (using C functions: FORK, JOIN, and QUIT, ) |
|
1.6 |
Threads: C threads |
|
Unit 2: |
Process Management |
LH 8 |
2.1 |
The system view of processes and resources |
|
2.2 |
Initializing the Operating System |
|
2.3 |
Process address spaces |
|
- Creating the address space
- Loading the program
- Maintaining consistency in the address space
- The process abstraction
- Process descriptors
- Process state diagram
- The resource abstraction
- Process hierarchy
- Refining the process manager
- Specializing resource allocation strategies
Unit 3: Scheduling LH 9
- Scheduling Mechanisms
- The process scheduler organization
- Saving the process context
- Voluntary CPU Sharing
- Involuntary CPU Sharing
- Performance
- Strategy Selection
3.1.1 Partitioning s process into small processes
- Nonpreemptive Strategies
- First come first served
- Shortest Job next
- Priority Scheduling
- Deadline scheduling
- Preemptive strategies
- Round robin
- Multiple-level queues
- Monitors
Unit 4: Basic Synchronization principles LH 5
- Interacting processes
- Critical Sections
4.1.2. Deadlock
- Coordinating processes Semaphores
- Principles of operation Practical considerations
Unit 5: Memory Management LH 8
- The Basics
- Requirements on the primary memory
- Mapping the address space to primary memory
- Dynamic memory for data structures
- Memory Allocation
- Fixed-partition memory strategies
- Variable-partition memory strategies
- Contemporary Allocation Strategies
- Dynamic Address Resolution
- Runtime bound Checking
- Memory Manager Strategies
- Swapping
- Virtual Memory
- Shared-memory Multiprocessors
Unit 6:File Management LH 5
- File System
- File Concept
- Access Methods
- Directory Structure
- File System Mounting
- File Sharing
- Protection
- Implementing File Systems
- File System Structure
- File System Implementation
- Directory Implementation
- Allocation Methods
- Free Space Management
- Secondary Storage Structure
- Disk Structure
- Disk Scheduling
- Disk Management
- Swap Space Management
- I/O Systems
- I/O Hardware
- Application I/O Interface
Unit 7: Protection and Security LH 3
- Fundamentals
- Policy and Mechanism
- Implementing Policy and mechanism
- Authentication Mechanisms
- Authorization Mechanisms
- Encryption
Unit 8: Device Management LH 5
- Device Management approaches
- I/O System Organization
- Direct I/O with Polling
- Interrupt-Driven I/O
- Memory-Mapped I/O
- Direct memory access
- Device Drivers
- The device driver interface
- CPU-device interactions
- I/O optimization
- Some Device Management Scenarios
- Serial Communications
- Sequentially accessed storage devices
- Randomly accessed device
-
Laboratory:
- Students should implement operating system functionality in their
Text Book:
- Gary Nutt, Operating Systems A modern Perspective, Second edition, Pearson Education
- Silberschatz, , Galvin, P. & Gagne, G., Operating System Principles, Seventh Edition, John Wiley & Sons
Text and Reference Books
References:
- Andrew Tanenbaum, Modern Operating System, PHI
- Andrew Tanenbaum, Operating Systems Design and Implementation, Prentice Hall
- James L Peterson & Abraham Silberschatz, Operating System concepts, Addison Wesley
- Thomas Doeppner, Operating Systems in Depth, John Wiley & Sons
- Short Name N/A
- Course code IT 307
- Semester Eighth Semester
- Full Marks 100
- Pass Marks 45
- Credit 3 hrs
- Elective/Compulsary Elective