Pokhara University

Faculty of Science and

Technology

Course Code: CMP 226 (3 Credits) Full Marks: 100

Course title: Applied Operating Systems (3-1-2) Pass Marks: 45
Nature of the course: Theory and Practical Total Lectures: 45
hrs Level: Bachelor Program: BE (Software/IT)

1. Course Description
This course is designed to visualize and apply the concepts of operating systems to various system
environments. It includes the system software, internal structure, choice and security features of the
operating system for running the application software and performing various tasks with optimized
throughput. This course also introduces the emerging new trending operating system for distributed
environments like cloud systems. This course aims to provide the students with the basic concepts of
design and development of an operating system applying necessary security and safety measures.

2. General Objective
• To acquaint the students with the knowledge of the structure of operating systems and their
functionality.
• To develop the skills in students to select and design optimal resource allocation schedules.
• To acquaint the students with the knowledge of process and thread, I/Os, Memory, CPU,
disk management.
• To acquaint the students with basic concepts of security and safety measures in operating systems.

3. Methods of Instruction
• Lectures, Tutorials, Case Studies, Discussion, Readings and Practical Works.

4. Contents in Detail
Specific Objectives Contents
● Familiarize with basic concepts of Unit 1. : Introduction [ 5 hours ]
Operating system, and its 1.1 Applied Operating System
architecture. 1.2 Goals of an Operating System
● Understanding the successive 1.3 Computer System Organization and Architecture
evolution and structure of operating 1.4 Operating-System Structure
system 1.5 Generations of Operating Systems (0th, First, Second, Third,
Fourth)
1.6 Types of Operating Systems
1.6.1 Batch Processing Operating System
1.6.2 Multiprogramming Operating System
1
 1.6.3 Multiprocessing System
1.6.4 Time Sharing
1.6.5 Real Time Operating System (RTOS)
1.6.6 Networking Operating System
1.6.7 Distributed Operating System
1.6.8 Operating Systems for Embedded Devices
1.7 Functions of OS
1.8 Kernel Data Structures
1.9 User and Operating-System Interface
1.10 System Call, Types of System Calls and Handling System
Call,
1.11 Virtual Machine
● Familiarize with the concept of UNIT- II: Process, Threads and Scheduling [13 hours]
Process and threads 2.1 Process
● Understanding the mutual exclusion 2.1.1 Process Concept
for resource utilization 2.1.2 Process State
2.1.3 Operations on Processes
● Mastering Process Scheduling
2.1.4 Process Control Block
Algorithms.
2.1.5 Implementation of Processes
● Dealing with Deadlocks and Resource
2.2 Threads
Management: 2.2.1 Thread Concept and Usage
2.2.2 Threads Models (Many-to-one model, One-to-One Model,
Many-to many model)
2.2.3 User Space and Kernel Space Threads
2.2.4 Hybrid Implementations
2.2.5 Threads Vs Processes
2.3 Inter-process Communication and Synchronization
2.3.1 Cooperating Processes
2.3.1 Race Conditions
2.3.2 Critical-Section Problem
2.3.3 Mutual Exclusion with Busy Waiting (Disabling
Interrupt, Lock variable, Strict alternation, Peterson’s
Algorithm, Test and Set Lock)
2.3.4 Sleep and Wakeup
2.3.5 Semaphores
2.3.6 Mutexes
2.3.7 Monitors
2.3.8 Message Passing
2.3.9 Classical IPC Problems
2.4 Process Scheduling
2.4.1 Basic Concept and Types(Preemptive, Non-
Preemptive).
2.4.2 Scheduling Criteria
2.4.3 Scheduling Algorithm (First come first served
Scheduling(FCFS), Round-Robin,, Shortest Job
First(SJF), Shortest process next, Shortest
Remaining Time First(SRTF), Priority
Scheduling, Priority Fair Share, Real Time
Scheduling, Guaranteed, Lottery Scheduling)
2
 2.5 Thread Scheduling
