Download PTU B-Tech CSE-IT 2020 Dec 4th Sem 77628 Operating Systems Question Paper

FirstRanker.com

Roll No. Total No. of Pages : 02
Total No. of Questions : 18

--- Content provided by FirstRanker.com ---

B.Tech. (CSE) (2018 Batch) (Sem.-4)
OPERATING SYSTEMS
Subject Code : BTCS-402-18
M.Code : 77628
Time : 3 Hrs. Max. Marks : 60

--- Content provided by FirstRanker.com ---

INSTRUCTIONS TO CANDIDATES :

1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.

SECTION-A

--- Content provided by FirstRanker.com ---

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?

--- Content provided by FirstRanker.com ---

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.

--- Content provided by FirstRanker.com ---

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.
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.

--- Content provided by FirstRanker.com ---

14. What is Disk Scheduling? Explain the following types of disk scheduling by giving an example :
    1. SCAN
    2. C-SCAN Scheduling
15. What is Distributed Operating System? Explain main issues in designing distributed operating system.

SECTION-C

--- Content provided by FirstRanker.com ---

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 :

    Process	Arrival Time	Burst Time
    P1	0	80
    P2	1	20
    P3	2	10
    P4	3	20
    P5	4	50

    1. Suppose a system uses FCFS scheduling. Create a Gantt chart illustrating the execution of these processes?
    2. What is the turnaround time for process p3?
    3. 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.

--- Content provided by FirstRanker.com ---

18. Write a Short note on :
    1. Dinning Philosophers problem
    2. 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.

FirstRanker.com

--- Content provided by FirstRanker.com ---