MIT Vishwaprayag University, Solapur

School of Computing

Curriculum: Master in MCA 2024-2026

Term: 1 - Semester
Course: SC5101 - Operating System: Internals and Design Principles

Course Plan
Semester: 1 - Semester Year: 2024-2025
Course Title:Operating System: Internals and Design Course Code: SC5101
Principles
Total Contact Hours: 60 Duration of TEE: 3 Hours
TEE Marks: 50 CIA Marks: 50
Lesson Plan Author: Dr. Darshan Ruikar Attendance Marks: 0
Checked By: Mrs. Stuti Ahuja Last Reviewed Date: -
Co-course Owner: A - Dr.Darshan Ruikar Last Modified Date:

Course Outcomes (COs):

At the end of the course the student should be able to:
1. Explain various operating system services, types of operating systems, and types of
kernels.
2. Analyze the application of appropriate algorithms and data structures to build the file
subsystems within the unix operating system architecture.
3. Analyze the application of appropriate algorithms and data structures to build the
process subsystems within the unix operating system architecture.
4. Analyze scheduling and memory management mechanisms.
5. Describe the architecture and features of rtos.
6. Develop c program or shell script to automate system tasks

Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program

Outcomes (POs)

Powered by www.ioncudos.com Page 1 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Course Title: Operating System: Internals and Design Semester: 1 - Semester

Principles
Course Code: SC5101 Year: 2024-2025

Course Outcomes (COs) / Program 1 2 3 4 5 6 7 8 9 10 11 12 13 14

Outcomes (POs)
1. Explain various operating system 3
services, types of operating systems, and
types of kernels.
2. Analyze the application of appropriate 2 3
algorithms and data structures to build
the file subsystems within the unix
operating system architecture.
3. Analyze the application of appropriate 2 3
algorithms and data structures to build
the process subsystems within the unix
operating system architecture.
4. Analyze scheduling and memory 2 3
management mechanisms.
5. Describe the architecture and features 3 2
of rtos.
6. Develop c program or shell script to 2 3
automate system tasks

Course Content
Course Code: SC5101 Course Title: Operating System: Internals and

Powered by www.ioncudos.com Page 2 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Design Principles
L-T-P: 4-0-0 Credits: 4 Contact Hrs: 60
CIA Marks: 50 TEE Marks: 50 Attendance Marks: 0 Total Marks: 100
Teaching Hrs: 60 Exam Duration: 3 hrs

Content Hrs
Unit I
Chapter No. 1 - Introduction to Operating system 9
The function of operating system, Types of operating systems, kernel, types of kernels hrs
(RTOS, Macro, Monolithic), Unix operating system: history, features of Unix, System
Structure, User Perspective, Assumptions about Hardware, Architecture of Unix
Operating System, the architecture of Unix kernel
Chapter No. 2 - File sub-system 12
Buffer cache: data structure, algorithms: getblk, bread, breada, bwrite, brelese, hrs
advantage and limitation of buffer cache, File and directoriesinode, structure of regular
file, directories, conversion of the path to the inode, superblock, inode assignment to a
new file, allocation of disk block file, other file types, system calls: open, read, write,
lseek, close, pipes, dup, mounting and unmounting file systems, link and unlink
Unit II
Chapter No. 3 - Process 9
Process state transition diagram, the layout of system memory, the context of the hrs
process, saving the context of the process, sleep, process creation, memory layout C
program, signals, process termination, the shell, boot, and init process
Chapter No. 4 - Scheduling 4
Scheduling algorithms (non-preemptive and preemptive), fair share scheduler of Unix hrs
Chapter No. 5 - Memory Management 5
Swapping and demand paging hrs
Unit III
Chapter No. 6 - Introduction to RTOS 9
Introduction to Real-Time Systems, Classification of real-time systems, Difference hrs
between GPOS and RTOS- Real-Time Kernels - RTOS Architecture- Features of
RTOSPOSIX-RT standard

