Operating Systems Course File

COURSE
OPERATING SYSTEMS
COURSE FILE
Department of Computer Science& Engineering

Sreyas Institute of Engineering & Technology
Tattiannaram, Hyderabad.
2018-19
MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

COURSE DESCRIPTION
Faculty Name PADMA JOSHI,SHILPA RANI

Designation Asst. Prof.,CSE
Department CSE
Batch 2017-21
Academic Year 2018-19
Year & Semester II-II
Section A,B,C,D
Course title OPERATING SYSTEMS

Course code CS403ES
Regulation R16
Course Duration 16 weeks
Lectures Tutorials Practical Credits
Course structure
4 1 3 4+2
Domain Lead Dr. Purushottam
Team of instructors Mrs. Padma Joshi Mrs. Shilpa Rani
Prerequisites Graduation Level Credits Periods/Week

UG 4 5
Evaluation Scheme:
S.No Component Duration Marks
1 I - mid exam Descriptive – answer any 2 of 4 – (10) 80 Min 20
Objective –answer all 20 Questions–
(10)
2 I - Assignment - 05
3 II - Mid exam Descriptive – answer any 2 of 4 – (10) 80 Min 20
Objective –answer all – (10)
4 II - Assignment - 5
5 External exam 3 Hours 75
Attainment target for the academic CO1-T CO2-T CO3-T CO4-T CO5-T CO6-T
semester : 2.25 1.85 1.93 1.83 1.88 1.75

INDEX
CONTENTS OF COURSE FILE
S.NO TITLE REMARKS
1 Vision & Mission statements of Institute / Department/PEOs

2 Academic Calendar
3 Syllabus
4 Text books & Reference books/ WEB/ Journals/ Beyond Gaps
5 POs & PSOs
6 Course Objectives, Course Outcomes, CO-PO Mapping
7 Time Table
8 Course schedule
9 Course Plan
10 Mid Question papers with key
11 Tutorial Questions with solutions
12 Assignment Questions with answers
13 Guest Lectures/Seminar/ & Field Visits
14 Schedule for Tutorial / Remedial / Special Classes
15 List of Weak students
16 Course Review
17 Course Completion Certificate
18 Course material
19 Question bank (descriptive, objective)
20 Mid question papers (PDF)
21 Mid marks consolidation sheets
22 Answer script samples
23 Previous question papers
24 Co attainment sheet

VISION & MISSION
Institute Vision :
To be a centre of excellence in technical education to empower the

young talent through quality education and innovative engineering for
well being of the society.
Institute Mission :
1. Provide quality education with innovative methodology and

Intellectual human capital.
2. Provide conductive environment for research and developmental
activities.
3. Inculcate holistic approach towards nature, society and human
ethics with lifelong learning attitude.
Department Vision :
To excel in computer science engineering education with best

learning practices, research and professional ethics.
Department Mission:
1. To offer technical education with innovative teaching, good

infrastructure and qualified human resources.
2. Accomplish a process to advance knowledge in the subject
and promote academic and research environment.
 To impart moral and ethical values and interpersonal skills to
the students
Programme Educational Objectives :
PEO1: Graduates will be empowered with strong fundamental

concepts, analytical capability, programming and problem solving
skills.
PEO2: Graduates will be employed or may pursue higher education
or undertake research.
PEO3: Graduates will lead in their profession with integrity and civic
responsibility and a continuous learning attitude.

ACADEMIC CALENDAR

SYLLABUS
L T P C
OPERATING SYSTEMS 4 1 0 4
Overview-Introduction-Operating system objectives, User view, System view, Operating

system definition ,Computer System Organization, Computer System Architecture, OS
Structure, OS Operations, Process Management, Memory Management, Storage
Management, Protection and Security, Computing Environments.Operating System
services, User and OS Interface, System Calls, Types of System Calls, System Programs,
UNIT-1
Operating System Design and Implementation, OS Structure.
Process and CPU Scheduling - Process concepts-The Process, Process State, Process
Control B ock, Threads, Process Scheduling-Scheduling Queues, Schedulers, Context
Switch, Operations on Processes, System calls-fork(),exec(),wait(),exit(), Interprocess
communication-ordinary pipes and named pipes in UnixProcess Scheduling-Basic
concepts, Scheduling Criteria, Scheduling algorithms, Multiple-Processor Scheduling,
Real-Time Scheduling, Thread scheduling, Linux scheduling and Windows
UNIT-2
scheduling.Process Synchronization, Background, The Critical Section Problem,

