Scribd
Upload
62 views2 pages

PCC CS502

The document discusses operating system concepts like processes, scheduling algorithms, deadlocks, synchronization, and booting. It contains questions about process states, preemptive vs non-preemptive scheduling, spooling, mutual exclusion, segmentation vs paging, multi-level feedback scheduling, deadlock detection and avoidance, scheduling algorithms comparison, critical sections, monitors, shells vs kernels, forking, and orphan/zombie/daemon processes.

Uploaded by

Sagar Chakraborty
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views2 pages

PCC CS502

The document discusses operating system concepts like processes, scheduling algorithms, deadlocks, synchronization, and booting. It contains questions about process states, preemptive vs non-preemptive scheduling, spooling, mutual exclusion, segmentation vs paging, multi-level feedback scheduling, deadlock detection and avoidance, scheduling algorithms comparison, critical sections, monitors, shells vs kernels, forking, and orphan/zombie/daemon processes.

Uploaded by

Sagar Chakraborty
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CS/B.

TECH(N)/ODD/SEM-5/5507/2022-2023/I139

MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL


Paper Code : PCC-CS502 Operating Systems

Time Allotted : 3 Hours Full Marks :70


The Figures in the margin indicate full marks.
Candidate are required to give their answers in their own words as far as practicable

Group-A (Very Short Answer Type Question)

1. Answer any ten of the following : [ 1 x 10 = 10 ]


(I) The ___________ must design and program the overlay structure.
(II) If one or more devices use a common set of wires to communicate with the computer system, the connection is called
______
(III) ____ systems have more than one CPU in close communication with the others.
(IV) FIFO scheduling is _________________
(V) A situation where several processes access and manipulate the same data concurrently and the outcome of the
execution depends on the particular order in which access takes place is called ___________
(VI) A solution to the problem of external fragmentation is ____________
(VII) __________ will happen if a non-recursive mutex is locked more than once?
(VIII) Each entry in a translation lookaside buffer (TLB) consists of ____________
(IX) On systems where there are multiple operating system, the decision to load a particular one is done by _____________
(X) Trap is a ___________
(XI) ________ are the operations that can be invoked on a condition variable
(XII) Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly
___________

Group-B (Short Answer Type Question)


Answer any three of the following [ 5 x 3 = 15 ]

2. What is a process? With the help of a diagram, explain the different process states. [5]
3. Explain with example pre-emptive and non pre-emptive scheduling algorithms [5]
4. What is spooling? Compare SJF and SRTF. [5]
5. Prove Dekker-Peterson’s solution ensures mutual exclusion. [5]
6. Is segmentation possible without paging? Justify your answer. [5]

Group-C (Long Answer Type Question)


Answer any three of the following [ 15 x 3 = 45 ]

7. Explain multi level feedback scheduling. List the different criteria for scheduling algorithms. [ 5+5+5 ]
For the processes listed in the table, calculate the average turn around time and average waiting time, for RR
(quantum=2) and SRTF.

8. List down the methods of deadlock detection and deadlock avoidance. Explain how deadlock can be recovered [ 4+4+4+3 ]
through deadlock. What is livelock?
9. Make a comparative analysis of the various scheduling algorithms, How does synchronization and scheduling go [ 8+7 ]
hand in hand?
10. Define critical Section. Mention the mechanism to control access to critical section.Explain how use of monitors [ 3+4+8 ]
guarantees mutual exclusion.

1/2
11. Discuss about shell and kernel. Explain the process of booting. Explain forking. Discuss about orphan, zombie [ 4+2+3+6 ]
and daemon process.

*** END OF PAPER ***

2/2

You might also like