Course Plan

A. Course Handout

Institute/School Name Chitkara University Institute of Engineering and Technology

Department Name Computer Science & Engineering
Programme Name Bachelor of Engineering, Computer Science & Engineering
Course Name Operating System with Linux Session 2021-2022
Course Code Semester/Batch 2nd /2021
L-T-P (Per Week) 3-0-2 Course Credits
Course Coordinator Dr. Vinay Kukreja

1. Objectives of the Course

This course focuses on fundamental design and implementation ideas in the engineering of operating systems.
Topics include virtual memory, threads, context switches, kernels, interrupts, system calls, interprocess
communication, coordination, and the interaction between software and hardware. It explores various
concurrent programming issues in the management of resources like processor, memory and input-output. This
course is useful for students in understanding of different Linux operating commands along with their usage.

2. Course Learning Outcomes

After completion of the course, students will be able to do the following:
CLO01: Compare different types of Operating System and identify their components.
CLO02: Comprehend the concept of process, principle of concurrency
CLO03: Appraise various scheduling algorithms and deadlock handling techniques
CLO04: Epitomize memory management techniques
CLO05: Understand the concept of disk scheduling, file system and I/O devices
CLO-PO mapping grid |Program outcomes (POs)
Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
Learning
Outcome
s
CLO1 H H H M L L L L
CLO2 H H H M L L L H
CLO3 H H H H L L L M
CLO4 H H H H L L L M
CLO5 H H H H L L L M

3. Recommended Books (Reference Books/Text Books):

B01: Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne, 9 th Edition,
2018, Wiley.
B02: System Programming and Operating Systems, D.M. Dhamdhere, 2 nd Edition, 2009, Tata McGraw Hill.
B03: Operating Systems: Internals and Design Principles, William Stallings, 9 th Edition, 2018, Pearson.
B04: Modern Operating Systems, Andrew S. Tanenbaum, 4th Edition, 2016, Pearson.
B05: Advanced Linux Programming, Mark Mitchell, Jeffrey Oldham, and Alex Samuel, 1 st Edition, 2001
Germany: New Riders.

Page 1 of 13
 Course Plan

B06: Linux Command Line and Shell Scripting Bible, Richard Blum and Christine Bresnahan, 3 rd Edition,
2015, Wiley.

4. Other readings and relevant websites:

S.No. Link of Journals, Magazines, websites and Research Papers

1. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-828-operating-
system-engineering-fall-2012/download-course-materials/
2. http://nptel.ac.in/courses/106108101/
3. http://www.ics.uci.edu/~ics143/lectures.html
4. http://www.cs.kent.edu/~farrell/osf03/oldnotes/index.html
5. http://williamstallings.com/OS/OS6e.html
6. https://learning.edx.org/course/course-v1:LinuxFoundationX+LFS101x+1T2017
7. https://nptel.ac.in/courses/106/105/106105214/

5. Recommended Tools and Platforms

VirtualBox 6.1.22, Ubuntu 21.04, GCC Compiler

6. Course Plan:

Lecture Recommended Page

Number Topics Book / Other numbers
reading material of Text
Book(s)
1-2 Introduction: B01 3-5,
Introduction to Operating systems, Operating System role, 12-18
Computer system architecture: Single processor, Multiprocessor
Systems, Clustered Systems.
3 OS structure, OS operations, Components of OS: Process B01 19-31
management, memory management, storage management, I/O Link 1
management, Protection and security. Computing Environment.
4-5 Operating System Services, User and OS interface, System B01 53-73
Calls/API, Types of System Call, System Program
6 Process Concept: B01 103-128
Process Scheduling, Operations On Processes, B03 320-326,
B04 447-453
Link 2 108-140
7 Inter-process Communication B01 141-150
8 Threads: B01 161-169,
Overview of Threads, Multicore Programming, Multithreading B04 181-188,
Models, Threading issues, Linux Threads Link 5 144-145
161-174,
195-198
9 CPU Scheduling: B01 201-208
Basic Concepts, Scheduling Criteria Scheduling Algorithms-, First B03 343-347,
In first Out Scheduling Algorithms (FIFO), B04 406-416
Link 7
10-11 Shortest Job First Scheduling Algorithms (SJF), Priority B01 209
Scheduling Algorithms,
12 Scheduling Algorithms- Round-robin Scheduling Algorithms, B01 210-216
Multilevel Queue Scheduling, Multilevel Feedback Scheduling, B03 347-368
Multiple-Processor , Scheduling Real Time Scheduling B04 417-432,
Link 7 453-481