Peterson’s solution, Synchronization Hardware, Semaphores, Classic Problems of
Synchronization, Monitors, Synchronization in Linux and Windows.
Memory Management and Virtual Memory – Memory Management Strategies-

Background, Swapping, Contiguous Memory Allocation, Segmentation, Paging,
Structure of Page Table, IA-32 Segmentation, IA-32 Paging.Virtual Memory
Management-Background, Demand Paging, Copy-on-Write, Page Replacement, Page
Replacement Algorithms, Allocation of Frames, Thrashing, Virtual memory in
UNIT-3
Windows
Storage Management-File System- Concept of a File, System calls for file ope ations -
open (), read (), write (), close (), seek (), unlink (), Access methods, Direct ry and
Disk St uctu e, File System Mounting, File Sharing, Protection.
File System Implementation - File System Structure, File System Implementation,
Directory Implementation, Allocation methods, Free-space Management, Efficiency,
and Performance. Mass Storage Structure – Overview of Mass Storage Structure,
UNIT-4
Disk Structure, Disk Attachment, Disk Scheduling, Disk Management, Swap space
Management.
Deadlocks - System Model, Deadlock Characterization, Methods for Handling

Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and
Recovery from Deadlock.Protection – System Protection, Goals of Protection,
Principles of Protection, Domain of Protection, Access Matrix, Implementation of
UNIT-5
Systems, Language-Based Protection

SYLLABUS

TEXT/REF/WEB/JOURNALS /BEYOND SYLLABUS/GAPS
S.NO. TEXT BOOKS PUBLICATION

1 Operating System Concepts , Abraham Silberschatz, India Edition
Peter B. Galvin, Greg Gagne, 9th Edition, Wiley,
2016
2 Operating Systems – Internals and Design Principles, Pearson.

W. Stallings, 7th Edition
S.NO. REF BOOKS PUBLICATION

1 Modern Operating Systems, Andrew S Tanenbaum, 3rd PHI
Edition
2 Operating Systems: A concept-based Approach, 2nd TMH.

Edition, D.M. Dhamdhere
3 Principles of Operating systems, Naresh Chauhan, Oxford University

Press
4 Principles of Operating Systems, B. L. Stuart. Cengage learning,
India Edition.
5 An Introduction to Operating Systems, P.C.P. Bhatt PHI
S.N WEB LINK

O.
1 http://osxdaily.com/category/mac-os-x/
2 https://en.wikipedia.org/wiki/Operating_system
3 https://www.tutorialspoint.com/computer_fundamentals/
computer_operating_system.htm
4 https://www.geeksforgeeks.org/operating-systems-need-and-functions/
S.NO. JOURNAL
1 Journal of Operating Systems Development & Trends (JoOSDT)
2
3
S.NO. TOPICS BEYOND SYLLABUS

1.
2.
3.
S.NO. GAPS IN CURRICULUM

TEXT/REF/WEB/JOURNALS /BEYOND SYLLABUS/GAPS

POs & PSOs
Program Outcomes
Engineering Knowledge: Apply the knowledge of mathematics, science,
PO 1 engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.
Problem analysis: Identify, formulate, review research literature, and analyze
PO 2 complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified
PO 3
needs with appropriate consideration for the public health and safety, and the
cultural, societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge
PO 4 and research methods including design of experiments, analysis and interpretation
of data, and synthesis of the information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources,
PO 5 and modern engineering and IT tools including prediction and modeling to
complex engineering activities with an understanding of the limitations.
The engineer and society: Apply reasoning informed by the contextual
PO 6 knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.
Environment and sustainability: Understand the impact of the professional
PO 7 engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
Ethics: Apply ethical principles and commit to professional ethics and
PO 8
responsibilities and norms of the engineering practice.
Individual and team work: Function effectively as an individual, and as a
PO 9
member or leader in diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities
with the engineering community and with society at large, such as, being able to
PO 10
comprehend and write effective reports and design documentation, make effective
presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of
the engineering and management principles and apply these to one’s own work, as
PO 11
a member and leader in a team, to manage projects and in multidisciplinary
environments.
Life-long learning: Recognize the need for, and have the preparation and ability
PO 12 to engage in independent and life-long learning in the broadest context of
technological change.
Program specific outcomes
Learn the fundamental concepts and methodology of computer

PSO1 system and apply them to various areas such as operating system,
data structure, computer network, databases in the design and
implementation of complex system.
The ability to employ modern computer programming languages,
PSO2 tools and platform to address technological challenges in
multidisciplinary areas of engineering.

