Name of the College : Turbomachinery Institute of Technology &Sciences (TITS)
University : JNTU Hyderabad
Department : Computer Science Engineering
Subject Name : Operating Systems
Degree : B.Tech
Year/Sem : III/I
Website : tits.ac.in
Document Type : Question Bank
Download Model Question Paper : https://www.pdfquestion.in/uploads/tits.ac.in/3061-osqb.pdf
TITS Operating Systems Question Bank
UNIT – I
1. What are the various objectives and functions of Operating Systems? [Nov2007,set-4,][Nov2008, set-1 ]
2. What are the major activities of an operating system with regard to process management? [Nov2008, set-2 ]
Related : Turbomachinery Institute of Technology & Sciences Data Communication And Computer Networking B.Tech Question Bank : www.pdfquestion.in/3058.html
3. Differentiate Distributed systems from Multiprocessor system [Nov2008,set-4,1 ]
4. Explain the basic instruction cycle with appropriate diagram [Nov2007,set-2 ]
5. Explain about the various memories hierarchy. [Nov2007,set-3][Feb-2008,set-2]
6. Explain about interrupts and various types of interrupts [Nov2007,set-1 ]
7. Explain about protection and security?
8. Explain about multiprogramming and time-sharing operating system?
9. Explain operating system structure?
10. Explain about system calls?
11. (a) Justify the following statements: i. OS can be viewed as a resource allocator ii. OS as a control program.
(b) What constitutes an operating system? Explain. [4+4+8][Dec 2011 Set 1/2/3/4]
12. State and explain the various types of system calls in detail[8].[December 2011 R09]
UNIT – II
1. What is a process ?explain different process states [Feb-2008,set-1,][Nov -2007,set-3,4 ]
2. What is Process Control Block? Explain its structure. [Feb-2008, set-3]
3. Explain about single threaded and multi threaded process models with suitable diagrams.[Nov-2007,set-2 ]
4. Explain about single threaded and multi threaded process models with suitable diagrams. [Nov2007,set-2 ]
5. Explain about process scheduling? Explain different types of schedulers?
6. Define Thread and explain advantages of threads?
7. Explain about different multithreading models?
8. Explain about preemptive and non-preemptive scheduling?
9. Explain about FCFS,SJF Scheduling algorithms?
10. Explain about Priority, Round-Robin Scheduling algorithms?
11. Explain about multilevel Queue, multilevel feedback (or) feedback scheduling?
12. (a) Explain any four scheduling algorithms with their merits and demerits.
(b) Explain the various disk scheduling policies. [8+8] [Dec 2011 Set 1/2/3/4]
13. Compare and contrast the FCFS and SJF scheduling algorithms illustrate with Gantt charts whenever necessary. December 2011 R09]
14. Discuss about the following: (a) User-level threads (b) Kernel-level threads (c) Multi-threadings. [5+5+6] [April 2011]
UNIT – III
1. Define monitor. What are its characteristics? [Feb-2008,set-3 ]
2. What is a semaphore? What are the various operations defined on it?[ Nov-2007,set-1 ]
3. What is the difference between weak semaphore and strong semaphore?
4. Give short note about the following: [Nov-2007,set-2 ]
(a) Binary Semaphores. (b) Bounded Waiting.
5. Explain about Critical section?
6. Explain about ACID Properties?
7. Explain messaging in UNIX?
8. Explain about log based recovery?
9. Explain about deadlocks and Starvation?
10. Explain about Classic problems of Synchronization?
11. Describe the semaphore solution for critical region.[16] [Dec 2011 Set 1/2/3/4]
12. How the problem among dining philosophers can be resolved? Suggest a suitable algorithm. [8+8]
13. (a) Explain different conditions of process interaction with respect to the degree of awareness, relationship
between processes, influence of processes, control problems.
(b) What are the necessary requirements for mutual exclusion? [8+8] [April 2011]
UNIT – IV
1. (a) Discuss LRU-Approximation page Replacement.
(b) Consider LRU, FIFO, Optimal page replacement algorithms.[ Feb2008, set-2 ]
2. What is swapping and what is its purpose? [Feb-2008,set-4 ]
3. Explain paging scheme for memory management, discuss the paging hardware and Paging model.[Nov-2007, set-1 ]
4. Explain about contiguous memory allocation?
5. Explain about first fit, best fit, worst fit, next fit algorithms? [Dec 2011 Set 1/2/3/4]
6. Explain about advantages and disadvantages of paging?
7. Explain difference between paging and segmentation?
8. Explain about the following page replacement algorithms a)FIFO b)OPR, c)LRU
9. Explain about Linux memory management?
10. (a) What elements are typically found in a page table entry? Briefly define each element.
(b) What is the purpose of translation look aside buffer?
(c) What is the difference between resident set management and page replacement policy? [6+5+5] [April 2011]
UNIT – V
1. Write the resource allocation algorithm for dead lock?[16][Feb2008,set-1 ]
2. Explain about Deadlock Prevention. [16][Feb2008, set-4 ]
3. Explain about Deadlock Avoidance.[16][Nov2008,set-4 ]
4. Explain about necessary conditions of deadlock
5. Explain about resource allocation graph(RAG)?
6. Explain about recovery from deadlock?
7. Explain about Streams in detail?
8. Discuss about I/O devices in I/O hardware?
9. Explain about deadlock prevention using resource preemption?
10. Explain about PC bus Architecture?
(a) Define a STREAM. Draw and explain the STREAMS Structure along with its benefits.
(b) Distinguish between a STREAM driver and STREAM module. [12+4] [Dec 2011 Set 1/2/3/4]
11. (a) Discuss about direct memory access.
(b) With neat diagram explain I/O organization model. [8+8] [April 2011]