Page 2 of 13
 Course Plan

13-14 Process Synchronization: Background, The Critical-Section B01 253-259

Problem, Two process solution, Multiple Process solution, RB2 189-197
Synchronization Hardware. Link 3
Link 2
15 Semaphores B01 259-263

16-17 Classic problems of Synchronization, Critical regions, Monitors B01 263-281

B02 197-222
B03 396-432
18 Deadlock: B01 311-318
System Model Deadlock Characterization, B02 143-250
B03 371-395
B05, Link 7 168-173
19-20 Methods for handling Deadlocks B01 318-319
21 Deadlock Prevention, Deadlock avoidance, B01 319-334
B02 250-265
B05 168-183
22 Deadlock detection, Recovery From Deadlocks B01 320-344
ST-I (Syllabus covered from 1-17 lectures)
23-24 Memory Management: Basics, Swapping, Contiguous memory B01 345-360
allocation, Segmentation B02 273-308
B04 326-331
25 Paging B01 360-365
26-27 Segmentation, Segmentation with paging B01 366-376
B02, Link 4 309-312
28-30 Introduction to Virtual Memory, Demand Paging, Process B01 389-401
creation: Copy- on write B02 317-330
B05 202-222
31-32 Page Replacement Algorithms, Allocation of frames, Thrashing B01 401-422
B02 330-353
B05 202-222
33 File System : File Concept, Access Methods, Directory Structure, B01 455-490
File System Mounting, File Sharing, Protection B02 371-406
B05 382-398
B04 552-579
34-35 Implementing File System: File System Structure, File System. B01 495-515
Implementation, Directory implementation, Allocation B02 411-433
Methods, Free-space Management B05 399-428
36 Mass Storage structure: Overview, Disk Structure, Disk B01 539-556
attachment, Disk Scheduling, Disk Management, Swap-Space B02 491-504
Management B05 269-324
B01 557-580
ST-II (Syllabus covered from 18-32 lectures)
ST-III (Syllabus covered from 1-36 lectures)
Lab Plan
Lecture Number Experiments

Installation: Configuration & Customizations of Linux

1-2

Implement the basic and user status commands like: su, sudo, man, help, history, who,
3-4
whoami, id, uname, uptime, free, tty, cal, date, hostname, reboot, clear, bc.

Page 3 of 13
 Course Plan

5-6 File system: Introduction to File system, File system Architecture and File Types.

7-8 Implement the commands that is used for Creating and Manipulating files: cat, cp, mv,
rm, ls and its options, touch and their options, which is, where is, what is
9-10 Implement Directory oriented commands: cd, pwd, mkdir, rmdir
11-12 Implement File system commands: Comparing Files using diff, cmp, comm
13-14 Implementation of Compressing files: tar, gzip,
15-16 Usage of these commands along with its working: bzip2, compress, uncompress files.
17-18 Text Editors: gedit, vi, vim editor (Insert Text, delete text, Navigation, copy-paste, cut-
paste, search operation)
19-20 Apply different Searching commands: Search file or directory in directory structure
using find and locate command with various options, wildcards *, ?, [], !
21-22 Implementation of Managing Users commands: Types: Super, Owner, Group, Others,
Adding user
23-24 Implement commands for Removing user, Working with Passwords, expiry dates using
usermod.

7. Delivery/Instructional Resources

Lecture PPT Industry Web References Audio-Video

Number Topics (link of Expert
ppts on Session(If
the yes: link of
central ppts on the
server) central
server)
1-2 Introduction: https://nptel.ac.in/ https://nptel.ac.in/
Introduction to courses/ courses/
Operating systems, 106/108/106108101/ 106/105/106105214/
Operating System
role, Computer
system architecture:
Single processor,
Multiprocessor
Systems, Clustered
Systems.
3 OS structure, OS https://nptel.ac.in/ https://nptel.ac.in/
operations, courses/ courses/
Components of OS: 106/108/106108101/ 106/105/106105214/
Process
management,
memory
management,
storage
management, I/O
management,
Protection and
security. Computing
Environment.

Page 4 of 13
Course Plan

4-5 Operating System https://nptel.ac.in/ https://nptel.ac.in/

