Scribd
Upload
109 views2 pages

Bba 1003

This document is an exam for an Introduction to Operating Systems course. It contains 13 multiple choice and short answer questions across two sections. Section A contains 15 compulsory short answer questions about operating system functions, multiprocessing, process states, scheduling, deadlocks, and memory management. Section B contains 9 longer answer questions about operating system properties, process control blocks, scheduling criteria, busy waiting, deadlock avoidance techniques, process synchronization, memory management, and memory allocation algorithms. Students have 3 hours to complete the exam, which is worth a total of 75 marks.

Uploaded by

api-3782519
Copyright
© Attribution Non-Commercial (BY-NC)
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
109 views2 pages

Bba 1003

This document is an exam for an Introduction to Operating Systems course. It contains 13 multiple choice and short answer questions across two sections. Section A contains 15 compulsory short answer questions about operating system functions, multiprocessing, process states, scheduling, deadlocks, and memory management. Section B contains 9 longer answer questions about operating system properties, process control blocks, scheduling criteria, busy waiting, deadlock avoidance techniques, process synchronization, memory management, and memory allocation algorithms. Students have 3 hours to complete the exam, which is worth a total of 75 marks.

Uploaded by

api-3782519
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 2

Roll No........................

Total No. of Questions : 13] [Total No. of Pages : 02


J-3175[S-1031] [2037]
BBA (Semester - 5th / 6th)
INTRODUCTION TO OPERATING SYSTEM (BBA - 1003)

Time : 03 Hours Maximum Marks : 75

Instruction to Candidates:
1) Section - A is compulsory.
2) Attempt any Nine questions from section B.

Section - A
Q1) (15 x 2 = 30)
a) What are the functions of operating systems?
b) What is the advantage of multiprogramming?
c) What are the different states of a process?
d) What is the difference between long term scheduler and short term
scheduler?
e) Define convey effect in case of first come first scheduling.
f) In case of priority based scheduling why starvation has been occurred?
g) Give two examples which explain the concept of deadlock.
h) Why resource allocation graph has been used in case of deadlocks?
i) In timesharing systems what type of scheduling is used?
j) Define turn around time.
k) What is the difference between internal fragmentation and external
fragmentation?
l) Why the size of page is power of 2.
m) What is page fault?
n) How address translation and relocation is done in paging.
o) Why segmentation and paging are combined in one scheme?
P.T.O.
Section - B
(9x 5 = 45)
Q2) Explain properties of Batch, Timesharing, Real time, Parallel and Distributed
systems.

Q3) What is process control block? Explain construction completely.

Q4) What is scheduling criteria?

Q5) What is busy waiting? Can busy waiting be avoided, explain.

Q6) Is it possible to have a deadlock involving only one single process? Explain
your answer.

Q7) What is deadlock avoidance? Explain two techniques for deadlock avoidance.

Q8) Explain Bakery algorithm in process synchronization.

Q9) Explain the conditions to occur a deadlock.

Q10) Explain segmentation memory management technique in detail.

Q11) Explain differences between fixed partition and variable partition.

Q12) Explain different page replacement algorithms by taking examples.

Q13) Differentiate first fit, best fit and worst fit allocation algorithms.

J-3175[S-1031] 2

You might also like