Session: 2019–20

Department: Computer Science Engineering Course: B.Tech

Semester: 4th Subject Name: Operating system
Subject Code: PCC-CSE-206G Faculty Name: Mr.NEERAJ KUMAR

Lesson Plan File

Academic Session: 2020-21

Branch Name: Computer Science Engineering Semester: IV
Name of the Subject : POS
Paper Code: PCC-CSE-206G Lectures Per Week: 3

Faculty Name: Mr.NEERAJ KUMAR

Signature: ……………….

H.O.D.’s Remarks & Signature

-------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------

Signature

REGISTRAR DIRECTOR

1|P a g e
Session: 2019–20

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEEIRING

LESSON PLAN FILE

Name of the Faculty: Mr.NEERAJ KUMAR

Semester: 4th (B.Tech)

Subject: Operating System (PCC-CSE-206G)

INDEX

S.NO NOMENCLATURE Page No.

1. Syllabus as per MDU 3
2. Focal Points 4
3. Course objective 5
4. Lesson Plan 6-8
5. Important Topics 9
6. Assignments 10-13
7. Past Question Papers 14-19
8. Monthly Report 20
9. Student Feedback Form 21
10. Time Table 22
11. Attendance Sheet 23
12. Sessional Report 24

2|P a g e
Session: 2019–20

SYLLABUS AS PER MDU

PRINCIPLE OF OPERATING SYSTEM PCC-CSE-206G

UNIT 1
Introduction: Concept of Operating Systems, Generations of Operating systems, Types of
Operating Systems, OS Services.
Processes: Definition, Process Relationship, Different states of a Process, Process State
transitions, Process Control Block (PCB), Context switching. Thread: Definition, Various states,
Benefits of threads, Types of threads, Multithreading.
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers, Scheduling
criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time;
Scheduling algorithms: Pre-emptive and Non-pre-emptive, FCFS, SJF, SRTF, RR Scheduling.

UNIT 2
Inter-process Communication: Critical Section, Race Conditions, Mutual Exclusion, The
Producer\ Consumer Problem, Semaphores, Event Counters, Monitors, Message Passing,
Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem etc.
Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock
Prevention, and Deadlock Avoidance: Banker’s algorithm, Deadlock detection and Recovery.

UNIT 3
Memory Management: Basic concept, Logical and Physical address map, Memory
allocation: Contiguous Memory allocation – Fixed and variable partition–Internal and External
fragmentation and Compaction; Paging: Principle of operation – Page allocation – Hardware
support for paging, Protection and sharing, Disadvantages of paging.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures –
Locality of reference, Page fault, Working Set, Dirty page/Dirty bit – Demand paging, Page
Replacement algorithms: Optimal, First in First Out (FIFO), Optimal Page Replacement and
Least Recently used (LRU).

UNIT 4

3|P a g e
Session: 2019–20

File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocation methods (contiguous, linked, indexed), efficiency
and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk
reliability, Disk formatting, Boot-block, Bad blocks. Case study on UNIX and WINDOWS
Operating System.

Text Books:
• Operating System Concepts by Silberchatz et al, 5th edition, 1998, Addison-Wesley.
• Modern Operating Systems by A. Tanenbaum, 1992, Prentice-Hall.
• Operating Systems Internals and Design Principles by William Stallings,4th edition, 2001,
Prentice Hall

Reference Books:
• Operating System By Peterson , 1985, AW. • Operating System By Milankovic, 1990, TMH.
• Operating System Incorporating With Unix & Windows By Colin Ritche, 1974, TMH.
• Operating Systems by Mandrik & Donovan, TMH • Operating Systems By Deitel, 1990, AWL.
• Operating Systems – Advanced Concepts By Mukesh Singhal , N.G. Shivaratri, 2003, T.M.H

4|P a g e
Session: 2019–20

FOCAL POINTS
1. Effort will be made to make the student conversant with the syllabus of the Subject & the
importance of the subject on the first day. Books on the subject available in the library & market
will be listed.

2. Effort will be made so that Student should remain present in the class mentally not physically.
Questions will be asked on the topic taught in the class & presence (attendance) will be given to
those students who will reply satisfactorily.

3. Regular test will be conducted.

4. Assignment will be given as per schedule.

5|P a g e
Session: 2019–20

COURSE OBJECTIVE

BTECH.: 4th SEMESTER

Course Lecturer- : Mr.NEERAJ KUMAR

PRINCIPLE OF OPERATING SYSTEM PCC-CSE-206G

COURSE OBJECTIVE-
The objective of this course is to study basic principles and role of operating system. In this
course students learnt about various CPU scheduling techniques , process management,
memory management techniques performed by operating system.

COURSE OUTCOMES (COS): At the end of the course, the student shall be able to:

1. Understand the basic of Operating System.

2. Learn different CPU scheduling algorithms.
3. Grasp the concepts of memory management and process synchronization.
4. Learn the concepts of disc scheduling
5. Learn the concepts of I/O system , Unix and window NT.

