BSc CSIT (TU) Science Operating System (BSc CSIT, CSC259) Question Paper 2080
This is the official BSc CSIT (TU) (Science stream) Operating System (BSc CSIT, CSC259) question paper for 2080, 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 2080 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Consider the following processes with their arrival and burst times. Compute the average waiting time and turnaround time for FCFS, SJF (preemptive/SRTN), and Round Robin (quantum = 2) scheduling algorithms.
What is a deadlock? Explain the four necessary conditions for deadlock and describe deadlock avoidance using the Banker's algorithm with an example.
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.
Section B: Short Answer Questions
Attempt any EIGHT questions.
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.
What is spooling? Explain with an example.
What is an operating system? List its main functions.
Differentiate between multiprogramming and multitasking.
Explain the difference between a process and a program.
What is a system call? Explain its types.
Distinguish between starvation and deadlock.