C_OBJ, CO, CO_PO MAPPING
CS303ES Course Objectives
A To understand the OS role in the overall computer system.

B To study the operations performed by OS as a resource manager.
C To understand the scheduling policies of OS.
D To understand the different memory management techniques.
E Introduce system call interface for file and process management To understand the
concepts of input/output, storage and file management.
F To understand the goals and principles of protection.
CS303ES Course Outcomes
1 Understand optimization techniques for the improvement of system performance.

(TL1)
2 Understand and implement synchronization and CPU scheduling algorithms(TL2)
3 Illustrate different Memory Management Techniques(TL3)
4 Generating different page replacement algorithms(TL3)
5 Designing File system Structure and implement different Disk scheduling
Algorithms(TL3)
6 Distinguish between Deadlock Prevention, Avoidance and Recovery from
Deadlock(TL4)
COURSE OBJECTIVES
COs PROGRAM OUTCOMES (POs) PSOs
A B C D E F 1 2 3 4 5 6 7 8 9 10 11 12 I II
CO1 1 1 2 1 2 - - - - - - 2 2 2
CO2 1 2 1 2 2 - - - - - - 1 2 2
CO3 2 2 1 1 1 - - - - - - 2 2 1
CO4 2 1 1 2 2 - - - - - - 2 2 2
CO5 1 1 1 2 2 - - - - - - 2 2 2
CO6 1 2 1 2 1 - - - - - - 2 2 1

COURSE SCHEDULE
SEC- A 1 2 3 4 5 6 7
OS LAB OS
MON
OS
TUE L
U
WED N
OS C OS LAB
THU H
OS
FRI
OS
SAT
SEC- B 1 2 3 4 5 6 7
OS LAB
MON
OS
TUE L
OS U
WED N
OS LAB C OS
THU H
OS
FRI
OS
SAT
SEC- C 1 2 3 4 5 6 7
OS
MON
TUE L
OS U OS LAB
WED N
OS C
THU H
OS LAB
FRI
OS OS
SAT
SEC- D 1 2 3 4 5 6 7
OS
MON
OS
TUE L
OS LAB U OS
WED N
C OS
THU H
OS OS LAB
FRI
SAT

COURSE SCHEDULE
II_CSE_A Section Schedule

Unit Total No.
Description From To
No Periods
1 I Operating system introduction 27/12/18 22/1/19 14
2 II Process and cpu scheduling 24/1/19 15/2/19 16
Memory management and virtual
3 III 16/2/19 07/3/19 11
memory
File system interface,Mass storage
4 IV 08/3/19 28/3/19 13
structure
5 V Deadlocks , protection 29/3/19 20/4/19 14
II_CSE_B Section Schedule
Unit Total No.
S.No Description From To
No Periods

3 III 01/3/19 16/3/19 11
memory
4 IV 19/3/19 05/3/19 13
structure
II_CSE_C Section Schedule
Unit Total No.
No Periods

3 III 16/2/19 02/3/19 11
memory
4 IV 02/3/19 22/3/19 13
structure
II_CSE_D Section Schedule
Unit Total No.
No Periods
3 III 28/2/19 15/3/19 11
memory
4 IV 18/3/19 03/3/19 13
structure
Faculty Domain Lead HOD Principa

COURSE PLAN
SECTION-ALecture
Week
Planned
Topic date
Actual date
1 Unit-I Operating System Introduction 27/12/18

2 Operating systems objectives and functions
Week 1
28/12/18
Unit 1
3 Computer system Architecture 29/12/18

4 Os structure, Os operations 3/1/19
5 Process Management, Memory Management 4/1/19
6 StorageManagement, Protection and Security 5/1/19
Week 2
Unit 1
7 Computing Environments. 7/1/19

8 Operating system services, user Os interface 8/1/19
9 System calls, types of system calls 10/1/19
10 system programs 17/1/19
11 Os design and implementations 18/1/19
Week 3
Unit 1
12 Os structure 19/1/19
13 pipes 21/1/19
14 The process, process state, process control block 22/1/19
15 Threads 24/1/19
16 Scheduling queues 25/1/19
Week 4
Unit 2
17 scheduler 28/1/19
18 context switch 29/1/19
operations on process System calls-
19 30/1/19
fork(),exec(),wait(),exit()
20 Interprocess communication 31/1/19
21 ordinary pipes and named pipes in Unix. 1/2/19
Week 5
Process scheduling scheduling criteria 2/2/19

Unit 2
22
23 Scheduling algorithms 4/2/19
Multiple-processor scheduling, Real time
24 5/2/19
scheduling, thread scheduling
25 Scheduling in Linux, windows 7/2/19

