BSc CSIT (TU) Science Operating System (BSc CSIT, CSC259) Question Paper 2075
This is the official BSc CSIT (TU) (Science stream) Operating System (BSc CSIT, CSC259) question paper for 2075, 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 2075 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
What is a resource allocation graph? Explain the process of detecting deadlock when there is a single instance of each resource type with a suitable example.
Explain the Critical Section problem. Describe Peterson's solution and the use of semaphores to achieve process synchronization.
Explain paging as a memory management technique. Discuss how logical addresses are translated to physical addresses using a page table and TLB.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Distinguish between starvation and deadlock.
Explain context switching and its overhead.
What is the producer-consumer problem? Explain in brief.
Explain the Dining Philosophers problem.
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.