INFORMATION TECHNOLOGY

CODE COURSE NAME CATEGORY L T P CREDIT

ITT303 OPERATING SYSTEM CONCEPTS PCC 3 1 0 4

Preamble: Operating System Concepts is a graduate-level introductory course in operating systems.

This course teaches the basic operating system functions, abstractions, mechanisms, and their
implementations. The course is split into five modules: (1) Introduction to OS, (2) Process
Management, (3) Process Synchronization, (4) Memory Management and (5) Storage Management.

Prerequisite: ITT204 Computer Organization

Course Outcomes: After the completion of the course the student will be able to
CO No. Course Outcome (CO) Bloom’s Category
CO 1 Explain the concepts and functionality of operating Level 2: Understand
systems.
CO 2 Describe the concepts of process management and Level 3: Apply
process synchronization and apply them to solve
problems.
CO 3 Illustrate deadlock and deadlock – prevention and Level 3: Apply
avoidance techniques.
CO 4 Illustrate the memory management techniques. Level 3: Apply

CO 5 Explain the file system and its implementation Level 2: Understand

CO 6 Use the disk scheduling algorithms to solve problems. Level 3: Apply

Mapping of course outcomes with program outcomes 3/2/1: High/Medium/Low

PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO 1 3 1 1 2

CO 2 3 3 3 2 1 2

CO 3 3 3 3 2 1 2

CO 4 3 3 3 2 1 2

CO 5 3 2 2 1 2

CO 6 3 3 3 2 1 2

Downloaded from Ktunotes.in

 INFORMATION TECHNOLOGY

Assessment Pattern

Bloom’s Category Continuous Assessment End Semester Examination

Tests
1 2
Remember 5 5 10
Understand 20 20 40
Apply 25 25 50
Analyse
Evaluate
Create

Mark distribution

Total CIE ESE ESE

Marks Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test (2 numbers) : 25 marks
Assignment/Quiz/Course project : 15 marks

End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contain
10 questions with 2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of which student should
answer any one. Each question can have maximum 2 sub-divisions and carry 14marks.

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Describe the basic functions of operating system.

2. Illustrate the various types of operating system.

3. Explain the types of System Calls.

Downloaded from Ktunotes.in

 INFORMATION TECHNOLOGY

Course Outcome 2 (CO2):

1.Describe the process state with suitable diagram.

2. Consider the following set of processes with CPU burst given in seconds.

Process CPU Burst

P1 20
P2 4
P3 6
P4 4
i. Draw the Gantt chart for FCFS and Round Robin (Time quantum=4s).

ii. What is the average waiting time for each of the scheduling algorithm?

3. Explain the fields in a process control block. What is the use of PCB in context switching?

Course Outcome 3 (CO3):

1. Explain deadlocks detection techniques.

2. Describe deadlock and necessary conditions for deadlocks.

3. Develop the program for Banker’s algorithm.

4. Does a cycle in a resource allocation graph indicate a deadlock situation? Justify your answer.

5. Demonstrate the use of Peterson’s solution to the critical section problem.

Course Outcome 4 (CO4):

1. Explain internal fragmentation and external fragmentation with suitable diagrams.

2. Illustrate paging and segmentation with suitable diagram.

3. Consider the following page reference 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 would occur for the following replacement algorithms, assuming three
frames? What happens when four frames are used? All frames are initially empty, so your first
pages will all cost one fault each (i) LRU replacement (ii)FIFO.

Downloaded from Ktunotes.in

 INFORMATION TECHNOLOGY

Course Outcome 5 (CO5):

1. Illustrate the File Attributes & File Operations.

2. Identify the different File Access methods.

3. Illustrate the various Directory structures.

Course Outcome 6 (CO6):

1. Explain the various Disk scheduling algorithms.