METHODOLOGY-
i) The pedagogy will be lectures, assignments, and tests.
ii) Audio – Visual aids will be used during the course.
iii) Surprise tests and Quiz
iv) Industrial visits and seminars

EVALUATION-
Besides the semester end – examination, the students will be continuously assessed during the
course on the following basis:
i) Mid Term Examinations: 20 Marks
ii) Internal Assessment: 30 Marks
iii) Class Assesment: 25
iv) End Semester Examination: 75 Marks
Total: 150 Marks

6|P a g e
Session: 2019–20

Lesson Plan

Name of the Faculty : Mr.NEERAJ KUMAR

Discipline : B.TECH
Semester : 4th
Subject : Principle of Operating System
Lesson Plan Duration : 15 Weeks
** Work Load (Lecture/Practical) per week (in hours): Lectures-03
Week Theory Practical
Lecture Topic Practical Topic
Day (including assignment/test) day
1st 1st Introduction to Operating System Introduction to UNIX
Concepts File System.
2nd Types of Operating Systems
3rd Types of Operating Systems
2nd 1st Types of Operating Systems File and Directory
2nd Various Operating system services, Related Commands in
Architecture UNIX.
3rd System programs and calls

3rd 1st Process concept, Process Essential UNIX

scheduling Commands for working
2nd Operation on processes in UNIX environment.
3rd CPU scheduling, Scheduling
criteria
4th 1st Scheduling algorithms I/O Redirection and
2nd
Scheduling algorithms Piping

3rd Scheduling algorithms

5th 1st ASSIGNMENT -1 Introduction to VI
2nd Logical & Physical Address Editors.
Space, Swapping
3rd Contiguous memory allocation,
noncontiguous memory allocation

7|P a g e
Session: 2019–20

6th 1st paging and segmentation Introduction of Processes

techniques . in UNIX
2nd segmentation with paging
3rd virtual memory management
7th 1st Demand Paging & Page-
Replacement Algorithms
2nd Demand Segmentation
ASSIGNMENT -2
3rd Different types of files
8th 1st File access methods
2nd directory structures
3rd Various
allocation methods
9th 1st disk scheduling and management Communication in
2nd disk scheduling algorithm UNIX and AWK.

3rd Introduction to distributed file

system.
10th 1st Critical Section Problems,
Semaphores
2nd Methods for handling
deadlocks
3rd Deadlock Avoidance & detection
ASSIGNMENT-3
11th 1st Deadlock recovery.

2nd I/O Hardware, Application

Interface
3rd Kernel, Transforming I/O requests
12th 1st Introduction of the
Performance Issues
concept of Shell
2nd Scripting.
Unix system call
3rd Unix system call
th
13 1st Shell interpreter

8|P a g e
Session: 2019–20

2nd Windows architecture

3rd Windows file system.
14th 1st Revision of Syllabus Decision and Iterative
2nd Revision of Syllabus Statements in Shell
Scripting.
ASSIGNMENT -4
3rd Revision of Syllabus
15th 1st Revision of Syllabus Writing the Shall Scripts
for unknown problems
2nd Revision of Syllabus
3rd Revision of Syllabus

9|P a g e
Session: 2019–20

OPERATING SYSTEM PCC-CSE-206G

B.Tech 4th SEMESTER

IMPORTANT TOPICS OF OPERATING SYSTEM

SECTION-A SECTION-B SECTION-C SECTION-D

1. Operating System 1. Process scheduling 1. Different types of 1. Unix system call
Concepts files and their access
2 CPU scheduling methods 2. Windows
2. Types of architecture
Operating 3. Paging and 2. Disk scheduling
Systems Segmentation 3. Windows file
techniques 3. Distributed file system
system
3. Operating system
4. Demand Paging
services
4 Critical Section
5. Page-Replacement Problems
4. System calls.
Algorithms
5. Deadlock

10|P a g e
Session: 2019–20

B.Tech, 4th Semester

ASSIGNMENT -1

OPERATING SYSTEM PCC-CSE-206G

Topics Covered: Introduction to Operating System Concepts, types of O.S., System

Calls ,System programs

Date of issue: Date of Submission:

Q1. What is Operating System? Explain its functions.

Q2. Explain different types of O.S.
Q3. Differentiate between Multiprogramming, Multithreading and Multitasking
Q4. Differentiate between Distributed and Network O.S.
Q5. Define System calls and system programs?
Q6. What is Real time operating system? Explain its functions.

Prepared By: : Mr.NEERAJ KUMAR

11|P a g e
Session: 2019–20

B.Tech. Computer Science and Engineering, 4th Semester

ASSIGNMENT -2

OPERATING SYSTEM PCC-CSE-206G

Date of issue: Date of Submission:
Q1. What do you mean by process and explain state transition diagram of process?
Q2. What do you mean by CPU scheduling? Explain different types of scheduling algorithms?
Q3. For the following table draw the chart and calculate average turn around and waiting time:
a) FCFS
b) SJF
c) Priority Scheduling