Services, User and courses/ courses/
OS interface, System 106/108/106108101/ 106/105/106105214/
Calls/API, Types of
System Call, System
Program
6 Process Concept: https://nptel.ac.in/ https://nptel.ac.in/
Process Scheduling, courses/ courses/
Operations On 106/108/106108101/ 106/105/106105214/
Processes,
7 Inter-process https://nptel.ac.in/ https://nptel.ac.in/
Communication courses/ courses/
106/108/106108101/ 106/105/106105214/
8 Threads: https://nptel.ac.in/ https://nptel.ac.in/
Overview of courses/ courses/
Threads, Multicore 106/108/106108101/ 106/105/106105214/
Programming,
Multithreading
Models, Threading
issues, Linux
Threads
9 CPU Scheduling: https://nptel.ac.in/ https://nptel.ac.in/
Basic Concepts, courses/ courses/
Scheduling Criteria 106/108/106108101/ 106/105/106105214/
Scheduling
Algorithms-, First In
first Out Scheduling
Algorithms (FIFO),
10-11 Shortest Job First https://nptel.ac.in/ https://nptel.ac.in/
Scheduling courses/ courses/
Algorithms (SJF), 106/108/106108101/ 106/105/106105214/
Priority Scheduling
Algorithms,
12 Scheduling https://nptel.ac.in/ https://nptel.ac.in/
Algorithms- Round- courses/ courses/
robin Scheduling 106/108/106108101/ 106/105/106105214/
Algorithms,
Multilevel Queue
Scheduling,
Multilevel Feedback
Scheduling,
Multiple-Processor ,
Scheduling Real
Time Scheduling
13-14 Process https://nptel.ac.in/ https://nptel.ac.in/
Synchronization: courses/ courses/
Background, The 106/108/106108101/ 106/105/106105214/
Critical-Section
Problem, Two
process solution,
Multiple Process
solution,
Synchronization
Hardware.

Page 5 of 13
Course Plan

15 Semaphores https://nptel.ac.in/ https://nptel.ac.in/

courses/ courses/
106/108/106108101/ 106/105/106105214/
16-17 Classic problems of https://nptel.ac.in/ https://nptel.ac.in/
Synchronization, courses/ courses/
Critical regions, 106/108/106108101/ 106/105/106105214/
Monitors

18 Deadlock: https://nptel.ac.in/ https://nptel.ac.in/

System Model courses/ courses/
Deadlock 106/108/106108101/ 106/105/106105214/
Characterization,
19-20 Methods for https://nptel.ac.in/ https://nptel.ac.in/
handling Deadlocks courses/ courses/
106/108/106108101/ 106/105/106105214/
21 Deadlock https://nptel.ac.in/ https://nptel.ac.in/
Prevention, courses/ courses/
Deadlock avoidance, 106/108/106108101/ 106/105/106105214/
22 Deadlock detection, https://nptel.ac.in/ https://nptel.ac.in/
Recovery From courses/ courses/
Deadlocks 106/108/106108101/ 106/105/106105214/
23-24 Memory https://nptel.ac.in/ https://nptel.ac.in/
Management: courses/ courses/
Basics, Swapping, 106/108/106108101/ 106/105/106105214/
Contiguous memory
allocation,
Segmentation

25 Paging https://nptel.ac.in/ https://nptel.ac.in/

courses/ courses/
106/108/106108101/ 106/105/106105214/
26-27 Segmentation, https://nptel.ac.in/ https://nptel.ac.in/
Segmentation with courses/ courses/
paging 106/108/106108101/ 106/105/106105214/
28-30 Introduction to https://nptel.ac.in/ https://nptel.ac.in/
Virtual Memory, courses/ courses/
Demand Paging, 106/108/106108101/ 106/105/106105214/
Process creation:
Copy- on write

31-32 Page Replacement https://nptel.ac.in/ https://nptel.ac.in/

Algorithms, courses/ courses/
Allocation of frames, 106/108/106108101/ 106/105/106105214/
Thrashing
33 File System : File https://nptel.ac.in/ https://nptel.ac.in/
Concept, Access courses/ courses/
Methods, Directory 106/108/106108101/ 106/105/106105214/
Structure, File
System Mounting,
File Sharing,
Protection
34-35 Implementing File https://nptel.ac.in/ https://nptel.ac.in/
System: File System courses/ courses/
Structure, File 106/108/106108101/ 106/105/106105214/
System.

Page 6 of 13
 Course Plan