2.6 Deadlocks
2.5.1 System Resources: Preemptable and Non-preempable
2.5.2 Methods of Handling Deadlock( DeadlockPrevention,
Deadlock Avoidance: Banker’s Algorithm,
DeadlockDetection: Resource allocation graph, Recovery from
Deadlock)
2.5.3 Security and Protection- Security Threats, System Protection,
Goals of Protection, Principles of Protection, Domain of
Protection, Access Matrix, Implementation of Access Matrix,
access Control list
● Conceptualize the role and UNIT- III: Storage Management [12 hours]
working procedure of 3.1 Memory Management
memory 3.1.1 Logical & physical Address Space
● Familiarizing with virtual 3.1.2 Swapping
memory management 3.1.3 Contiguous Memory Allocation
3.1.4 Paging, Structure of Page Table
● Understanding the page 3.1.5 Segmentation, Segmentation with Paging
replacement algorithms 3.2 Virtual Memory
● Understand the mechanism 3.2.1 Background
file and filing 3.2.2 Demand Paging,
3.2.3 Performance of Demanding Paging,
3.2.4 Page Replacement, Page Replacement Algorithms,
Allocation of Frames,
3.2.5 Thrashing.
3.3. File System Interface and Implementation
3.3.1 File System Interface (The Concept of a File, Access
methods, Directory Structure, File System Mounting, File
Sharing, Protection)
3.3.2 File System Implementation (File System Structure, File
System Implementation, and Allocation methods, Free-
space Management, Directory Implementation, Efficiency
and Performance)
● Understand the role of Unit IV : Input/output Management [ 7 hours ]
input/output devices 4.1 I/O System
● Understand the different 4.1.1 Principles of I/O Hardware (I/O Device, Device Controller,
approaches for optimal Memory Mapped I/O, Direct Memory Access)
output 4.1.2 Principles of I/O Software (Goals of I/O Software, Polled I/O
vs Interrupt Driven I/O, Character User Interface and Graphical
User Interface, Device Driver, Device Independent I/O
Software, User-space I/O Software
4.2 Mass Storage Structure - Overview of Mass Storage Structure,
Disk Structure, Disk Attachment, Disk Scheduling, Disk
Management, Swap space Management Redundant Array of
Inexpensive Disks
● Visualize of operating Unit V: Case Study [5 hours]
system structure and 5.1 Linux - Design principles, Inter-process communication, Kernel
functionality modules, Network structure, Security
5.2 Windows - Design principles, Programmer interface, System

3
 components, Security level

● Familiarize with Unit VI : Emerging Trends in Operating System [3 hours]

current trends of 6.1 Concept, Character and Role of Distributed
operating systems Operating System and Cloud Operating System
6.2 Security issues and method of deployment
6.3 Memory wall and bottleneck for operating system

5. Practical Works
Laboratory work of 30 hours per group of maximum 24 students should cover the operating system
structure and functions of any two popular operating systems. It also insists the students to design a model
of operating system with the reference of open source guidelines. Students should complete the following
tasks in laboratory:

1. Understanding and running the internal commands and external commands in MS DOS.
2. Installation and user, application management in Windows (current version)
3. Simulation of Process Scheduling Algorithms
4. Simulation of Page Replacement Algorithms
4. Simulation of Disk Arm Scheduling Algorithms
5. System Administration (user, disk, role, etc.) in any open source operating system.

6. List of Tutorials
The various tutorial activities that suit this course should cover all the content of this course to give students
a space to engage more actively with the course content in the presence of the instructor. Students should
submit tutorials as assignments or class-works to the instructor for evaluation. The following tutorial
activities of 15 hours per group of maximum 24 students should be conducted to cover the content of this
course:
A. Discussion-based Tutorials: (2 hrs)
1. Operating System Services (Class discussion)
2. Deadlock and Starvation
3. New Trends in Operating Systems (Oral Presentation).

B. Problem solving-based Tutorials: (10 hrs)

1. Evaluating the performance of different Process Scheduling Algorithm, Disk Scheduling Algorithm
and Page Replacement Algorithm through hypothetical scenarios.
2. WAP that creates multiple processes and manages their execution using different scheduling
algorithms such as Round Robin, Priority Scheduling, and Shortest Job First.
3. Implementing page replacement algorithms such as FIFO, LRU, and Clock, and evaluating their
performance in a simulated virtual memory environment.
4. WAP that simulates FCFS, SCAN and CSCAN disk scheduling algorithms.
5. Develop basic shell scripts with defined functions, perform simple tests, use loops for iteration,
create patterns, utilize expansions, and handle substitutions within shell programming.
4
 6. Develop a program in UNIX utilizing system calls such as fork, exec, getpid, exit, wait, close, stat,
opendir, and readdir to perform various operations within the operating system.
C. Review and Question/Answer-based Tutorials: (3 hrs)
1. Case study of “Linux and Windows Operating System” followed by Oral Presentation in class.
2. Students ask questions within the course content and assignments and review key course content in
preparation for tests or exams.

7. Evaluation System and Students’ Responsibilities

Internal Evaluation
The internal evaluation of a student may consist of assignments, attendance, internal assessment, lab
reports, project works etc. The internal evaluation scheme for this course is as follows:

Internal Evaluation Weight Marks External Evaluation Marks

Theory 30
Attendance & Class Participation 10%
Assignments 20%
Presentations/Quizzes 10%
Internal Assessment 60%
Practical 20 Semester-End
50
Attendance & Class Participation 10% examination
Lab Report/Project Report 20%
Practical Exam/Project Work 40%
Viva 30%
Total Internal 50
Full Marks: 50 + 50 = 100

Student Responsibilities
Each student must secure at least 45% marks separately in internal assessment and practical evaluation
with 80% attendance in the class in order to appear in the Semester End Examination. Failing to get such
a score will be given NOT QUALIFIED (NQ) to appear for the Semester-End Examinations. Students are
advised to attend all the classes, formal exam, test, etc. and complete all the assignments within the
specified time period. Students are required to complete all the requirements defined for the completion
of the course.

9. Prescribed Books and References

Text Books
1) A. Silberschatz, P.B. Galvin, G. Gagne. (2009). Applied Operating System Concepts. John
Wiley & Sons, Inc.
References
1) Tanenbaum A.S. (2011). “Modern Operating System”, Pearson.
2) Dhamdhere D. M. (1999). System Programming and Operating System. Tata McGraw-Hill.
3) Tanenbaum A. S. (2017). Distributed Operating System. Pearson.