Scribd
Upload
325 views3 pages

B.tech Operating System (PCC-CS-403)

This document appears to be an exam for an operating systems course. It contains multiple choice and short answer questions about topics like context switching, deadlocks, paging, scheduling algorithms, file systems and device management. The questions ask students to explain, define, compare and differentiate various OS concepts.

Uploaded by

Himanshu Jain
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
325 views3 pages

B.tech Operating System (PCC-CS-403)

This document appears to be an exam for an operating systems course. It contains multiple choice and short answer questions about topics like context switching, deadlocks, paging, scheduling algorithms, file systems and device management. The questions ask students to explain, define, compare and differentiate various OS concepts.

Uploaded by

Himanshu Jain
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/ 3

Roll No.

Total Pages 3

301403
May, 2019
B. TECH(CEAT/CSE) 4th semester
Operating System (PCC-Cs-403)
Time 3 Hours] [Max.Marks: 75

Instructions
1. It is compulsory to answer all the questions (1.5 marks
each) of Part-A in short.
2. Answer any four questions from Part-B in detail.
3. Diferent sub-parts of a question are to be attempted
adjacent to each other

PART-A
1. (a) Explain context switching. (1.5)
b Briefly explain the necessary conditions for
Deadlock to occur. (1.5)
() Explain briefly External fragmentation and its
solution. (1.5)
(d) Briefly explain the file operations. (1.5)
e) Differentiate Paging and Segmentation. (1.5)
Differentiate between Pre-emptive and Non-preemptive
scheduling. (1.5)

301403/870/111/32 [PTO.
21/5
Differentiate between multitasking and multi

programming. (1.5)
(h) Define batch processing. (1.5)
CPU and IO Burst cycle with suitable
) Explain
diagram. (1.5)
State and explain operations on processes. (1.5)

PART-B

2. (a) What is meant by CPU scheduling? Explain different


scheduling algorithms with examples. (10)
(b) Solve the following problem by using following
scheduling algorithms

Process Burst Time


27
2 6

3 3

) FCFS
(i) SJF
(ii) Round Robin. (5)

between long term and


3.
3. (a) Define Scheduler. Compare
short-term scheduler. (5)
b) Differentiate between the following terms
Contiguous and Linked allocation.
(i) Linked and Indexed allocation. (10)
301403/870/111/32 2
4. There are 200 cylinders numbered from 0-199 the disk
head stars at number 100. Find
23, 89, 132, 42, 187
) C-Scan
() FCFS
(i) SSTRF
Civ) LOOK

(v) C-LOOK. (15)

5. (a) What is the cause thrashing? Discuss the page


of
replacement algorithms. (5)
What are the different methods for handling
(b)
Deadlocks? Explain Deadlock prevention and
Deadlock avoidance. (10)

file system structure and its allocations


6. (a) Explain
methods.
(7h)
the File
Explain with the help of necessary diagrams
(b)
implementation. (72)
System and Directory

of device management. Compare


.
7. (a) Explain techniques
shared and virtual device.
model of file system. Compare logical
(b)Explain general
and physical file system.
(15)
file system

301403/870/111/32 3

You might also like