Powered by www.ioncudos.com Page 3 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Chapter wise Plan

Course Code and Title: SC5101 / Operating System: Internals and Design Principles
Chapter Number and Title: 1 - Introduction to Operating system Planned Hours: 9
hrs
Learning Outcomes:-
At the end of the topic the student should be able to:
Sl Topic Learning Outcomes COs BL
No.
1 Describe the fundamental roles and responsibilities of an CO1 L2,L4
operating system in managing computer resources and providing
services to users.
2 Differentiate between various kernel types (monolithic, micro, CO1 L2,L3,L4
hybrid) based on their structure and functionalities
3 Trace the evolution of the Unix operating system and identify its CO1 L2
key features
4 Explain the basic structure of a Unix-based system and Unix CO1 L2
Kernel
5 Describe the user's Perspective and assumptions about hardware CO1 L2

Lesson Schedule:-

Lecture No. - Portion covered per hour Planned Actual

Delivery Date Delivery Date
1. Birdseye view of the course
2. Basic operating system concepts: functions
3. Discussion on types of operating system
4. Discussion on types of kernel
5. Architecture of the Unix Operating system: System
Structure
6. Unix kernel architecture
7. Basic Linux commands: file and directory
8. Unix operating system: history, features of Unix
9. User Perspective, Assumptions about Hardware

Powered by www.ioncudos.com Page 4 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Review Questions

Sl.No. - Questions TLOs BL

1. How would you design a basic operating system for a resource- TLO1 L2
constrained device like a smartwatch, considering its limited processing
power, memory, and battery life?
2. Given a specific set of hardware components and user requirements, TLO2 L4
choose the most suitable operating system type and justify your
decision.
3. Compare and contrast the security implications of monolithic, micro, TLO3 L2
and hybrid kernels. Which architecture is generally considered more
secure, and why?
4. How has the open-source nature of Unix influenced the development TLO4 L2
of other operating systems, and what impact has this had on the
software industry as a whole?
5. Compare the file system structure of Unix with other operating TLO5 L2
systems (e.g., Windows, macOS). What are the key similarities and
differences, and how do these impact system performance and
organization?
6. Evaluate the performance implications of different Unix kernel TLO5
design choices (e.g., monolithic vs. microkernel) in the context of
modern workloads and hardware trends

Powered by www.ioncudos.com Page 5 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Course Code and Title: SC5101 / Operating System: Internals and Design Principles
Chapter Number and Title: 2 - File sub-system Planned Hours: 12 hrs
Learning Outcomes:-
At the end of the topic the student should be able to:
Sl No. Topic Learning Outcomes COs BL
1 Explain the concept of buffer cache and its role in improving file CO2 L2
system performance.
2 Analyze the buffer cache data structures and algorithms (getblk, CO2 L2,L4
bread, breada, bwrite, brelse) used for efficient disk I/O
operations.
3 Describe the structure of the file system and the role of the CO2 L2
superblock in managing file system metadata
4 Describe the structure of regular files, inode structure and its role CO2 L2
in representing file metadata.
5 Explain the process of allocating inodes and disk blocks to files CO2 L2
and managing free space.
6 Explain the organization of directories and the process of CO2 L2
converting a path to an inode.
7 Explain the role of underlying algorithms and data structures in CO3 L3
the implementation of common file system calls (open, read,
write, lseek, close, pipes, dup)
8 Describe the concepts of mounting and unmounting file systems CO2 L2
and their implications. Explain the link and unlink operations and
their impact on file system structure
Lesson Schedule:-

Lecture No. - Portion covered per hour Planned Actual

Delivery Date Delivery Date
1. Introduction to buffer cache mechanism: buffer header,
free list of buffer and hash queue of buffer, scenario of
getting buffer
2. Algorithm: getblk, bread, breada, bwrite, brelse
3. Content of inode, inode assignment to a new file Iget iput
4. Structure of regular file, bmap

