BSc CSIT (TU) Science Operating System (BSc CSIT, CSC259) Question Paper 2077
This is the official BSc CSIT (TU) (Science stream) Operating System (BSc CSIT, CSC259) question paper for 2077, as set in the regular annual examination. It carries 60 full marks and a time allowance of 180 minutes, across 12 questions. On Kekkei you can attempt this Operating System (BSc CSIT, CSC259) past paper online with a timer, get instant AI feedback and step-by-step solutions, and track the topics where you lose marks — completely free. Whether you are revising for your BSc CSIT (TU) Operating System (BSc CSIT, CSC259) exam or solving previous years' question papers, this 2077 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Explain paging as a memory management technique. Discuss how logical addresses are translated to physical addresses using a page table and TLB.
What is virtual memory? Explain demand paging and compare the FIFO, Optimal, and LRU page replacement algorithms with a reference string example.
Explain various disk scheduling algorithms (FCFS, SSTF, SCAN, C-SCAN, LOOK) with a suitable example and compute the total head movement.
Section B: Short Answer Questions
Attempt any EIGHT questions.
What is thrashing? How can it be prevented?
Differentiate between logical and physical address space.
Explain segmentation as a memory management scheme.
What is a semaphore? Differentiate between binary and counting semaphores.
Explain the concept of a monitor in process synchronization.
Differentiate between preemptive and non-preemptive scheduling.
What is RAID? Explain any two RAID levels.
Explain the directory structure of a file system.
Can deadlock occur in the case of preemptive resources? List the conditions for deadlock.