2. Consider a disk containing 200 cylinders. At a certain point of time the disk head is at cylinder 55
and the disk queue contains request for I/O to blocks on cylinders 58, 39, 150, 180, 65, 75, 88, 110,
100,130. Find out the total head movement with respect to FCFS, SSTF, SCAN, C-SCAN and LOOK
scheduling.

3. How would you select a disk scheduling algorithm?

Model Question paper

Course Code: ITT303

Course Name: Operating System Concepts
Max.Marks:100 Duration: 3 Hours

PART A

Answer all Questions. Each question carries 3 Marks

1. What is an operating system? State and explain the basic functions of operating
system?

2. Differentiate between hard real-time systems and soft real-time systems. Give 2
examples of each.

3. Explain five state process models with a neat diagram.

4. Compare long term scheduling and short term scheduling.

5. What is a deadlock? What are the necessary conditions for a deadlock to occur?

Downloaded from Ktunotes.in

 INFORMATION TECHNOLOGY

6. Explain the concept of safe and unsafe state in the context of deadlock avoidance.

7. Differentiate between external fragmentation and internal fragmentation.

8. What is Translation Look Aside Buffer (Associative Memory)? What is the need for
TLB?

9. List out the different operations that can be performed by a file system.

10. What is Direct memory access technique and how it is advantageous in performing
I/O?
(10x3=30)
Part B
Answer any one Question from each module. Each question carries 14 Marks

11. (a) Explain the various types of system calls with an example for each. (10)

(b) Explain the execution of a system call. (4)

OR
12. (a) Explain in detail about the OS structure. (10)

(b)What are shells? Give examples. (4)

13. (a) What is context switching? What are all the factors affecting context (6)
switching time?

(b) Explain any two preemptive CPU scheduling algorithms with example. (8)

OR
14. (a) What are the functions of a dispatcher? (6)

(b) Explain the structure of PCB. (8)

15. (a) What are the strategies for recovering from deadlock? Write the merits (10)
and demerits of each.

(b) Explain how dead lock can be prevented in a system. (4)

OR

Downloaded from Ktunotes.in

 INFORMATION TECHNOLOGY

16. (a) Explain how resource allocation graphs can be used to detect deadlock. (6)

(b) Explain Bankers algorithm for dead lock avoidance with multiple resources of (8)
each type.

17. (a) Describe the following memory allocation algorithms. (6)

i) First-fit
ii) Best–fit
iii)Worst –fit

(b) Explain paging memory management techniques. (8)

OR
18. (a) Explain how segmentation with paging is implemented. (8)

(b) What is virtual memory? How is it implemented? (6)

19. (a) How directories are implemented? (6)

(b) Explain the different types of directory structures. (8)

OR
20. (a) Describe various file access methods. (4)

(b) Illustrate the disk scheduling algorithms. (10)

(14x5=70)

Downloaded from Ktunotes.in

 INFORMATION TECHNOLOGY

Syllabus

Module 1 (7 hours)

Operating Systems: Introduction, Functions of OS, Types of OS (Batch, Multi programmed,

Time-sharing and Real time systems) –System calls – System Programs –– System structure
(Simple structure, Layered approach, Microkernel system structure, Modules)– Kernel, Shell.

Module 2 (11 hours)

Process Management: Process concept, Process State, PCB, Operations on processes,

Multithreading-Benefits.
Process Scheduling: Basic concepts, Preemptive Scheduling, Dispatcher, Scheduling criteria,
Scheduling Algorithms (FCFS, SJF, Priority scheduling, Round Robin Scheduling, Multi level
queue scheduling, Multi level feedback queue scheduling).
Inter process communication (Shared memory, message passing, pipes and socket).

Module 3 (11 hours)

Process Synchronization: Race Conditions - Critical Sections – Mutual Exclusion - Busy Waiting
- Sleep and Wakeup - Semaphores – Monitors (Introduction).
Deadlocks: Deadlock characteristics - conditions for deadlock - prevention – avoidance (Safe state,
Resource –Allocation Graph, Banker’s algorithm) - deadlock detection – recovery from dead lock.