Week 6
Unit 2
Process synchronization, The critical section

26 8/2/19
problem
27 Peterson’s solution 9/2/19
28 Synchronization hardware 11/2/19
29 Semaphores ,monitor 12/2/19
30 classical problems of synchronization 14/2/19
31 Synchronization in Linux, windows 15/2/19
Week 7
Unit-2
32 Logical & physical address space 16/2/19

33 Swapping 22/2/19
34 contiguous allocation, Paging 23/2/19
35 structure of page table, IA-32 Paging. 25/2/19
36 Segmentation, IA-32 Segmentation
Week 8
26/2/19
Unit 3
37 virtual memory, demand paging 28/2/19

38 Performance of demanding paging 1/3/19
39 Page replacement algorithms 2/3/19

COURSE PLAN
Lecture
Week
Unit
Planned
Topic date
Actual date
40 Allocation of frames, Thrashing 5/3/19
41 virtual memory in windows 7/3/19

Week 9
Unit 3
The concept of the file, System calls for file

42 operations – open ,read, write (), close (), seek 8/3/19
(), unlink (),
43 access methods 11/3/19
44 Directory structure, file system mounting 12/3/19
45 file sharing, Protection 14/3/19
File system structure File System
Week 10
46 15/3/19
Unit 4
Implementation,
47 Directory implementation 16/3/19
48 Allocation methods 18/3/19
49 efficiency and performance 19/3/19
50 Free-space Management 22/3/19
Week 11
51 Overview of mass storage structure 23/3/19

Unit 4
52 Disk structure, dist attachment 25/3/19

53 Disk scheduling, 26/3/19
54 disk management 27/3/19
55 Swap space management 28/3/19
Week 12
56 System model, deadlock characterization 29/3/19

Unit 4
57 Methods of handling deadlocks 30/3/19

58 Deadlock prevention, deadlock avoidance 30/3/19
59 Deadlock detection 1/4/19
60 Deadlock recovery 2/4/19
Week 13
61 System protection, goal of protection 4/4/19

Unit 5
62 Principles of protection 5/4/19

63 Domain of protection, 6/4/19
64 access matrix implementation 8/4/19
65 Access control, 9/4/19
Unit 5
revocation of access rights

Week
66 11/4/19
67 Capability-Based Systems 12/4/19
68 Language-Based Protection 15/4/19
69 Revision 16/4/19
Week 15
Unit 5
70 Revision 18/4/19
71 Revision 20/4/19

COURSE PLAN
SECTION-B Lecture
Week
Planned
Topic date
Actual date

2 Operating systems objectives and functions
Week 1
28/12/18
Unit 1

4 OS structure, Os operations 02/01/19
6 Storage Management, Protection and Security 04/01/19
Week 2
Unit 1
8 Revision 8/1/19
11 Revision 19/1/19
Week 3
Unit 1
13 OS design and implementations 23/1/19

14 OS structure 24/1/19
15 pipes 25/1/19
17 Threads 30/1/19
Week 4
Unit 2

21 6/2/19
Interposes communication
Week 5
22 7/2/19
Unit 2
8/2/19
23 Ordinary pipes and named pipes in Unix.
24 Process scheduling criteria 12/2/19
25 revision 13/2/19

27 15/2/19
Week 6
Unit 2

29 21/2/19
problem
Week 7
Unit-2

36 Swapping 2/3/19
Week 8
Unit 3

39 Segmentation, IA-32 Segmentation 7/3/19

COURSE PLAN
Lecture
Week
Unit
Planned
Topic date
Actual date
41 Performance of demanding paging 12/3/19

42 Page replacement algorithms 13/3/19
Week 9
Unit 3
43 Allocation of frames, Thrashing 14/3/19
44 virtual memory in windows 15/3/19

45 revision 16/3/19
46 operations – open ,read, write (), close (), seek 19/3/19
Week 10
(), unlink (),

Unit 4
47 access methods 20/3/19

48 Directory structure, file system mounting 22/3/19
49 file sharing, Protection 23/3/19
50 revision 26/3/19
51 27/3/19
Implementation,
Week 11
Unit 4
52 Directory implementation 28/3/19

53 Allocation methods 29/3/19
54 Free-space Management 30/3/19
55 Overview of mass storage structure 2/4/19
56 Disk structure, dist attachment 3/4/19
Week 12
57 Disk scheduling, disk management 4/4/19

Unit 4
58 Swap space management 5/4/19

