PYQ – OPERATING SYSTEM (2418302) | SEMESTER 3RD (2ND YEAR) | Year 2020

Operating System 2020 OLD PYQ.

Group A

 

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

(i) Physical memory is divided into fixed size block called:

(a) Frames

(b) Pages

(c) Backing store  

(d) Leaf

(ii) With paging there is no ………. Fragmentation:

(a) Internal

(b) External

(c) Both (a) and (b)

(d) Neither (a) and (b)

(iii) Illegal address are trapped using:

(a) Error

(b) Protection

(c) Valid – Invalid

(d) Access bit

(iv) What are the common security threats?

(a) File shreading 

(b) File sharing and permission

(c) File corrupting

(d) File integrity

(v) What is a Trojan horse?

(a) It is a useful way to encrypt password

(b) It is a user which steals valuable information

(c) It is a rogue program which trick users

(d) It’s a brute force attack algorithm

(vi) Which of the following is not an operating system?

(a) Windows

(b) DOS

(c) Oracle

(d) Linux

(vii) The main purpose of Banker’s algorithm is for:

(a) Deadlock avoidance

(b) Deadlock detection

(c) Deadlock recovery

(d) None of the above

(viii) If the size of page is increased then internal fragmentation also:-

(a) Increase

(b) Decrease

(c) Remains constant

(d) None of the above

(ix) Which of the following is not an application software?

(a) Page maker

(b) Adobe photoshops

(c) Windows XP

(d) Picassa

 
(x) Which of the following operating system does not implemented multitasking truly?

(a) Windows NT

(b) Windows XP

(c) MS DOS

(d) Windows 98

 
(xi) In multilevel feedback scheduling algorithm.

(a) A process can move to a different classified ready queue.

(b) Classification of ready queue is permanent

(c) Process are not classified into groups

(d) None of the mentioned.

(xii) The real difficulty with SJF in short term scheduling is:

(a) It is too good as an algorithm

(b) Knowing the length of the next CPU request

(c) It is too complex to understand

(d) None of the mentioned

(xiii) The FIFO algorithm:

(a) Executes first the job that last entered queue

(b) Executes first the job that fist entered queue

(c) Executes first the job that has been in queue longest

(d) None of these

(xiv) Which of the following is not a page replacement algorithm.

(a) First in first out

(b) Least recently used

(c) Most recently used

(d) Last in last out

 
(xv) Which loader is used when a system starts booting?

(a) Boot loader

(b) Booting loader

(c) Bootstrap loader

(d) Bootable loader

(xvi) A solution to the problem of external fragmentation is:

(a) Compaction  

(b) Larger memory space

(c) Smaller memory space

(d) None of the motioned

(xvii) Which of the following is not a necessary condition for deadlock?

(a) Hold and wait

(b) No preemption

(c) Circular wait

(d) Mutual Exclusion

(xviii) Which scheduling algorithm will suffer from convoy effects?

(a) SJF Non preemptive   

(b) Round robin

(c) First come first serve  

(d) Priority based scheduling

(xix) Which process can be affected by other process executing in the system?

(a) Cooperating process

(b) Child process

(c) Parent process

(d) Init process

(xx) Concurrent access to shared data may result in.

(a) Data consistency

(b) Data insecurity

(c) Data inconsistency

(d) None of the mentioned

 

Group:-"B"

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

 

2. Explain different types of operating system in detail. 

OR

Explain process scheduling. What are different scheduling criteria?

 

3. What do you mean by Deadlock? What are necessary conditions for deadlock? 

OR

Explain concept of Paging. What do you mean by thrashing?

 

4. Explain difference between time sharing and multi-tasking operating system.  

OR

What do you understand by Luter process communication? Explain any one synchronization problems.

 

5. List any three operating system. What are the advantages of Linux operating system?  

OR

How security and protection is achieved in operating system? Explain Worm and Trojan Horse.

 

6. Explain semaphore. List out basic operations on semaphore. 

OR

What do you understand by virtual memory? How swapping is done in operating system?

 

Group:- "C"

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

 

7. Explain memory management in operating system. What do you mean by contiguous and non-contiguous memory application? 

OR

Explain different states in process life cycle with suitable diagram.

 

8. Explain different deadlock handling strategies. What do you mean by safe and unsafe state. 

OR

Explain semaphore. How semaphore can be used to solve IPC problems? List out different operations on semaphore.

 

9. What are different functions of operating system? Explain each function in detail with example.   

OR

Explain Message Passing. What are the different methods used for implementation of message passing system?

 

10. Explain page replacement. Calculate number of page faults using FIFO and LPU page replacement strategy for following page reference with no of frame = 4

     7,0,1,2,0,3,0,4,2,3,0,3,2  

OR

Explain Trashing. Explain difference between paging and segmentation. What do you wear by segmented paging?

 

11. Calculate average waiting time, turnaround time using SJF and Round Robin with time quantum=1

Process	Arrival time	Burst time
P1	2	3
P2	3	1
P3	4	4
P4	4	2

 

OR

Write short notes on any two of following:

        (a) Disk scheduling algorithm

        (b) Page replacement policies/Algorithm

        (c) Parallel Processor         

 

 

*****