Name of the Course Instructor : Mr.C.Pravinkumar, AP/CSE, Mrs.P.Sabeena Burvin, AP/CSE
Year & Sem : II CSE A&B & IV Sem
Course Code & Name: CS3451- INTRODUCTION TO OPERATING SYSTEMS
Date of Exam: 24.03.2025
COURSE OUTCOMES:
At the end of the course the students will be able to
CO-1 Understand the basics and function of Operating System UN
CO-2 Analyze various scheduling algorithms, process synchronization and deadlock AP
algorithms
CO-3 Analyze various memory management schemes AP
CO-4 Explain the functionality of file systems and I/O systems UN
CO-5 Understand the concept of virtual machines and mobile OS UN
COURSE ASSESSMENT MATRIX
Course PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
Outco 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
mes
CO3 3 3 2 2 2 - - - - - 2 2 2 2 2
Unit III – First Half
PART-A
1) What is swapping in memory management? RE,CO3
2) Define contiguous memory allocation. RE,CO3
3) List two disadvantages of contiguous memory allocation. RE,CO3
4) What is internal fragmentation? UN,CO3
5) Distinguish between internal and external fragmentation. UN,CO3
6) What is paging? RE,CO3
7) Define page table and its purpose. RE,CO3
8) What is a frame in paging? UN,CO3
9) Differentiate between paging and segmentation. RE,CO3
10) Mention two advantages of segmentation over paging. UN,CO3
PART-B
Explain internal
1) and diagrams. and external fragmentation with suitable examples UN,CO3
Explain in detail about swapping and how it helps in memory
2) management. AN,CO3
i) Describe contiguous memory allocation strategies.(7) UN,CO3
3) ii)Discuss fixed and variable partitioning, fragmentation, and
solutions.(6)
i) Describe the paging technique in memory management.(7)
ii) Explain the structure of page table, address translation, and
4) advantages/disadvantages.(6) UN,CO3
Explain the steps involved in logical to physical address translation in
a paging system With a neat diagram. UN,CO3
5)
PART-C
1) Simulate different segmentation technique of memory management and AN,CO3
Include segment table format, logical-to-physical mapping, and benefits.
2) Illustrate different paging and segmentation in detail using advantages, AN,CO3
disadvantages, and suitable use-cases for each.
Unit III – Second Half
PART-A
1) What is virtual memory? RE,CO3
2) Define demand paging. RE,CO3
3) What is a page fault? UN,CO3
4) What is the purpose of the Copy-on-Write technique? RE,CO3
5) Mention any two page replacement algorithms. UN,CO3
6) State the basic principle of the FIFO page replacement algorithm. UN,CO3
7) What is the LRU algorithm based on? RE,CO3
8) Define thrashing in operating systems. RE,CO3
9) How can thrashing be prevented? RE,CO3
10) What is proportional frame allocation? UN,CO3
PART-B
1) i) Discuss in detail about page replacement algorithms (5)
ii)Explain FIFO, LRU, Optimal – with examples and performance UN,CO3
comparison. (8)
Explain virtual memory and how demand paging works with suitable
2) diagrams and examples. AN,CO3
UN,CO3
3) i)Describe thrashing in operating systems.(7)
ii)Compare LRU algorithm and FIFO page replacement algorithm with
their advantages and disadvantages.(6)
4) Explain page fault in detail and how a page fault is handled in an UN,CO3
operating system.
5) Explain Copy-on-Write (COW) and its implementation and usefulness
in process creation (e.g., fork() in UNIX). UN,CO3
PART-C
Construct the the Thrashing challenges in operating system and
1) Explain how thrashing occurs, its consequences, AN,CO3
and how it can be
prevented
2) Compare different frame allocation strategies and Explain equal,
proportional, and priority-based allocation methods.
AN,CO3
Course Instructor HOD/CSE
