- Explain the normal mode of operation of a process and when it is in a deadlock state with suitable example.
- Briefly explain the characteristics that results in deadlocks
- Describe deadlocks with the help of a resource allocation graph
- Briefly explain the methods for handling deadlocks
- Examine deadlock prevention w.r.t four necessary conditions of a deadlock.
- Explore and explain the two deadlock avoidance algorithms.
- How is a system recovered from deadlock.
- Explain Banker's Algorithm.
- Explain memory allocation model for a process.
- Explain the implementation of non contiguous memory allocation using segmentation.
- Discuss the techniques used to perform fresh memory allocation from a free list.
- Compare contiguous and non contiguous memory allocation technique
- Define : i) Virtual memory ii) Page Fault
- Define : i) Page in operation ii) Page out operation
- Define : i) Memory fragmentation ii) Memory Compaction.
- Define : Page and Page Frames.
- Define : internal and external fragmentation.
- Define : Paging and external fragmentation.
- Define : Logical and physical address
- Explain the concepts involved in demand loading of a page with neat diagram.
- Explain FIFO and LRU page replacement policies.
- Explain demand loading of a page with the help of a figure.
- Discuss the methods used to achieve the memory protection with a suitable example.
- Describe the memory allocation methods for program controlled blocks.
- Explain demand paging preliminaries.
Showing posts with label Operating Systems. Show all posts
Showing posts with label Operating Systems. Show all posts
Wednesday, March 25, 2020
Operating Systems - Module 3 - Important Questions - 18CS43
Operating Systems - Module 2 - Important Questions - 18CS43
- With the help of a state transition diagram explain fundamental state transitions of a process.
- Explain fields of process control block
- What are the advantages of thread over process
- Explain functions of long, medium and short term schedulers in a time sharing system.
- Describe the components of process environment
- Explain with neat diagram kernel level thread implementations
- Explain fundamental state transition diagram for a process with process control block
- Explain in detail the programmers view of processes. With interaction between processes, highlight the remark for its interaction.
- What is a thread?. List its advantages
- Explain the control synchronisation and data access synchronisation with examples.
- With a neat diagram, Explain the different states of a process in unix operating system.
- Explain with neat diagram. i) User level threads ii) Kernel level threads
- Discuss the primary concerns / reasons for process termination.
- List the events occur during the operation of OS. With a diagram discuss the event handling actions of kernel.
- With a diagram explain the relation between processes and threads. Discuss the advantages of threads
- Explain four kinds of process interaction
- Explain control synchronisation and need for control synchronisation with an example.
- Explain the race condition in airline reservation system with an example.
- What is race condition?. List the requirements that a solution to critical section must satisfy.
- Illustrate with example the Peterson's solution for critical section problem and prove that the mutual exclusion property is preserved.
- Explain Reader's-Writer's problem. Show how semaphores provide solution to Reader's- Writer's problem.
- Explain the Dining Philosopher's problem using monitors.
- What are semaphores ? Explain any 3 use cases of Semaphores.
- Describe an n-process solution to critical section problem which uses test() and set() hardware instruction. Prove how this algorithm satisfies all the requirements of critical section problem's solution.
- Explain critical section problem. What are the requirements that critical section probelm must satisfy.
- What are Monitors? Compare with semaphores their relative advantage and disadvantage.
- What do you mean by binary semaphore and counting semaphore?
- Explain implementation of wait() and signal() semaphore operation.
Monday, February 17, 2020
Operating Systems - Module 1 - Important Questions - 18CS43
- Define operating systems? List the goals of the operating System and explain.
- List and explain the different computational structures of operating system
- Explain the term w.r.t operating system: (a) Efficiency (b) System Performance (c) User service
- What are the different classes of operating system. Explain them with their primary concern.
- List and explain the key concerns of operating system
- Explain various resource allocation strategies
- Explain about the components of modern computer system?
- What is boot strap loader?
- Explain the dual mode operation of an operating system.
- Explain the services offered by operating system.
- Explain the working of system call.
- How is layered structure advantageous over simple structure of operating system?
- Distinguish between the following term:
- Multiprogramming and Multitasking
- Multiprocessor and Clustered System
- Demonstrate the concept of virtual machine with an example.
- Explain the role of operating system from different view point.
Subscribe to:
Posts (Atom)
Database Management systems - Module 2
1 a. Explain the entity integrity and referential integrity constraints. Why is each considered important. Give examples. b. Discuss eq...
-
Explain any 2 socket functions. Explain the support for parsing HTML using regular expressions with an example program. Describe a suppo...
-
List and explain the java buzzwords. Explain how java is robust and interactive Explain type conversions in java with suitable example. Exp...
-
1 a. Explain the entity integrity and referential integrity constraints. Why is each considered important. Give examples. b. Discuss eq...