Back close

Course Detail

Course Name Operating Systems
Course Code 19EAC211
Program B. Tech. in Electronics and Computer Engineering
Semester 4
Year Taught 2019


Module I

Introduction to Operating Systems: Overview – Types of systems – Computer system operations – Hardware Protection – Operating systems services -System calls -System structure – Virtual machines. Process Management: Process concepts -Process scheduling – Operations on Process – Cooperating process – Interprocess communication – Multithreading models – Threading issues – Thread types – CPU scheduling –scheduling algorithms.

Module II

Process Synchronization: Critical section problem – synchronization hardware – Semaphores – Classical problems of synchronization – Critical regions – Monitors – Deadlocks – Deadlock characterization – Methods of handling deadlocks – Deadlock prevention – Avoidance – Detection and recovery.

Module III

Storage Management: Memory management – Swapping – Contiguous memory allocation. Paging – Segmentation -Segmentation with Paging – Virtual memory – Demand paging -Process creation – page replacement – Thrashing. File Systems: Directory structure – Directory implementation – Disk scheduling. Case study: Threading concepts in Operating systems, Kernel structures.

Objectives and Outcomes

Course Objectives

  • To make the students to understand the structure and implementation of modern operating systems, virtual machines and their applications.
  • To summarize techniques for achieving process synchronization and managing resources like memory and CPU in an operation system.
  • To compare and contrasts the common algorithms used for both pre-emptive and non-pre-emptive scheduling of tasks in operating systems (such a priority, performance comparison, and fair-share schemes).
  • To give a broad overview of memory hierarchy and the schemes used by the operating systems to manage storage requirements efficiently.

Course Outcomes

  • CO1: Understand the architecture and functionalities of modern OS.
  • CO2: Understand and apply the algorithms for scheduling.
  • CO3: Understand and apply the algorithms for resource management
  • CO4: Apply semaphores and monitors for classical and real-world synchronization scenarios

CO – PO Mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 1 2 3
CO2 2 2 3 1 2 3
CO3 2 2 3 1 2 3
CO4 2 3 3 1 2

Textbook / Reference


  • Silberschatz and Galvin, “Operating System Concepts”, Ninth Edition, John Wiley and Sons, 2012.


  • Deitel. Deitel and Choffnes, “Operating System”, Third edition, Prentice Hall, 2003.
  • Tannenbaum A S, “Modern Operating Systems”, Third edition, Prentice Hall, 2007.
  • Stevens W R and Rago S A, “Advanced Programming in the Unix Environment”, Second Edition, Addison-Wesley, 2008.
  • Gary Nutt, “Operating Systems”, Third Edition, Addison Wesley, 2009

Evaluation Pattern 50:50 (Internal: External)

Assessment Internal External
Periodical 1 (P1) 15
Periodical 2 (P2) 15
*Continuous Assessment (CA) 20
End Semester 50
*CA – Can be Quizzes, Assignment, Projects, and Reports.

DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.

Admissions Apply Now