Scribd
Upload
21 views2 pages

B.Tech Operating Systems Exam Guide

This document is an examination paper for B.Tech. (CSE) students focusing on Operating Systems, consisting of 18 questions divided into three sections. Section A is compulsory with 10 short answer questions, Section B has 5 questions where students must attempt 4, and Section C includes 3 questions requiring answers to 2. The exam lasts for 3 hours and is worth a total of 60 marks.

Uploaded by

manavkashyap819
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
21 views2 pages

B.Tech Operating Systems Exam Guide

This document is an examination paper for B.Tech. (CSE) students focusing on Operating Systems, consisting of 18 questions divided into three sections. Section A is compulsory with 10 short answer questions, Section B has 5 questions where students must attempt 4, and Section C includes 3 questions requiring answers to 2. The exam lasts for 3 hours and is worth a total of 60 marks.

Uploaded by

manavkashyap819
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

Roll No. Total No.

of Pages : 02
Total No. of Questions : 18
[Link]. (CSE) (2018 Ba tch) (Sem.–4)
OPERATING SYSTEMS
Subject Code : BTCS-402-18
[Link] : 77628
Time : 3 Hrs. Max. Marks : 60

INST RUCT IONS T O CANDIDAT ES :


1. SECTION-A is COMPULSORY cons is ting of TEN questions carrying TWO marks
each.
2. SECTION-B c ontains FIVE questions c arrying FIVE marks eac h and s tudents
have to atte mpt any FOUR ques tions.
3. SECTION-C contains THREE questions carrying TEN marks e ach and s tudents
have to atte mpt any TWO questions.

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

[Link]
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

[Link]

You might also like