Module 4 (10 hours)

Memory Management: Basics - Swapping -Memory Allocation (fixed partitions, variable

partitions) Fragmentation - Paging - Segmentation - Virtual memory concepts – Demand paging -
Page replacement algorithms (FIFO, Optimal, LRU) – Allocation of frames - Thrashing.

Module 5 (6 hours)

Storage Management:
File System: Introduction, File concept – File Attributes, File Operations, File Types, File structure-
File access methods (Sequential Access, Direct Access, Indexed Access)– File allocation methods
(Contiguous, linked and indexed allocation), Directory structure (Single-Level, Two-Level, Tree-
Structured, Acyclic Graph, General Graph)– Directory implementation (Linear list, Hash table).
Disk Management: Introduction, Disk Scheduling algorithms (FCFS, SSTF, SCAN, C-SCAN,
LOOK, C-LOOK)

Downloaded from Ktunotes.in

 INFORMATION TECHNOLOGY

Text Books

1. Andrew S. Tanenbaum and Herbert Bos, Modern Operating Systems, 4th edition, Pearson,
2015
2. A. Silberschatz, G.Gagne and P.Galvin, Operating System Concepts, 7th edition,
AddisonWesley, 2004.

Reference Books
1. D M Dhamdhere, “Operating Systems A Concept-based Approach”, Tata McGraw
Hill, New Delhi, 2nd Edition, 2010.
2. William Stallings, Operating Systems, 6th Edition, Pearson, 2009.
3. Garry Nutt, “Operating Systems – A Modern perspective”, Third Edition, Pearson
Education

Course Contents and Lecture Schedule

No Topic No. of
Lectures
1 Operating Systems (7 hours)
1.1 Introduction, Functions of OS 1 hour
1.2 Types of OS 2 hours
1.3 System calls 1 hour
1.4 System Programs 1 hour
1.5 System structure 1 hour
1.6 Kernel & Shell. 1 hour
2 Process Management (11 hours)
2.1 Process concept, Process State, PCB 2 hours
2.2 Operations on processes 1 hour
2.3 Multithreading-Benefits. 1 hour
2.4 Process Scheduling: Basic concepts 1 hour
2.5 Pre-emptive Scheduling, Dispatcher 1 hour
2.6 Scheduling criteria 1 hour
2.7 Scheduling Algorithms 3 hours
2.8 Inter process Communication 1 hours
3 Process Synchronization (11 hours)
3.1 Race Conditions - Critical Sections 1 hour
3.2 Mutual exclusion with busy waiting 2 hours
3.3 Sleep and Wakeup 1 hour
3.4 Semaphores, Monitors(introduction) 2 hours
3.5 Deadlocks: Deadlock characteristics, conditions for deadlock 1 hour
3.6 Deadlock prevention 1 hour
3.7 Deadlock avoidance 2 hours

Downloaded from Ktunotes.in

 INFORMATION TECHNOLOGY

3.8 Deadlock detection & recovery from dead lock. 1 hour

4 Memory Management (10 hours)
4.1 Basics - swapping 1 hour
4.2 Memory Allocation (fixed partitions, variable partitions), 1 hour
Fragmentation
4.3 Paging 2 hours
4.4 Segmentation 1 hour
4.5 Virtual memory concepts & demand paging 1 hour
4.6 Page replacement algorithms (FIFO, Optimal, LRU). 2 hours
4.7 Allocation of frames, Thrashing 2 hours
5 Storage Management (6 hours)
5.1 Introduction , File concept – File Attributes– File Operations, File 1 hours
Types, File structure
5.2 File access methods, File allocation methods 1 hour
5.3 Directory structure, Directory implementation 2 hours
5.4 Disk management: Introduction, Disk scheduling algorithms 2 hours

Downloaded from Ktunotes.in