59 System model, deadlock characterization 6/4/19
60 Methods of handling deadlocks 9/4/19
61 Deadlock prevention, deadlock avoidance 10/4/19
Deadlock detection, Deadlock recovery
Week 13
62 11/4/19
Unit 5
63 System protection, goal of protection 12/4/19

64 Principles of protection, Domain of protection, 16/4/19
65 access matrix implementation 17/4/19
66 Access control, revocation of access rights 18/4/19
Week
Unit
67 Capability-Based Systems 19/4/19

68 Language-Based Protection 20/4/19

COURSE PLAN
SECTION -C Lecture
Week
Unit
Planned
Topic date
Actual date
1 Unit-I Operating System Introduction 27-12-2018

2 Operating systems objectives and functions 29-12-2018
Week 1
Unit 1
3 Computer system Architecture 29-12-2018

4 Os structure, Os operations 2-1-2019
5 Process Management, Memory Management 03-1-2019
6 StorageManagement, Protection and Security 05-1-2019
7 Computing Environments. 05-1-2019
Week 2
Unit 1
8 Operating system services, user Os interface 07-1-2019

9 System calls, types of system calls 09-12-2019
10 system programs 10-12-2019
11 Os design and implementations 16-1-2019
12 Os structure 17-1-2019
Week 3
Unit 1
13 pipes 19-1-2019
14 The process, process state, process control block 19-1-2019
15 Threads 21-1-2019
16 Scheduling queues 23-1-2019
17 scheduler 24-1-2019
Week 4
Unit 2
18 context switch 25-1-2019

19 28-1-2019
20 Interprocess communication 30-1-2019
21 ordinary pipes and named pipes in Unix. 31-1-2019
22 Process scheduling scheduling criteria 1-2-2019
23 Scheduling algorithms 2-2-2019
Week 5
Unit 2
2-2-2019
24
25 Scheduling in Linux, windows 4-2-2019

26 6-2-2019
problem
Week 6
Unit 2
27 Peterson’s solution 7-2-2019

28 Synchronization hardware 8-2-2019
29 Semaphores ,monitor 11-2-2019
30 classical problems of synchronization 13-2-2019
31 Synchronization in Linux, windows 15-2-2019
32 Logical & physical address space 16-2-2019
Week 7
Unit-2
33 Swapping 16-2-2019
34 contiguous allocation, Paging 22-2-2019
35 structure of page table, IA-32 Paging. 23-2-2019
36 Segmentation, IA-32 Segmentation 23-2-2019
37 virtual memory, demand paging 25-2-2019
Week 8
Unit 3
38 Performance of demanding paging 27-2-2019

39 Page replacement algorithms 28-2-2019
40 Allocation of frames, Thrashing 1-3-2019

COURSE PLAN
Lecture
Week
Unit
Planned
Topic date
Actual date
41 virtual memory in windows 2-3-2019

2-3-2019
Week 9
42 operations – open ,read, write (), close (), seek

Unit 3
(), unlink (),

43 access methods 6-3-2019
44 Directory structure, file system mounting 7-3-2019
45 file sharing, Protection 8-3-2019
46 8-2-2019
Implementation,
Week 10
Unit 4
47 Directory implementation 11-3-2019

48 Allocation methods 13-3-2019
49 efficiency and performance 14-3-2019
50 Free-space Management 15-3-2019
51 Overview of mass storage structure 16-3-2019
Week 11
52 Disk structure, dist attachment 16-3-2019

Unit 4
53 Disk scheduling, 18-3-2019

54 disk management 20-3-2019
55 Swap space management 22-3-2019
56 System model, deadlock characterization 23-3-2019
57 Methods of handling deadlocks 25-3-2019
Week 12
Deadlock prevention, deadlock avoidance 27-3-2019

Unit 4
58
59 Deadlock detection 28-3-2019
60 Deadlock recovery 29-3-2019
61 System protection, goal of protection 30-3-2019
Week 13
62 Principles of protection 1-4-2019

Unit 5
63 Domain of protection, 3-4-2019

64 access matrix implementation 5-4-2019
65 Access control, 8-4-2019
66 revocation of access rights 11-4-2019
W Week 14
67 Capability-Based Systems 12-4-2019

Unit 5
68 Language-Based Protection 15-4-2019

69 Revision 18-4-2019
70 Revision 20-4-2019
U
71 Revision 20-4-2019

COURSE PLAN
SECTION-D
Lecture
Week
Planned
Topic Actual date
date

2 Operating systems objectives and functions 27/12/18
Week 1
Unit 1

