OPERATING SYSTEM

Most repeated questions of Operating System

Section-A

Q-1 What is an operating system Discuss the various services of os (2018,2016)

Q-2 Difference between time sharing system and real time system (2018)

Q-3 Difference between physical address and logical address (2018,2016)

Q-4 Explain the demand paging and cache memory (2018)

Q-5 Explain the various attributes of file (2018)

Q-6 What is preemptive and non-preemptive scheduling? Explain (2016)

Q-7 What are the functions of device management (2016)

Q-8 Expain the concepts of system,protection and security.(2016)

Q-9 define different file system (2019)

Q-10 What is is purpose of system calls? (2019)

Q-11 What is the priciple advanatage of multiprogramming? (2019)

Q_12 How measure relaiblity of H/W disk? (2019)

Section-B

Q-1 Describe the critical section problem with suitable example (2018)

Q-2 Write the five UNIX and DOS commands with cross reference and function (2018)

Q-3 Explain how memory can dynamically allocated using first fit
best fit and worst fit strategies (2018)

Q-4 Describe the following allocation algorithms in the context of contiguous allocations:(2016)

(a) First fit
(b) Best fit
(c) Worst fit

Q-5 What is disk Scheduling ? Define various types of disk scheduling.(2016)

Section-C

Q-4 (a) what is page frame and page fault (2018)
(b) Solve :
7,0,1,2,0,3,0,4,2,30,3,2,1,2,0,1,7,0,1 using FIFO and LRU algorithm
and calculate the page fault,page from =3

Q-5 define the following (2018)

(a) Fragmentation
(b) paging
(c) process state
(d) segmentation
(e) memory management system

Q-6 What is deadlock ? Explain four necessary conditions for deadlock to occur with suitable example Describe the different methods for preventation and avoidance of deadlocks.(2018,2016)

Q-7 Explain the linked allocation method for file list the merits and drawbacks of this method how does an indexed allocation solve the problems of linked allocation scheme? (2018)

Q-8 What is memory Segmentation ? How it is different from paging?(2016)

Q-9 (a) Explain Semaphore. (2016,2019)

(b) Explain with examples of your own the following any two process scheduling algorithm: (2016)

First come first serve
Shortest job first
priority scheduling
round robin

Q-11(a) Defing Resource allocation graph. Give that there is only one instance of each resource type.describe the resource allocation graph algorithm for deadlock avoidance using a suitable example.(2016)

(b) Discuss the procedure for avoiding deadlock situation also describe the procedure to achieve safe state.(2016)

Q-12 (a) Explain the different techinques to improve disk reliability.(2016)

(b) Explain the different activities performed by disk management.(2016)

Comments

Comments take few seconds to update