Powered by www.ioncudos.com Page 6 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

5. Directories, conversion of the path to the inode, super

block
6. Allocation of inode new file Ialloc, ifree
7. Allocation of disk block file: alloc and free
8. C programs to use system calls: open, read
9. C programs to use system calls: open, write, lseek, close
10. other file formats and pipe
11. Mount and Umount
12. Link and Ulink

Review Questions

Sl.No. - Questions TLOs BL

1. Explain in detail the concept of delayed write TLO1 L2
2. How does the buffer cache help reduce disk I/O operations? TLO2 L4
3. What is the purpose of the mount system call in Unix-based operating TLO8 L2
systems? Explain the two main arguments required for the mount system
call. Briefly describe their roles in the mounting process. While
attempting to mount the USB drive, you encounter an error message
stating "mount: /dev/sdb1: permission denied." What could be a potential
reason for this error and how might you troubleshoot it?
4. List the algorithms involved in read() system call. Explain the execution TLO7 L3
details for below code#include<fcntl.h>main(){ Int fd; Char lilbuf[20],
bigbuf[1024]; Fd=open(“/etc/password”,O_RDONLY);
Read(Fd,lilbuf,20); Read(Fd,bigbuf,1024); Read(Fd,lilbuf,20);}
5. Explain the 13-member array and use algorithm Bmap to locate data TLO4 L2
starting from address 3 MB to 3.2 MB. Comment on block read ahead is
required. (assume the block size is 1Kb)
6. list the contents of incore inode TLO3 L2
7. List the algorithms involved in read() system call. Explain the execution TLO8
details for below code#include<fcntl.h>main(){ Int fd; Char lilbuf[20],
bigbuf[1024]; Fd=open(“/etc/password”,O_RDONLY);
Read(Fd,lilbuf,20); Read(Fd,bigbuf,1024); Read(Fd,lilbuf,20);}

Course Code and Title: SC5101 / Operating System: Internals and Design Principles

Powered by www.ioncudos.com Page 7 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Chapter Number and Title: 3 - Process Planned Hours: 9 hrs

Learning Outcomes: -
At the end of the topic the student should be able to:
Sl Topic Learning Outcomes COs BL
No.
1 Describe the different states a process can undergo and the CO4 L2
transitions between these states
2 Explain the concept of a process context and the information it CO4 L2
contains.
3 Describe the system calls and data structures involved in process CO4 L2
creation and termination, including memory allocation and
deallocation
4 Analyze the memory organization of a process, including code, CO3 L2
data, heap, and stack segments
5 Explain the role of signals in process communication and CO4 L3
termination, including signal handling and process termination
procedures
6 Describe the boot process and the role of the init process in starting CO4 L2
the operating system
7 Develop C program to create thread and process CO3 L3
8 Develop C program to demonstrate the singe handling mechanism CO4 L3
Lesson Schedule:-
Lecture No. - Portion covered per hour Planned Actual
Delivery Date Delivery Date
1. Process state transition diagram
2. contents of uarea and process table
3. context switch
4. the layout of system memory
5. Interrupt and system call handling
6. manipulating process space
7. C code demonstrating sleep and wakeup
8. C code to demonstrate process creation

Powered by www.ioncudos.com Page 8 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

9. Executable file structure

10. C code for signal handling
11. Describe the boot process
12. Explain role of the init process in starting the operating
system

Review Questions

Sl.No. - Questions TLOs BL

1. Draw and explain the process state transition TLO1 L2
2. Explain the concept of a process context and context switch TLO2 L2
3. Write exec() algorithm and execute it for the below code\nmain()\n{\ TLO3 L2
n if(fork()==0)\n {\n execl(“a.out”,0);\n }\n}
4. Draw and explain common object file format structure TLO6 L3
5. write a C program to demonstrate the handling of death of child TLO8 L3
signal

