Scribd
Upload
3 views

Operating System Theory syllabus

Uploaded by

Rohit Bathla
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Operating System Theory syllabus

Uploaded by

Rohit Bathla
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES

(Deemed to be University under section 3 of the UGC Act 1956)


NAAC 'A++' Grade University

BCS-DS-403: OPERATING SYSTEMS

Periods/week Credits Max. Marks : 200


L :3 T: 1 4.0 Continuous Evaluation :
100
Duration of Exam: 3 Hrs End Semester Evaluation: 100

Pre-Requisites: NIL
Course Type: Program Core

Course Outcomes: Students will be able to-


BCS-DS-403.1. Define the features of UNIX and Linux operating system to
conceptualize the components involved in designing a contemporary OS
BCS-DS-403.2. Understand the concepts of process, address space, file system and
system components that are used in working of operating system and
Compare various CPU scheduling algorithms.
BCS-DS-403.3. Apply various inter-process communication mechanism.
BCS-DS-403.4. Analyze how deadlock exists in the system and how to recover from it.
BCS-DS-403.5. Evaluate the performance of segmented and paged memories.
BCS-DS-403.6. Develop the I/O management functions in OS as part of a uniform
device abstraction by performing operations for synchronization between CPU
and I/O controllers.
PART - A
Unit 1: Introduction
1.1 Concept of Operating Systems, generations of operating systems, types of operating
systems, OS
services, system calls.
1.2 Structure of an OS – Layered, monolithic, microkernel operating systems.
1.3 Concept of virtual machine.
1.4 Case study on UNIX and WINDOWS operating system.

Unit 2: Processes
2.1 Definition, process relationship, different states of a process, process state
transitions,
Process Control Block (PCB), context switching.
2.2 Thread: Definition, various states, benefits of threads, types of threads, concept of
multithreads.
2.3 Process Scheduling: Foundation and scheduling objectives, types of schedulers.
2.4 Scheduling criteria: CPU utilization, throughput, turnaround time, waiting time,
response
time.
2.5 Scheduling algorithms: pre-emptive and non pre-emptive, FCFS, SJF, RR.
2.6 Multiprocessor scheduling: real time scheduling: RM and EDF.

Unit 3: Inter-process Communication


3.1 Critical section, race conditions, mutual exclusion.
3.2 Hardware solution, strict alternation, peterson’s solution, the producer\ consumer
problem.
3.3 Semaphores, event counters, monitors, message passing.
3.4 Classical IPC Problems: reader and writer problem, dining philosopher problem etc.
PART - B
Unit 4: Deadlocks
4.1 Definition, necessary and sufficient conditions for deadlock.
4.2 Deadlock prevention.
4.3 Deadlock avoidance: Banker’s algorithm.
4.4 Deadlock detection and recovery.

Unit 5: Memory Management


5.1 Basic concept, logical and physical address map.
5.2 Memory allocation: Contiguous memory allocation, fixed and variable partition,
internal and
external fragmentation and compaction.
5.3 Paging: principle of operation, page allocation, Hardware support for paging,
protection and
sharing, disadvantages of paging.
5.4 Virtual Memory: Basics of virtual memory, hardware and control structures.
5.5 Locality of reference, page fault , working set , dirty page/dirty bit, demand paging.
5.6 Page replacement algorithms: Optimal, First in First Out (FIFO), Second Chance (SC),
Not
Recently Used (NRU) and Least Recently Used (LRU).

Unit 6: I/O Hardware


6.1 I/O devices, device controllers, direct memory access.
6.2 Principles of I/O Software: Goals of interrupt handlers, device drivers, device
independent
I/O software.
6.3 Secondary-storage structure: Disk structure, disk scheduling algorithms.
6.4 File Management: Concept of file, access methods, file types, file operation, directory
structure, file system structure. Allocation methods (contiguous, linked, indexed),
free-space
management (bit vector, linked list, grouping), directory implementation (linear list,
hash
table), efficiency and performance.
6.5 Disk Management: Disk structure, disk scheduling - FCFS, SSTF, SCAN, C-SCAN, disk
reliability, disk formatting, boot-block, bad blocks.

Text Books/ Reference Books:


1. Avi Silberschatz, Peter Galvin, Greg Gagne, Operating System Concepts Essentials,
9th Edition,
Wiley Asia Student Edition.
2. William Stallings, Operating Systems: Internals and Design Principles, 5th Edition,
Prentice Hall of India.
Suggested reference books:
1. Charles Crowley Operating System: A Design-oriented Approach, 1st Edition, Irwin
Publishing
2. Gary J. Nutt, Operating Systems: A Modern Perspective, 2nd Edition, Addison-Wesley.
3. Maurice Bach, Design of the Unix Operating Systems, 8th Edition, Prentice-Hall of
India
4. Daniel P. Bovet, Marco Cesati, Understanding the Linux Kernel, 3rd Edition,
O'Reilly and
Associates

Instructions for paper setting:


Seven questions are to be set in total. First question will be conceptual covering entire
syllabus and will be compulsory to attempt. Three questions will be set from each PART-A
and PART-B (one from each unit). Student needs to attempt two questions out of three from
each part. Each question will be of 20 marks.

Distribution of Continuous Evaluation:


Sessional- I 30%
Sessional- II 30%
Assignment/Tutorial 20%
Class Work/
Performance 10%
Attendance 10%

Evaluation Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
End Semester Examination
Course Articulation Matrix:
CO P
PS PS
Statement PO PO PO PO PO PO PO PO PO PO PO PO S
O O
(BCS-DS- 1 2 3 4 5 6 7 8 9 10 11 12 O
1 3
403) 2
BCS-DS-
2 2 1 3 2 2 2 1 2 2 2 3 2 2 2
403.1
BCS-DS-
3 3 3 2 2 2 2 2 2 2 2 2 2 2 2
403.2
BCS-DS-
2 3 3 1 2 2 1 2 2 1 2 2 2 2 2
403.3
BCS-DS-
2 1 2 2 2 - 1 1 2 2 1 1 1 2 1
403.4
BCS-DS-
1 2 1 2 2 1 1 2 2 2 2 2 2 2 2
403.5
BCS-DS-
1 2 2 2 1 2 2 1 3 1 1 3 2 2 3
403.6

You might also like