3/14/20

Operating system previous year question 2019 odd


Sub Code: - 1618305


2019(ODD)
Time : 3Hrs                                                                          
 Semester  III(New) 
Operating system  
Full Marks : 70
Pass marks : 28
                                                                                                         

Group A

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) level
(d) None

(ii) Which of the following don not belong to queue for processes?

(a) Job Queue
(b) PCB Queue
(c) Device Queue
(d) Ready Queue

(iii) In a time-sharing operating system, which the time slot give 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 in known as-

(a) Output
(b) Throughput
(c) Efficiency
(d) Capacity

(vi) Which of the following in 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 of the above

(ix) The request and release of resources are-

(a) Command line statement
(b) Interrupts
(c) System calls 
(d) Special program

(x)  For sharable resources, mutual exclusion-

(a) Is required
(b) Is not required
(c) May be or may not be required
(d) None of the above

(xi) Virtual memory is normally implemented by-

(a) Demand paging
(b) Buses
(c) Virtualization
(d) All of the above

(xii) A page fault occurs when:

(a) A page gives inconsistent data
(b) A page cannot be accessed due to its absence from memory
(c) A page is invisible
(d) All of the 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 pages ABCDE in order ABCDABEABCDE. If the page replacement algorithm is FIFO, the number of page transfers with an 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) Defining a linear ordering of resource types
(b) Using thread
(c) Using Pipes
(d) All of the above

(xvi) Which are of the following is dead l0ck avoidance algorithm

(a) Banker’s algorithm
(b) Round-robin algorithm
(c) Elevator algorithm
(d) Karan’s algorithm

(xvii) To differentiate the many network services a system supports __________ are used.

(a) Variables
(b) Sockets
(c) Ports
(d) Services names

(xviii) RPC provides a (an) ________ on the client side, a separate one from 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.

3. What do you mean by PCB? What are its contents?
OR
Explain direct and indirect communication of message passing

4. Explain ling 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 the 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 the concept of dynamic relocation of address? 
OR
Explain the following-
a.     File type
b.     File operation
c.      File attributes

9. What are semaphores? Explain solution of producer-consumer problem using semaphore?
OR
Explain three requirements that a solution to critical-section problem must satisfy.

10. Describe necessary condition for a deadlock situation to arise.
OR
Explain different methods to recover deadlocks?

11. Consider the reference stream 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 2, 1, 2, 3, 6. How many page faults which using FCFS and LRU using 2 frames?
OR
Write short notes on
a.      Process management modes of LINUX
b.     Disk Scheduling mechanism










No comments:

Post a Comment

Please do not enter any spam link in the comment box and use English and Hindi language for comment.

Latest Update

Queue data structure

Popular Posts