Operating system Question paper of 3rd Sem (2019)

Question bank of OS 

Sub Code - 1618305

2019 (Odd)

 Time : 3Hrs

Sem. III / CSE 

 Operating system

Full Marks : 70

 Pass marks : 28

 Group A 

1. Choose the most suitable answer from the following options: - (1*20=20)

(i) Process synchronization can be done on-
(a) Hardware level
(b) software level
(c) Both (a) and (b)
(d) None

(ii) Which of the following do not belong to queues for processes ?
(a) job Queue
(b) PCB Queue
(c) Device Queue
(d) Ready Queue

(iii) In a time-sharing operating system, when the time slot given to a process is completed, the process
goes from the running state to the :-
(a) Blocked State
(b) Ready State
(c) Suspended State
(d) Terminated State

(iv) A process control block (PCB) does not contain which of the following .
(a) Code
(b) Stack
(c) Bootstrap program
(d) Data

(v) The number of process completed per unit time is known as -
(a) Output
(b) Throughput
(c) Efficiency
(d) Capacity

(vi) Which of the following is not the state of a process ?
(a) New
(b) Old
(c) Waiting
(d) Running

(vii) The Segment of code in which the process may charge common variable, update, tables write into file is
known as :-
(a) Program
(b) Critical Section
(c) Non- critical Section
(d) Synchronizing

(viii) Condition must be satisfied to solve the critical section
(a) Mutual Exclusion
(b) Progress
(c) Bounded Wait
(d) All the above

(ix) The request and release of resources are-
(a) Command line statements
(b) Interrupts
(c) System calls
(d) Special programme

(x) For sharable resource, mutual exclusion -
(a) Is required
(b) Is not required
(c) May be or May not be required
(d) None of these

(xi) Virtual memory is normally implemented by-
(a) Demand Paging
(b) Buses
(c) Virtualization
(d) All above

(xii) A page fault occurs when :
(a) A page gives inconsistent
(b) A page cannot be accessed due to its absent from memory
(c) A page is invisible
(d) All of above .

(xiii) Which of the following page replacement algorithms suffers from Belayd’s Anomaly ?
(a) Optimum replacement
(b) LRU
(c) FIFO
(d) Both (a) and (b)

(xiv) A process refers to 5 page ABCDE in order ABCDABEABCDE. If the page replacement algorithm in FIFO,
the number of page transfers with empty internal store of 3 frames is :
(a) 8
(b) 10
(c) 9
(d) 7

(xv) The circular wait condition can be prevented by :
(a) Define a linear ordering of resource type
(b) Using thread
(c) Using pipes
(d) All of above

(xvi) Which are of the following is dead lock avoidance algorithm
(a) Banker’s algorithm
(b) Round Robin algorithm
(c) Elevator algorithm
(d) kern’s algorithm

(xvii) To difference the many network services a system supports ……………….are used
(a) Variables
(b) sockets
(c) Ports
(d) service names

(xviii) RPC provides a (an)………….on the client side, a separate one for each remote procedure .
(a) Stub
(b) Identifier
(c) Name
(d) Process identifier

(xix) The Full form of RMI
(a) Remote Method Invocation
(b) Remote Method Installation
(c) Remote Memory Installation
(d) Remote Memory Invocation

(xx) A solution to the problem of external fragmentation is :
(a) Large memory size
(b) Compaction
(c) Smaller memory size
(d) None .

Group B 

➥ Answer all Five Questions: - (5*4=20)

2. What do you mean by cooperative process .

OR

Define system program . Explain in brief with example.

OR

3. What do you mean by PCB ? What are its contents?

OR

Explain direct and indirect communication of message passing

4. Explain long Term Scheduler ?

OR

Explain short term Scheduler .

5. Explain Paging in brief .

OR

Explain Segmentation in brief .

6. Discuss the services of operating system in brief .

OR

What are two option of breaking deadlock ?

Group C 

➥ Answer all Five Questions: - (5*6=30)

7. What is process ? Draw and state the process state diagram ?

OR

Explain concept of virtual memory . Also discuss its advantages.

8. What is address binding ? Explain in the concept of dynamic relocation of
address ?.

OR

Explain the following :
(a) File type
(b) File operation
(c) File attributes

9. What are semaphore ? Explain solution of producer- Consumer problem using
semaphore ?

OR

Explain three requirement that a solution to critical section problem must satisfy.

10. Describe necessary condition for a deadlock situation to arise .

OR

Explain different method to recover deadlock ?

11. Consider the reference stream 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page
faults which using FCFS and LRU using 2 frames ?

OR

Write short note on
(a) Process management mode of LINUX
(b) Disk scheduling Mechanism

∎ By- Md Altaf Raja (CSE)