Process Arrival time Burst time Process no

P1 0.0 6 2
P2 0.5 4 1
P3 1.0 2 3

Q4. Consider the 3 processes, P1, P2 and P3 shown in the table.

Process Arrival time Time Units Required
P1 0 5
P2 1 7
P3 3 4
The completion order of the 3 processes under the policies FCFS and RR2 (round robin
scheduling with CPU quantum of 2 time units) are calculate waiting time

Q5. Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival
times and execution times for the following processes calculate waiting time
Process Execution time Arrival time
P1 20 0
P2 25 15
P3 10 30
P4 15 45

Prepared By: Mr.NEERAJ KUMAR

12|P a g e
Session: 2019–20

B.Tech. Computer Science and Engineering, 4th Semester

ASSIGNMENT -3

OPERATING SYSTEM PCC-CSE-206G

Topics Covered: Page-Replacement Algorithms, Different types of files and their access
methods, Disk scheduling

Date of issue: Date of Submission:

Q1. What id Demand paging? Explain in detail.

Q2. What do you need page replacement algorithms explain all of them?
Q3 Consider the following String
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
How many page faults occurs
a) FIFO
b) LRU
4 Frames are given.
Q4. What is a file define all attributes and define different access method?
Q5. Explain all IPC problems.
Q6. Explain Deadlock in detail.

Prepared By: Mr.NEERAJ KUMAR

13|P a g e
Session: 2019–20

B.Tech. Computer Science and Engineering, 4th Semester

ASSIGNMENT -4

OPERATING SYSTEM PCC-CSE-206G

Topics Covered: . Unix system call .,Windows architecture, Windows file system

Date of issue: Date of Submission:

Q1. Write a note on unix and its various command ?

Q2. Discuss Window architecture and its file system?
Q3. Write a note on unix file system?
Q4. Explain Shell interpreter and Explain some of its basic commands.
Q5. What is Shell Scripting and how does it work?
Q6. What are Boot-block, Bad blocks?

Prepared By: Mr.NEERAJ KUMAR

14|P a g e
Session: 2019–20

PREVIOUS YEAR QUESTION PAPERS

Question Paper 1 (2018):

15|P a g e
Session: 2019–20

16|P a g e
Session: 2019–20

Question Paper 2 (2017):

17|P a g e
Session: 2019–20

18|P a g e
Session: 2019–20

Question Paper 3(2016):

19|P a g e
Session: 2019–20

20|P a g e
Session: 2019–20

MONTHLY REPORT MONTH/YEAR:

SUBJECT :

Name & Designation of Faculty: - …………………………………………………………

Period of Record:-………………………………………………………………………….

Sessions:-…………………………………………………………………………………..

Classes actually taken:-…………………………………………………………………….

Reasons for any discrepancy:-……………………………………………………………..

Substitute Classes taken (if any):-…………………………………………………………..

Assignments:-……………………………………………………………………………...

Number of Assignments / Exercises:-……………………………………………………...

(Class & Home):-…………………………………………………………………………...

Studies discussed:-…………………………………………………………………………

Quizzes administered:-……………………………………………………………………..

Projects:-…………………………………………………………………………………...

Project Guidance &Evaluation:-…………………………………………………………..

Issued By Verified by HOD

21|P a g e
Session: 2019–20

REGISTRAR DIRECTOR
STUDENT FEED BACK FORM (Session 2019-2020)

The form should be assessed strictly in confidence.

PROGRAMME SEMESTER SECTION
SUBJECT
NAME OF FACULTY
How do you rate the teaching in the above subject? Please tick (√)
All aspects (as applicable)

1. Contents Coverage (As Per Syllabus and Lecture Outline) 1 2 3 4 5

2. Teaching Methodology 1 2 3 4 5
3. Use of Audio/Visual AIDS (OHP, LCD Projector etc.) 1 2 3 4 5
4. Encouragement for Class Participation 1 2 3 4 5
5. Projects/Assignments/Practical’s 1 2 3 4 5
6. Class Presentation 1 2 3 4 5
7. Case Discussions in Class 1 2 3 4 5
8. Class Quizzes 1 2 3 4 5

OVER ALL RATING

1 2 3 4 5
Needs Improvement Average Good Very Good Excellent

IN CASE OF “NEEDS IMPROVEMENTS” GIVE SPECIFIC SUGGESTIONS FOR EACH SUCH

ITEM:

22|P a g e
Session: 2019–20

B.TECH, 4th Semester

OPERATING SYSTEM PCC-CSE-206G

TIME TABLE

Day/Lecture 9:30- 10:30- 11:30- 1:00- 2:00-

10:30 11:30 12:30 L 2:00 3:00
Monday

Tuesday U

Wednesday N
Thursday
C
Friday
H
Saturday

23|P a g e