4 Os structure, Os operations 31/1/19
6 StorageManagement, Protection and Security 03/1/19
Week 2
Unit 1
8 Revision 07/1/19
11 Revision 18/1/19
Week 3
Unit 1
13 Os design and implementations 22/1/19

14 Os structure 23/1/19
15 pipes 24/1/19
17 Threads 28/1/19
Week 4
Unit 2

21 1/2/19
Week 5
Unit 2
22 Interprocess communication 4/2/19

23 ordinary pipes and named pipes in Unix. 5/2/19
24 Process scheduling scheduling criteria 6/2/19
25 revision 7/2/19

Week 6
27 11/2/19
Unit 2

29 13/2/19
problem
Week 7
Unit-2

36 Swapping 1/3/19
Week 8
Unit 3

39 Segmentation, IA-32 Segmentation 7/3/19

MID QUESTION PAPERS WITH KEY
S.No. MID – I Question Paper

1.a Define system programs? State and explain the types of system programs?
1.b What are the criteria of CPU scheduling Algorithm? Consider following set of process
and apply preemptive shortest job first scheduling algorithm and find :
I. Turnaround time II. Waiting time
Process Burst Priority
Time
P1 2 1
P2 5 0
P3 2 2
P4 6 3
1.c What is the external fragmentation? In which memory management technique it occurs?
Explain the solution for it?
2.a Define os goals from user’s view and system’s view?
2.b Illustrate semaphore method for process synchronization?
2.c Describe briefly the memory protection in contiguous memory allocation?
3.a Explain types of system calls? Explain with example how system calls are used?
3.b Describe reader writer problem? Device an algorithm to solve the problem using
semaphores?
3.c Explain the contiguous memory allocation?

4.a State the main advantage of the microkernel approach to system design? What are the
disadvantages of using the microkernel approach?
4.b Explain race condition and critical section problem with the help of Example. Provide n
no. of process solutions for critical section.
4.c Explain how physical address generated with diagram?
S.No. MID – II Question Paper

1.a Describe the following Directory Implementation methods?
I) Linear List II) Hash Table

MID QUESTION PAPERS WITH KEY
1.b Define deadlock? What are the four conditions necessary for a deadlock situation to arise?
how it can be prevented
1.c Explain briefly the performance of demand paging with necessary examples?
2.a Explain the following file concepts:
I) File attributes II) File operations III) File types
2.b Consider the following snapshot of a system and Answer the following questions using the
banker’s algorithm:
I) What is the content of matrix “Need”?

II) Is the system in a safe state?
III) If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted
immediately?
2.c Consider the following page reference string 7,0,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0

Assuming three frames, how many page faults would occur in the following case?
a) LRU ,Note that initially all frames are empty
3.a Explain File system implementation.
3.b Discuss the access matrix implementation techniques?
3.c Explain the concept of thrashing and why thrashing should be avoided in a system?
4.a Consider that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently
serving request at cylinder 2150, and the previous request was at cylinder 1805. The queue
of pending requests, in FIFO order, is:
2069,1212,2296,2800,544,1618,356,1523,4965,3681. Starting from the current head
position, what is the total distance (in
Cylinders) that the disk arm moves to satisfy all pending requests for each of the following
disk scheduling algorithms?
A. FCFS B. SSTF C. SCAN
D. C-SCAN E. LOOK F. C-LOOK
4.b Explain the following.
I) Goals of protection II) Principles of protection
4.c Explain allocation of frames in memeory

TUTORIAL QUESTIONS WITH SOLUTION
S.No. Tutorial - I
1 Define operating system. What are the goals of operating system?
2 Explain various OS structure with example.
3 What is the critical section problem .explain semaphore solution.
4 Explain Inter process communication with example.
5 What is swapping? Explain with the help of neat Diagram.
S.No. Tutorial - II
1 Explain Demand Paging.
2 Explain Fragmentation with example.
3 Explain File system and its implementation.
4 Explain Bankers algorithm with example.
5 Explain the concept of access matrix.

ASSIGNMENT QUESTIONS WITH ANSWERS
S.No. Assignment - I
1 Define operating system. Explain computer architecture details.
2 Define system calls. Discuss types of system calls.
3 Explain various states in a process state transition diagram.
4 What are the criteria for CPU scheduling algorithms?
5 What is the critical section problem .explain semaphore solution?
S.No. Assignment - II
1 Differentiate internal and external fragmentation.
2 What is paging. what is the purpose of page table in paging techniques.
3 Define thrashing. Explain available methods to avoid thrashing.
4 Define deadlock? What are the four conditions necessary for a deadlock situation
to arise? how it can be prevented .