Powered by www.ioncudos.com Page 9 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Course Code and Title: SC5101 / Operating System: Internals and Design Principles
Chapter Number and Title: 4 - Scheduling Planned Hours: 4 hrs
Learning Outcomes:-
At the end of the topic the student should be able to:
Sl Topic Learning Outcomes COs BL
No.
1 Define key terms related to scheduling, such as process, job, CO5 L2
turnaround time, waiting time, response time, and throughput
2 Compare and contrast different non-preemptive scheduling CO5 L4
algorithms (FCFS, SJF, Priority) based on their performance
characteristics and suitability for different workloads.
3 Compare and contrast different preemptive scheduling algorithms CO5 L4
(Round Robin, SJF with preemption, Priority with preemption)
based on their performance characteristics and suitability for
different workloads
4 Explain the concept of fair-share scheduling and how it is CO5 L3
implemented in the Unix operating system

Lesson Schedule:-

Lecture No. - Portion covered per hour Planned Actual

Delivery Date Delivery Date
1. Introduction to scheduling, key terms related to
scheduling, Compare and contrast different non-preemptive
and preemptive scheduling algorithms
2. process scheduling in Unix
3. Fair share schedular
4. System call for time, Clock profile

Review Questions

Sl.No. - Questions TLOs BL

1. Define: turnaround time, waiting time, response time, and throughput TLO1 L2
2. Demonstrate the use of time related system class TLO2 L4

Powered by www.ioncudos.com Page 10 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

3. Suppose processes A, B, and C are created simultaneously with initial TLO3 L4

priority 60, the clock interrupts the system 60 times per second. The
kernel calculates the decay of CPU usage by the formula\nDecay
(CPU)= CPU-10; and the process priority as priority=(CPU/16)+60. For
the above discussed scenario draw the process scheduling chart for at
least 5 seconds
4. You\'re developing a program that needs to perform an action (e.g., TLO4 L3
send emails) at regular intervals. Use the concept of callout tables in
Unix for a potentially more efficient solution. Describe the key
components of a callout table entry and their functionalities. Also,
comment on nowadays callout tables are less common in modern
systems, and explain a potential scenario where they might still be
relevant.

Powered by www.ioncudos.com Page 11 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Course Code and Title: SC5101 / Operating System: Internals and Design Principles
Chapter Number and Title: 5 - Memory Management Planned Hours: 5 hrs

Learning Outcomes:-

At the end of the topic the student should be able to:

Sl Topic Learning Outcomes COs BL

No.
1 Explain the concept of swapping as a memory management CO5 L2
technique, including its advantages and disadvantages
2 Explain the concept of demand paging as a memory management CO5 L2
technique, including page faults and handling
3 Develop a C program to demonstrate the page fault mechanism CO3 L2,L3

Lesson Schedule:-

Lecture No. - Portion covered per hour Planned Actual

Delivery Date Delivery Date
1. Introduction to memory managemnt
2. Swapping algorithm
3. Demand paging
4. page staler process
5. page fault mechanism

Review Questions

Sl.No. - Questions TLOs BL

1. Write and explain the algorithm for allocating space from swap Map TLO1 L2
2. Write and explain the algorithm for swapping out the process from TLO2 L2
the main memory to the swap area
3. Describe the data structures involved in the process management TLO3 L2

Powered by www.ioncudos.com Page 12 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Course Code and Title: SC5101 / Operating System: Internals and Design Principles
Chapter Number and Title: 6 - Introduction to RTOS Planned Hours: 9 hrs

Learning Outcomes:-

At the end of the topic the student should be able to:

Sl Topic Learning Outcomes COs BL

No.
1 differentiate between hard and soft real-time systems along with the CO6 L2
criticality of timing constraints in these systems
2 Acquire in-depth knowledge of RTOS functionalities such as task CO6 L3
scheduling, interrupt handling, memory management, and inter-
process communication
3 Analyse real-world problems and design appropriate real-time CO6 L4
solutions, considering factors like timing constraints, resource
utilization, and reliability
4 Explain advanced topics such as real-time scheduling algorithms, CO6 L2
distributed real-time systems, and fault-tolerant systems, low-power
design considerations

