Download PTU (I.K.Gujral Punjab Technical University (IKGPTU)) B-Tech (Bachelor of Technology) (CSE-IT)- Computer Science Engineering -Information Technology 2020 December 4th Sem 77628 Operating Systems Previous Question Paper
Roll No.
Total No. of Pages : 02
Total No. of Questions : 18
B.Tech. (CSE) (2018 Ba tch) (Sem.?4)
OPERATING SYSTEMS
Subject Code : BTCS-402-18
M.Code : 77628
Time : 3 Hrs. Max. Marks : 60
INST RUCT IONS T O CANDIDAT ES :
1 .
SECT ION-A is COMPULSORY cons is ting of TEN questions carrying TWO marks
each.
2 .
SECT ION-B c ontains F IVE questions c arrying FIVE marks eac h and s tud ents
have to atte mpt any FOUR q ues tions.
3 .
SECT ION-C contains THREE questions carrying T EN marks e ach and s tudents
have to atte mpt any T WO questio ns.
SECTION-A
Write briefly :
1.
Difference between Time Sharing and Multiprogramming.
2.
FORK system call is used for?
3.
What are four necessary conditions for deadlock to occur?
4.
What is Inter Process Communication?
5.
What is Multilevel Queue Scheduling?
6.
Define Critical Section in Process Synchronization.
7.
What is Thrashing?
8.
Define Process Control Block.
9.
List some page replacement algorithms.
10. What is Boot Block?
SECTION-B
11. What is a Semaphore? Explain busy waiting semaphores.
12. Define Deadlocks. Explain different methods of deadlock handling.
1 | M-77628
(S2)-440
13. Compare paging with segmentation with respect to the amount of memory required by the
address translation structures in order to convert virtual addresses to physical addresses.
14. What is Disk Scheduling? Explain the following types of disk scheduling by giving an
example :
a. SCAN
b. C-SCAN Scheduling
15. What is Distributed Operating System? Explain main issues in designing distributed
operating system.
SECTION-C
16. Discuss Preemptive and Non-preemptive CPU Scheduling algorithms. Assume you have
the following jobs to execute with one processor, with the jobs arriving in the order listed
here :
i
T(pi)
0
80
1
20
2
10
3
20
4
50
a. Suppose a system uses FCFS scheduling. Create a Gantt chart illustrating the execution
of these processes?
b. What is the turnaround time for process p3?
c. What is the average wait time for the processes?
17. What do you mean by Virtual Memory? Why it is needed? Discuss the hardware support
required by the operating system to implement the virtual memory concept.
18. Write a Short note on :
a. Dinning Philosophers problem
b. Bad block vs. Boot Block in Disk Scheduling.
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any
page of Answer Sheet will lead to UMC against the Student.
2 | M-77628
(S2)-440
This post was last modified on 13 February 2021