GUEST LECTURES / SEMINARS / FIELD VISITS
Guest Lectures
No. of
Date Resource person Organization Topic Students
Attended
Seminars
No. of
Date Resource person Organization Topic Students
Attended
Industry /Field Visits
No. of
Organization /
Date Place of visit Coordinator Students
field
Attended

REMEDIAL/SPECIAL CLASSES
Date Period No. of Students Attended Theory/ Test

LIST OF WEAK STUDENTS
MID-I
SECTION-A
S.No Hall Ticket No. Name

1 16VE1A0517 Devanaboyina Sri Vishnu
2 16VE1A0533 Kuppala Jayanth
3 17UJ1A0522 T Ashish Sai
4 17VE1A0503 Anagandula Hima Sri
5 17VE1A0504 Annam Jahnavi
6 17VE1A0505 Apura Suvarsha
7 17VE1A0506 Arrella Karthik
8 17VE1A0514 Chintala Shivani
9 17VE1A0519 G Keerthi
10 17VE1A0522 Gattu Archana
11 17VE1A0524 Inti Vaishnavi
12 17VE1A0534 Kovela Shruthi
13 17VE1A0535 Lingala Sravani
14 17VE1A0538 Mallekedi Sai Priya
15 17VE1A0540 Mekala Akanksha
16 17VE1A0541 Mekala Sharanya
17 17VE1A0543 Nagam Anil
18 17VE1A0548 Pothireddy Chennakeshava Reddy
19 17VE1A0549 Pulikanti Dheeraj
20 17VE1A0559 Vepachettu Abhilash


SECTION-B

1 17VE1A0561 Akkenapally Sandeep
2 17VE1A0562 Akunoori Mahesh
3 17VE1A0564 Amboore Akshay
4 17VE1A0567 Bantu Lalith Raju
5 17VE1A0568 Batthula Ajay Kumar
6 17VE1A0570 Bukka Jaswanth Sai
7 17VE1A0571 C Tarun Raj
8 17VE1A0572 Challa Sai Charan Reddy
9 17VE1A0573 Challa Sai Vamshi Krishna
10 17VE1A0576 Elakurthyi Sai Santoshi
11 17VE1A0577 G V Abhishek Kumar
12 17VE1A0578 G Vishal Rao
13 17VE1A0581 Gutha Ajith Reddy
14 17VE1A0582 Jella Uday Kiran
15 17VE1A0583 Jois Narasimhamurthy Abhinav
16 17VE1A0585 Kalidindi Pragnya
17 17VE1A0586 Kandregula Sai Jayasurya
18 17VE1A0587 Kankipati Sai Meghana
19 17VE1A05A1 N Sai Pranav
20 17VE1A05B1 Rachakonda Pavan Chari

SECTION-C

1 17VE1A05C3 B Shiva
2 17VE1A05C4 B Vivek Kumar
3 17VE1A05F2 Motor Chethansai
4 16VE1A05L8 Kantimahanthi Yashwanth
5 17VE1A05F9 Neerati Vinay
6 17VE1A05G0 P Akhil
7 17VE1A05G3 Peruri Sravani Durga
8 17VE1A05G7 Shadrach Martin
9 17VE1A05G9 T Rahul
10 17VE1A05H0 Thadisina Vinay Kumar Reddy
11 17VE1A05H1 Thaneti Rohit
12 17VE1A05H7 Varkala Upendra Simha Charan
13 17VE1A05J0 Vivek Gangji
SECTION-D
S.no Hall ticket no. Name

1 17VE1A05K6 Gajji karthik yadav
2 17VE1A05K7 Garlapati sparrshitha
3 17VE1A05K8 Gouni ritika
4 17VE1A05L7 Md suleman
5 17VE1A05L8 Mohd faiyazuddin arsalan
6 18VE5A0509 Ayyala rufus reynolds
7 18VE5A0511 Devanandi santhosh kumar
18VE5A0514 Jellala krishna kumar
8 18VE5A0515 Medapalli durga ravi kumar

MID II
SECTION -D
1 16VE1A05L8 Kantimahanthi Yashwanth
2 16VE1A05P7 Siddamsetty Shashank
3 17VE1A05L7 Md Suleman
4 17VE1A05M9 Rachakonda Susheel Kumar
5 17VE1A05N3 Sappidi Rishika Reddy
6 17VE1A05N9 Thatiparthi Manikanta Reddy
7 18VE5A0520 NAMPALLY SNEHA

