Syllabus

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

Maulana Abul Kalam Azad University of Technology, West Bengal

(Formerly West Bengal University of Technology)


Syllabus for B. Tech in Computer Science & Engineering
(Applicable from the academic session 2018-2019)

Operating Systems
Code: PCC-CS502
Contacts: 3L

Name of the Course: Operating Systems

Course Code: PCC-CS502 Semester: V


Duration: 6 months Maximum Marks:100
Teaching Scheme Examination Scheme

Theory:3 hrs./week Mid Semester exam: 15


Tutorial: NIL Assignment and Quiz: 10 marks
Attendance : 5 marks
Practical: hrs./week End Semester Exam :70 Marks
Credit Points: 3
Objective:
1 To learn the mechanisms of OS to handle processes and threads and their
communication
2 To learn the mechanisms involved in memory management in contemporary OS
3 To gain knowledge on distributed operating system concepts that includes architecture,
Mutual exclusion algorithms, deadlock detection algorithms and agreement protocols
4 To know the components and management aspects of concurrency management
Pre-Requisite:
1 Computer Organization &Architecture
Unit Content Hrs/U Marks/
nit Unit
Introduction: Concept of Operating Systems, 3
1 Generations of Operating systems, Types of
Operating Systems, OS Services, System Calls,
Structure of an OS - Layered, Monolithic,
Microkernel Operating Systems, Concept of Virtual
Machine. Case study on UNIX and WINDOWS
Operating System.
Processes: Definition, Process Relationship, Different 10
2 states of a Process, Process State transitions, Process
Control Block (PCB), Context switching
Thread: Definition, Various states, Benefits of threads,
Types of threads, Concept of multithreads,
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, RR;
Multiprocessor scheduling: Real Time scheduling: RM
and EDF.
Inter-process Communication: Critical Section, Race
3. Conditions, Mutual Exclusion, Hardware Solution, 5
Strict Alternation, Peterson’s Solution, The Producer
Consumer Problem, Semaphores, Event Counters,
Monitors, Message Passing, Classical IPC Problems:
Reader’s & Writer Problem, Dinning Philosopher
Problemetc.
4. Deadlocks: Definition, Necessary and sufficient 5
conditions for Deadlock, Deadlock Prevention,
Deadlock Avoidance: Banker’s algorithm, Deadlock
detection and Recovery.
5. Memory Management: Basic concept, Logical and 8
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), Second Chance
(SC), Not recently used (NRU) and Least Recently
used(LRU).

6. I/O Hardware: I/O devices, Device controllers, Direct 6


memory access Principles of I/O Software: Goals of
Interrupt handlers, Device drivers, Device independent
I/O software, Secondary-Storage Structure: Disk
structure, Disk scheduling algorithms
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 andperformance.
Disk Management: Disk structure, Disk scheduling -
FCFS, SSTF, SCAN, C-SCAN, Disk reliability, Disk
formatting, Boot-block, Bad blocks

Text book and Reference books:

1. Operating System Concepts Essentials, 9th Edition by AviSilberschatz,


Peter Galvin, Greg Gagne, Wiley Asia Student Edition.
2. Operating Systems: Internals and Design Principles, 5th Edition, William
Stallings, Prentice Hall of India.
3. Operating System Concepts, Ekta Walia, Khanna Publishing House
(AICTE Recommended Textbook – 2018)
4. Operating System: A Design-oriented Approach, 1st Edition by Charles
Crowley, Irwin Publishing
5. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-
Wesley
6. Design of the Unix Operating Systems, 8th Edition by Maurice Bach,
Prentice-Hall of India
7. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco
Cesati, O'Reilly and Associates

Course Outcomes:
On completion of the course students will be able to
1. Create processes and threads.
2. Develop algorithms for process scheduling for a given specification of
CPU utilization, Throughput, Turnaround Time, Waiting Time, Response
Time.
3. For a given specification of memory organization develop the techniques
for optimally allocating memory to processes by increasing memory
utilization and for improving the access time. Design and implement file
management system.
4. For a given I/O devices and OS (specify) 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.

You might also like