5TH SEMESTER
MAKAUT
OPERATING SYSTEM SUGGESTION
<I>
DEBKANTA STUDYZONE
Overview
DEEKANTA STUDYZONE
Study Zone is a free learning platform created with the vision of helping every
Debkanta
student learn, grow,and succeed. It provides high-quality educational resources focused
on GATE preparation, placement skills, coding courses, MAKAUT notes, and varioUs
The goal of Debkanta Study Zone is simple-to make
education accessible for all students without any cost, while maintaining an
exam-oriented and practical approach to learning.
skill-based learning materials.
At Debkanta
Study Zone, we focus on providing direct, important, and commonly asked
questions that actually appear in exams.Our materials are designed to simplify difficult
and give students the right direction for their preparation. From clearing doubts
to offering topic-wise notes, GATE COUrses, and placement guidance, our team ensures
Concepts
that every learner gets complete support throughout their journey.
What makes Debkanta Study Zone unique is its Commitment to free education and real
results. Many students have already benefited from our content, achieving success in
exams.We continuOUsly update our materials and share the latest information to keep
students ahead in their studies.
--
The community is led by dedicated mentors Debkanta Maity (Owner), Soumaditya
Jamaddar (Admin), and Sumit Mondol (Admin) who work together to provide
personalized support
SOUMADITYA JAMADDAR
[DSZ ADMIN ]
962907 43390
and motivation to every learner.
DEBKANTA MAITY
[DSZ OWNER ]
98372021415
SUMIT MONDOL
[
DSZ ADMIN
990643 60237
)
MODULE - 5
Memory Allocation & Fragmentation
1. Distinguish between internal and external fragmentation with example.
2. What is fragmentation? Discuss the problem of fragmentation and how it can
be solved.
3. Explain first-fit, best-fit and worst-fit memory allocation algorithms with
examples & comparison.
4. Given memory partitions 100 KB, 500 KB, 200 KB, 300 KB & 600 KB, allocate
processes 212 KB, 417 KB, 112 KB & 426 KB using first-fit, best-fit & worst-fit.
Which uses memory most efficiently?
Segmentation & Paging
5. Explain segmentation with an example.
6. Explain paging with neat diagram and hardware support (relocation & limit
registers).
7. Distinguish between paging and segmentation.
8. Explain segmentation with paging. Why are they sometimes combined?
Page Table & TLB
9. Explain the structure of page table with diagram.
10. What is TLB? Explain how TLB improves performance with hardware diagram.
11. Calculate effective memory access time (EMAT) and explain its significance.
12. What is a hierarchical (multi-level) page table? State advantages &
disadvantages.
Virtual Memory & Demand Paging
13. What is virtual memory? How is it supported & implemented?
14. Explain demand paging in detail and how it affects system performance.
15. What is a page fault? Explain steps of page fault handling with diagram.
16. What is copy-on-write?
17. What is swap-in and swap-out?
Page Replacement Algorithms
18. Explain the Second Chance (SC) page replacement algorithm.
19. Write short notes on NRU & LRU page replacement algorithms.
20. What is Belady's anomaly?
21. Numerical – For page reference string 1,2,3,4,1,2,5,1,2,3,4,5, calculate page
faults using FIFO, Optimal & LRU for 3 and 4 frames.
22. Numerical – For page reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1,
calculate page faults using FIFO, Optimal & LRU for 3 and 4 frames.
Thrashing & Performance
23. What is thrashing? Its causes, detection and control mechanisms.
24. What is dynamic loading and dynamic linking? How are they related?
Contiguous Memory / DMA
25. What are the drawbacks of contiguous memory allocation?
26. What is DMA? Explain how DMA works and how it improves system
concurrency.
27. What is the difference between a page and a frame?