COURSE ATTAINMENT - ACTION PROPOSED
CS303ES Course Outcomes
CO 1 Understand optimization techniques for the improvement of system

performance. (TL1)
CO 2 Understand and implement synchronization and CPU scheduling
algorithms(TL2)
CO 3 Illustrate different Memory Management Techniques(TL3)
CO 4 Generating different page replacement algorithms(TL3)
CO 5 Designing File system Structure and implement different Disk scheduling
Algorithms(TL3)
CO 6 Distinguish between Deadlock Prevention, Avoidance and Recovery from
Deadlock(TL4)
CO s Course Attainment (%) Course Attainment
CO 1 2.75 1.75
CO 2 2.75 1.66
CO 3 2.75 1.68
CO 4 2.75 1.63
CO 5 2.75 1.66
CO 6 2.75 1.63
Co Attainment : 1.67
% ge >60% >50% >40%

Level 3 2 1

COURSE REVIEW
S.No Date of Review Remarks Signature

COURSE COMPLETION CERTIFICATE
Course Completion Certificate
I Padma Joshi faculty in the Dept of Computer Science & Engineering

has completed entire syllabus and the course work for the subject OS of II year I
Semester, for the academic year 2018-19.
Signature of the faculty
This is to certify that Mrs. Padma Joshi had completed the syllabus
and course work for the allocated subject OS of II year I semester for the academic year
2018-19.
Remarks :
HOD
Principal

COURSE COMPLETION CERTIFICATE
Course Completion Certificate
I Shilpa Rani faculty in the Dept of Computer Science & Engineering has
completed entire syllabus and the course work for the subject OS of II year II Semester, for
the academic year 2018-19.
Signature of the faculty
This is to certify that Mrs. Shilpa Rani had completed the syllabus and
course work for the allocated subject OS of II year II semester for the academic year 2018-
19.
Remarks:
HOD
Principal

Operating Systems Course File

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Operating Systems Course File

Uploaded by

Copyright:

Available Formats

COURSE

Department of Computer Science& Engineering

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

Faculty Name PADMA JOSHI,SHILPA RANI

Course title OPERATING SYSTEMS

Prerequisites Graduation Level Credits Periods/Week

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

CONTENTS OF COURSE FILE

S.NO TITLE REMARKS

1 Vision & Mission statements of Institute / Department/PEOs

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

To be a centre of excellence in technical education to empower the

1. Provide quality education with innovative methodology and

To excel in computer science engineering education with best

1. To offer technical education with innovative teaching, good

Programme Educational Objectives :

PEO1: Graduates will be empowered with strong fundamental

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

Overview-Introduction-Operating system objectives, User view, System view, Operating

Operating System Design and Implementation, OS Structure.

scheduling.Process Synchronization, Background, The Critical Section Problem,

Memory Management and Virtual Memory – Memory Management Strategies-

Deadlocks - System Model, Deadlock Characterization, Methods for Handling

Systems, Language-Based Protection

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

S.NO. TEXT BOOKS PUBLICATION

2 Operating Systems – Internals and Design Principles, Pearson.

S.NO. REF BOOKS PUBLICATION

2 Operating Systems: A concept-based Approach, 2nd TMH.

3 Principles of Operating systems, Naresh Chauhan, Oxford University

5 An Introduction to Operating Systems, P.C.P. Bhatt PHI

S.N WEB LINK

S.NO. TOPICS BEYOND SYLLABUS

S.NO. GAPS IN CURRICULUM

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

Program specific outcomes

Learn the fundamental concepts and methodology of computer

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

CS303ES Course Objectives

A To understand the OS role in the overall computer system.

CS303ES Course Outcomes

1 Understand optimization techniques for the improvement of system performance.

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

II_CSE_A Section Schedule

2 II Process and cpu scheduling 29/01/19 15/2/19 16

2 II Process and cpu scheduling 19/1/19 15/2/19 16

Faculty Domain Lead HOD Principa

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

1 Unit-I Operating System Introduction 27/12/18

3 Computer system Architecture 29/12/18

7 Computing Environments. 7/1/19

Process scheduling scheduling criteria 2/2/19

25 Scheduling in Linux, windows 7/2/19

Process synchronization, The critical section

32 Logical & physical address space 16/2/19

37 virtual memory, demand paging 28/2/19

MATHEMATICAL FOUNDATION FOR COMPUTER SCIENCE II II YEAR – I SEM CSE

40 Allocation of frames, Thrashing 5/3/19

41 virtual memory in windows 7/3/19