Lesson Schedule:-

Lecture No. - Portion covered per hour Planned Actual

Delivery Date Delivery Date
1. Real-Time System basic concepts, Pseudo kernels
2. Need for Real-TIme Operating System(RTOS) , its
characteristics
3. comparison GPOS and RTOS
4. RTOS functionalities :Real-time scheduling, Resource
management: Interrupt handling
5. Task management, Memory management
6. Deadlock Management, Multitasking
7. Device driver management, Inter-task communication,
Redundancy and error correction

Powered by www.ioncudos.com Page 13 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

8. Selection Criteria of RTOS, Low-Power Design issues

9. Case study on RTOS

Review Questions

Sl.No. - Questions TLOs BL

1. differentiate between the types of real-time systems TLO1 L2
2. explain the functionalities of an RTOS, including task management, TLO2 L3
scheduling, and resource management
3. discuss the challenges and strategies for efficient resource TLO3 L4
management in real-time environments
4. analyze case studies to understand the challenges and solutions TLO4 L2
employed in real-time systems

Powered by www.ioncudos.com Page 14 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Model Question Paper

Question Paper Title: MCAOSMinor1

Total Duration Course: Operating System: Maximum Marks: 40

(H:M): 3 Internals and Design Principles
(SC5101)
Note:

Q.No. Questions Marks CO BL

1

1 What is the file? Comment on why each and 4.00 CO2 L2

everything is a file with respect to the Unix
operating system.
2 Explain the data structure used in the buffer cache 4.00 CO2 L2
3 Why maximum operating system uses monolithic 4.00 CO4 L3
architecture
4 Explain the 13-member array and use algorithm 4.00 CO4 L3
Bmap to locate data starting from address 3 MB to
3.2 MB. Comment on block read ahead is required.
(assume the block size is 1Kb)
5 Explain open system call. List the algorithm 4.00 CO4 L3
required to develop an open system call.
Demonstrate the changes in the data structure for
the following
Process A

fd1=open("/etc/passwd", O_RDONLY);

fd2 open ("local", 0 RDWR);

fd3 open(“etc/passwd", O_WRONLY)

2

6 Explain different types of access permission in the 4.00 CO2 L2

Powered by www.ioncudos.com Page 15 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Unix Operating system. Prepare the table of access

permission from no permission to all permissions.
7 Explain the scenarios of getting a buffer 4.00 CO2 L2
8 Explain the need for processor execution level. 4.00 CO4 L3
Justify the appropriate level of processor execution
level during manipulating critical data structures.
9 Demonstrate the use of namei algorithm. Simulate 4.00 CO4 L3
the scenario to open("//etc/passwd", O_RDONLY);
consider the inode number of
/: 0, etc: 15, password: 75.
10 Demonstrate the difference between 4.00 CO4 L3
locked/unlocked inode, free/busy inode. What if
inode link count is 0
3

11 Explain multi-programming and multi-tasking 4.00 CO2 L2

operating systems. Comment on their similarities
and dissimilarities
12 Explain the concept of delayed write in detail 4.00 CO2 L2
13 Demonstrate the use of I/O redirection with the 4.00 CO4 L3
help of example
14 Simulate the scenario if the user deleted a file with 4.00 CO4 L3
size 15 Kb.
Show the changes made in data structures in the
superblock. Assume block free list capacity in the
super block is 10.
15 Demonstrate the use of ifree algorithm. Name the 4.00 CO4 L3
algorithm and scenario where this algorithm is
been called.

Date:

Course in-charge Head of

Department

Powered by www.ioncudos.com Page 16 of 17.

 MIT Vishwaprayag University, Solapur

School of Computing

Powered by www.ioncudos.com Page 17 of 17.