Implementation, https://ocw.mit.edu/
Directory courses/electrical-
implementation, engineering-and-
Allocation Methods, computer-science/6-
Free-space 828-operating-system-
Management engineering-fall-2012/
lecture-notes-and-
readings/
MIT6_828F12_lec9_not
es.pdf
36 Mass Storage https://nptel.ac.in/ https://nptel.ac.in/
structure: Overview, courses/ courses/
Disk Structure, Disk 106/108/106108101/ 106/105/106105214/
attachment, Disk
Scheduling, Disk
Management, Swap-
Space Management.

8. Action plan for different types of learners

Slow Learners Average Learners Advanced Learners

 Remedial Class for slow  Doubt Class for average learners  Red Hat Academy Courses
learners.  Special Doubt session will be would be provided to fast
 Specific Topics will be covered arranged for ST topics. learner.
again in Remedial Class.  Doubts of individual student will  Certification exams will be
 Individual feedback to each be resolved. offered to interested
slow learner. students.

9. Evaluation Scheme & Components:

Evaluation Type of Component No. of Weightage of Mode of

Component Assessments Component Assessment

Component 1 Formative Assessments (FAs) 03* 20% Online

Component 2 Subjective Test/Sessional Tests 03** 30% Online

(STs)

Component 3 End Term Examinations 01 50% Online

Total 100%

*Out of 03 FAs, the ERP system automatically picks the best 02 FAs marks for evaluation of the FAs as final marks.
**Out of 03 STs, the ERP system automatically picks the best 02 STs marks for evaluation of the STs as final marks.

10. Details of Evaluation Components:

Page 7 of 13
 Course Plan

Evaluation Description Syllabus Covered Timeline of Examination Weightage

Component (%) (%)
FA1 Up to 25% Week 4
Component 01 FA2 26%-50% Week 7 20%
FA3 51%-85% Week 10

ST 01 Up to 40% Week 5

Component 02 ST 02 41% - 80% Week 11 30%

ST 03 100% Week 13

End Term At the end of the

Component 03 100% 50%
Examination* semester

Total 100%
*As per Academic Guidelines minimum 75% attendance is required to become eligible for appearing in the End Semester
Examination.

Evaluation Components

Type of Assessment Time of Total Question Paper Format

Conduction Marks
1 Mark 2 Mark 5 Mark 10 Mark
MCQ MCQ Algorithm/Coding Algorithm/Coding
Formative
Week 4 10 10 - - -
Assessment 1

Sessional Test 1 Week 5 30 20 5 - -

Formative
Week 7 10 10 - - -
Assessment 2

Sessional Test 2 Week 11 30 20 5 - -

Formative
Week 10 10 10 - - -
Assessment 3

Sessional Test 3 Week 13 30 20 5 - -

End Term Examination 50 30 10 - -

11. Syllabus of the Course:

Topics No of Weightage
Lectures
Introduction: 5
Introduction to Operating systems, Operating System role, Computer
system architecture: Single processor, Multiprocessor Systems, Clustered 18%
Systems. OS structure, OS operations, Components of OS: Process

Page 8 of 13
 Course Plan

management, memory management, storage management, I/O

management, Protection and security. Computing Environment. Operating
System Services, User and OS interface, System Calls/API, Types of System
Call, System Program
Process Concept: 2
Process Scheduling, Operations On Processes, Inter-process Communication
Threads: 1
Multithreading Models, Overview, Threading issues, Linux Threads
12.8%
CPU Scheduling: 4
Basic Concepts, Scheduling Criteria Scheduling Algorithms Multiple-
Processor, Scheduling Real Time Scheduling
Process Synchronization: Background, The Critical-Section Problem , Two 3
25.6%
process solution, Multiple Process solution, Synchronization Hardware,
Semaphores
Classic problems of Synchronization, Critical regions, Monitors 2
Deadlock:
5
System Model Deadlock Characterization, Methods for handling Deadlocks,
Deadlock Prevention, Deadlock avoidance, Deadlock detection, Recovery
From Deadlocks
Memory Management:
5
Basics, Swapping, Contiguous memory allocation, Segmentation. Paging,
25.6%
Segmentation with paging.
Introduction to Virtual Memory, Demand Paging, Process creation: Copy- 5
on write, Page Replacement Algorithms, Allocation of frames, Thrashing.
File Concept: File Concept, Access Methods, Directory Structure, File System
Mounting, File Sharing, Protection,
3
Implementing File System: File System Structure, File System.
18%
Implementation, Directory implementation, Allocation Methods, Free-space
Management
Mass Storage structure: Overview, Disk Structure, Disk attachment, Disk 1
Scheduling, Disk Management, Swap-Space Management.

This Document is approved by:

Designation Name Signature
Course Coordinator Dr. Vinay Kukreja
Head Academic Delivery Dr. Vinay Gautam
Cluster Dean Dr. Raj Gaurang
Dean (Academics Affairs) Dr. Rajnish Sharma

Page 9 of 13
 Course Plan

Date 17.02.2022

Page 10 of 13
 Course Plan

B. Course Execution Plan (Faculty)

Lecture Date of delivery Remarks (if any)

Number Topics
1-2 Introduction:
Introduction to Operating systems, Operating System role,
Computer system architecture: Single processor,
Multiprocessor Systems, Clustered Systems.
3 OS structure, OS operations, Components of OS: Process
management, memory management, storage
management, I/O management, Protection and security.
Computing Environment.
4-5 Operating System Services, User and OS interface, System
Calls/API, Types of System Call, System Program
6 Process Concept:
Process Scheduling, Operations On Processes,
7 Inter-process Communication
8 Threads:
Overview of Threads, Multicore Programming,
Multithreading Models, Threading issues, Linux Threads
9 CPU Scheduling:
Basic Concepts, Scheduling Criteria Scheduling
Algorithms-, First In first Out Scheduling Algorithms
(FIFO),
10-11 Shortest Job First Scheduling Algorithms (SJF), Priority
Scheduling Algorithms,
12 Scheduling Algorithms- Round-robin Scheduling
Algorithms, Multilevel Queue Scheduling, Multilevel
Feedback Scheduling, Multiple-Processor , Scheduling
Real Time Scheduling
13-14 Process Synchronization: Background, The Critical-
Section Problem, Two process solution, Multiple Process
solution, Synchronization Hardware.
15 Semaphores
16-17 Classic problems of Synchronization, Critical regions,
Monitors
18 Deadlock:

Page 11 of 13
 Course Plan

System Model Deadlock Characterization,

19-20 Methods for handling Deadlocks
21 Deadlock Prevention, Deadlock avoidance,
22 Deadlock detection, Recovery From Deadlocks
23-24 Memory Management: Basics, Swapping, Contiguous
memory allocation, Segmentation
25 Paging
26-27 Segmentation, Segmentation with paging
28-30 Introduction to Virtual Memory, Demand Paging, Process
creation: Copy- on write
31-32 Page Replacement Algorithms, Allocation of frames,
Thrashing
33 File System : File Concept, Access Methods, Directory
Structure, File System Mounting, File Sharing, Protection
34-35 Implementing File System: File System Structure, File
System. Implementation, Directory implementation,
Allocation Methods, Free-space Management
36 Mass Storage structure: Overview, Disk Structure, Disk
attachment,
37 Disk Scheduling, Disk Management, Swap-Space
Management.
38-39 Protection: Domain of Protection, Access Matrix.

Security: Security Problem, Program Threats, System

Threats User Authentication Problem.

Signature With Name Counter Signed by

Faculty In-Charge Cluster Dean

Page 12 of 13
 Course Plan

C. Lab Execution Plan (Faculty)

Lecture Experiments Date of Remarks (if any)

Number
delivery

Installation: Configuration & Customizations of Linux

1-2

Implement the basic and user status commands like: su, sudo,
3-4 man, help, history, who, whoami, id, uname, uptime, free, tty,
cal, date, hostname, reboot, clear, bc.
File system: Introduction to File system, File system
5-6
Architecture and File Types.
Implement the commands that is used for Creating and
7-8 Manipulating files: cat, cp, mv, rm, ls and its options, touch and
their options, which is, where is, what is
9-10 Implement Directory oriented commands: cd, pwd, mkdir,
rmdir
11-12 Implement File system commands: Comparing Files using diff,
cmp, comm
13-14 Implementation of Compressing files: tar, gzip,

15-16 Usage of these commands along with its working: bzip2,

compress, uncompress files.
17-18 Text Editors: gedit, vi, vim editor (Insert Text, delete text,
Navigation, copy-paste, cut-paste, search operation)
19-20 Apply different Searching commands: Search file or directory
in directory structure using find and locate command with
various options, wildcards *, ?, [], !
21-22 Implementation of Managing Users commands: Types: Super,
Owner, Group, Others, Adding user
23-24 Implement commands for Removing user, Working with
Passwords, expiry dates using usermod.
25-26 Implement Process oriented commands: ps, pstree, kill, killall
(with all their options),

Signature with Name Counter Signed by

Faculty In-Charge Cluster Dean

Page 13 of 13