DPG Institute of Technology and Management

Gurgaon, HR
Question Bank
Programme: B -Tech (Name of the programme)
Course Name: Operating System
Course Code: PCC-CSE-206
Blooms COs
Questions
Level

SECTION-A

Q1 Discuss operating system and list the basic services provided by 6 1

operating system.
Q2
Elaborate the following types of OS by defining their essential 6
properties. 1
a) Time sharing system
b) Parallel system
c) Distributed system
d) Real time system

Q3 Explain the essential properties of 2 1

a) Batch System
b) Time sharing
c) Real time
d) Parallel
e) Distributed
f) Handheld
g) Embedded

Q4 Define process and explain process states in details with diagram.

5 2
Q5 Explain process states and process control block in details 5 2

Q6 Explain the process state transition diagram used in multiprogramming 5 2

environment.

Q7 Explain threads in detail with its state diagram. 5 2

Q8 Explain and differentiate between user level and kernel level thread. 5 2

Q9 Distinguish between threads and process.

4 2
Q10 Explain various criteria for a good process scheduling algorithm? 5 1

Q11 Discuss operating system generations.

6 1
Q12 Discuss the followings: 6
a. What are the types of System calls? 1
b. List any four-process management system call. 1
c. Define user mode and kernel mode. Why two modes are required? 2
d. What is the O.S features required for multiprogramming 1
e. What are the advantage and disadvantage of multiprocessor system? 1
1
f. Describe the difference between symmetric and asymmetric
1
multiprocessing?
g. Distinguish between the client-server and peer-to-peer models of 1
distributed system

SECTION-B

Q13 Explain the following term related to IPC: a) Race condition b) critical 2 3
region
Q14 Discuss critical sections? Why mutual exclusion required? Explain any 6 3
2 methods of achieving mutual exclusion in detail.
Q15 Explain the terms related to IPC –a) Race condition b) critical section
c) Mutual exclusion 2 3
d)Semaphores

Q16 Explain Peterson’s solution for achieving mutual exclusion 5 3

Explain semaphore in detail

Q17 What is semaphore? Discuss product-consumer problem with 6 3

semaphore.

Q18 Explain the following : a) Dining philosopher problem b) System calls 5 3

c) Monitors d. Peterson’s solution for achieving mutual exclusion
e) Semaphores f) Readers & writer’s problem.

Q19 Judge the conditions for deadlock? Explain deadlock detection and 5 4
recovery in detail.
4
Q20 Explain deadlock prevention in detail.
6

Q21 Imagine the following snapshot- 6 4

Allocated Max Available
ABCD ABCD ABCD
P0 0 0 1 2 00 1 2 1 5 20
P1 1 0 0 0 1750
 P2 1 3 5 4 2356
P3 0 6 3 2 0652
P4 0 0 1 4 0656
Answer the following questions using banker’s algorithm:
a) Create need matrix.
b) Is the system in safe state?
c) If request for process p1 arrives for (0,4,2,0). Can the request be
granted immediately?

SECTION-C

Q25 Explain memory management techniques? 5 5

Q26 Explain multiprogramming with fixed partition. 5 5

5 5
Q27 Explain multiprogramming with dynamic partition.
6
Q28 Elaborate Relocation problem for multiprogramming with fixed 5
partitions.

Q29 Explain static partitioned allocation with partition sizes 300,150, 100, 5 6
200, Assuming first fit method indicate the memory status after
memory request for sizes 80, 180, 280, 380, 30.

Q30 Discuss in details Paging and segmentation. 6 5

Q31 Distinguish internal and external memory Fragmentation? 4 6

Q32 Explain following allocation algorithm.

2 6
a. First fit
b. Best fit
c. Worst fit
d. Next fit
Q33 Explain the difference between logical and physical addresses? 5 5

Q34 Explain following page replacement algorithm in detail. 5 6

i. LRU ii. FIFO iii Optimal

Q35 Explain difference between internal external fragmentations in detail. 5 5

Q36 Imagine the following page reference string.

6 6
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2How many page faults would
occur for the following replacement algorithm, assuming four and six
frames respectively?
 a.LRU page replacement. b. FIFO page replacement.

Q37 Explain the term page fault frequency. What is thrashing? How is it 5 6
controlled by OS?

Q38 Free memory holes of sizes 15K, 10K, 5K, 25K, 30K, 40K are 5
6
available. The processes of size 12K, 2K, 25K, 20K is to be allocated.
How processes are placed in first fit, best fit, worst fit.
Evaluate internal as well as external fragmentation.
SECTION-D

Q39 Design the objectives and minimal set of requirements for the file 6 7
management system?
Q40 Discuss criteria are important in choosing a file organization? 6 7
Q41 Explain briefly file system architecture & file management function. 5 7
Q42 List& briefly explain 5 file organization. 5 7
Q43 Compare file organization methods. 4 7
5 7
Q44 Discuss information elements of a file directory?
6 7
Q45 Elaborate operations performed on directory? 6 7
Q46 Explain directory? Explain directory operation in details. 5 7
Q47 Explain linked list allocation of file in detail. 5 7
Q48 Explain file system performance in detail. 5 7
Q49 Discuss the following related to disk space management 6 7
a) Block size
b) Keeping track of free blocks.
Q50 Suppose a disk drive has 400 cylinders, numbered 0 to 399.The driver
is currently serving a request at cylinder 143 and previous request was 7
at cylinder the queue of pending request in FIFO order is:
86,147,312,91,177,48,309,222,175,130.
Starting from the current head position. Conclude the total distance in
5
cylinders that the disk to satisfy all the pending request for each of the
following disk scheduling algorithms?
1) SSTS 2) SCAN 3) C-SCAN
Q51 Discuss the differences between field and record? 6 7
Q52 Explain differences between file and database? 5 7
Q53 Explain file management system? 5 7
Q54 Discuss relation between pathname & a working directory? 6 7