Department Events
OPERATING SYSTEMS
The course will enable the students to
- This module aims at making students learn about basic concepts of operating systems.
- Describe & discuss various operating system workings like process management, memory management, concepts of concurrency control and disk management.
Course Outcomes (COs):
Course Outcome (at course level) | Learning and teaching strategies | Assessment Strategies |
|---|---|---|
The students will: CO47. Categorize the key functions of an operating system and assess the evolution of operating systems from primitive batch systems to sophisticated multi-user systems. CO48. Examine the concept of process states and review different schdeuling algorithms for a given scenario. CO49. Analyze different memory management techniques and compare virtual memory and main memory CO50. Categorize the conditions that cause deadloacks and assess deadlock prevention strategies related to each condition of deadlock CO51. Assess the principal techniques for file organization, access and allocation. | Approach in teaching: Interactive Lectures, Discussion, Tutorials, Reading assignments, Demonstration,
Learning activities for the students: Self-learning assignments, Effective questions, Simulation, Seminar presentation, Giving tasks. | Class test, Semester end examinations, Quiz, Solving problems in tutorials, Assignments, Presentation |
What is an Operating System, Simple Batch Systems, Multiprogrammed Batched Systems, Time- Sharing Systems, Personal-Computer Systems, Parallel Systems, Distributed Systems, and Real- Time Systems.
Operating-System Structures: System Components, Operating System Services, System Calls, System Structure, Virtual Machines. Process Management: Process Concept, Process Scheduling, Operation on Processes.
CPU Scheduling: Basic Concepts, Scheduling Criteria.
CPU Scheduling Algorithms (FCFS, SJF, Priority, Round-Robin, Multilevel Queue, Multilevel Feedback Queue) Multiple-Processor Scheduling. Process Synchronization: Background, The Critical-Section Problem, Introduction to Semaphores. Deadlocks: System Model, Deadlock Characterization.
Deadlocks: Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock. Memory Management: Background, Logical versus Physical Address space, Swapping, Contiguous allocation (fragmentation), Paging, Segmentation.
Virtual Memory: Background, Demand Paging, Page Replacement, Page-replacement Algorithms (FIFO, Optimal, LRU, Counting). File Management: File Concepts (Operations & Attributes), Access Methods, Directory Structure, File System Structure, Allocation Methods (Contiguous Allocation, Linked Allocation, Indexed Allocation).
1. Avi Silberschatz, Greg Gagne, and Peter Baer Galvin, “Operating System Concepts”, Addison-Wiley, 6th Edition, 2014
2. Rohit Khurana,”Operating System”, Vikas Publication House Pvt. Ltd., 2013.
SUGGESTED READINGS
1. A. Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000
2. Madnick E., Donovan J., “Operating Systems”, Tata McGraw Hill, 2001.
3. Richard Fox,” Linux with Operating System Concepts”, CRC Press, 2021
E-RESOURCES:
1. Website: www.linux.org.
2. https://www.geeksforgeeks.org/last-minute-notes-operating-systems/
3. https://www.tutorialspoint.com/operating_system/os_overview.htm
4. https://mrcet.com/downloads/digital_notes/CSE/II%20Year/OPERATING%20SYSTEMS%20%20NOTES%20R18.pdf
JOURNALS:
1. https://epjdatascience.springeropen.com/
2. https://appliednetsci.springeropen.com/
3. https://www.tandfonline.com/journals/tjid20
4. https://www.igi-global.com/journal/international-journal-web-services-research/1079
