Scribd
Upload
45 views

A15ad Operating Systems

The document is an exam paper for an Operating Systems course. It contains two parts - Part A with short answer questions and Part B with longer answer questions. Part A contains 10 short questions on topics like time-sharing systems, memory hierarchy, context switching, scheduling techniques, resources, deadlocks, logical vs physical addresses, and disk scheduling algorithms. Part B contains 5 longer questions with sub-questions on topics like system calls, process states, concurrency, scheduling algorithms, deadlocks, disk access, paging, and file allocation methods.

Uploaded by

Shashank
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

A15ad Operating Systems

The document is an exam paper for an Operating Systems course. It contains two parts - Part A with short answer questions and Part B with longer answer questions. Part A contains 10 short questions on topics like time-sharing systems, memory hierarchy, context switching, scheduling techniques, resources, deadlocks, logical vs physical addresses, and disk scheduling algorithms. Part B contains 5 longer questions with sub-questions on topics like system calls, process states, concurrency, scheduling algorithms, deadlocks, disk access, paging, and file allocation methods.

Uploaded by

Shashank
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code No: A15AD R 14

BVRAJU INSTITUTE OF TECHNOLOGY , NARSAPUR


(UGC - AUTONOMOUS)
B.Tech III Year I Semester Supplementary Examinations, November 2017
OPERATING SYSTEMS
(Common to CSE & IT)
Time: 3 Hours Max Marks: 70
Note: This Question Paper contains two Parts A and B
Part A is compulsory which carries 20 marks. Answer all questions in Part A at one place only.
Part B Consists of 10 questions. Answer any five (one full question from each unit). Each question
carries10 marks and may have a, b, c as sub questions.
PART – A (10x2 = 20 Marks)
1. a) Define time-sharing systems?
b) List the memory hierarchy available in operating system?
c) Describe context switching?
d) Distinguish between preemptive and non-preemptive scheduling techniques?
e) Define resource. List some resources that a process might need for its execution?
f) Describe the conditions under which a deadlock situation may arise?
g) Distinguish between logical address and physical address?
h) List various disk-scheduling algorithms?
i) Describe file system mounting?
h) Write any four file operations?
PART – B (5x10 = 50 Marks)
2. Explain how operating system services are provided by system calls? [10]
OR
3. Define process state and explain the various states of a process? [10]
***
4. Explain the principles of concurrency and the execution of concurrent processes with a simple example? [10]
OR
5. State and explain the following scheduling algorithms with examples [5][5]
a. Priority b. Round Robin
***
6. Define deadlock? What are the four conditions necessary for a deadlock situation to arise? How it can be
prevented? [10]
OR
7. State and explain the methods involved in recovery from deadlocks? [10]
. ***
8. Explain the following in detail with respect to disk?
a)Seek time [3]
b) Latency [2]
c)Access time [3]
d) Transfer time [2]
OR
9. Explain paging and page table with an example. [10]
***
10. Explain in detail various file allocation methods [10]
OR
11. Discuss in detail indexed file and indexed sequential file organization? [10]
***

You might also like