What is an operating system? Explain the structure of an Operating system.
Explain various types of system calls.
Explain deterministic modeling for scheduling algorithm evaluation.
Explain the Non-preemptive and preemptive SJF scheduling algorithm with an example.
Explain the locking protocol for concurrency control.
Explain memory swapping mechanism.
Explain the difference between internal fragmentation and external fragmentation.
What is Thrashing? Explain the causes of thrashing.
Explain the necessary conditions for deadlock.
Explain the deadlock avoidance.
Explain the file access methods.
Explain acyclic graph directories.
Explain swap-space management with an example.
Describe stable storage implementation.
Explain program Threats.
Explain how an Operating system acts as a resource manager.
Explain various types of system calls.
Explain the criteria for CPU scheduling.
Explain priority scheduling and round robin scheduling algorithms with an example.
What are the special instructions used for mutual exclusion? Explain them.
Explain contiguous memory allocation mechanism.
Explain the techniques for structuring the page table.
Explain deadlock prevention.
What is a file? Explain the attributes of a file.
Explain disk allocation methods.
Explain the following disk management aspects. Disk initialization ii) Booting from Disk iii) Bad-Block recovery
Explain the problems with RAID structure.
What are the goals of protection?
Describe Real time systems.
Explain Operating system services.
Explain FCFS and Round robin scheduling algorithms with an example.
Explain the critical section problem.
What is a semaphore? Explain the usage and implementation of semaphores.
Discuss the hardware support required to support demand paging.
Explain the optimal and LRU page replacement algorithms with an example.
Explain the necessary conditions for Deadlock.
Explain the kernel services related to I/O subsystem.
Explain the free-space management techniques.
Define the following disk parameters. i) Seek time ii) Rotational Delay iii) Transfer Time
Explain any three disk scheduling algorithms.
Explain system and network threats.
Explain user authentication techniques.
Explain the functions of an operating system.
Describe distributed systems.
Explain the criteria for CPU scheduling algorithms.
Explain the Peterson’s solution to the critical section problem.
Explain the solution to the Dining-Philosopher problem using monitors.
Explain the simple paging mechanism.
Explain FIFO and LRU page replacement algorithms with an example.
Explain the life cycle of an I/O request.
Explain about STREAMS.
Explain the structure of a file system.
Explain tree – structured directories.
Explain the physical structure of Magnetic disks.
Explain SSTF and SCAN disk scheduling algorithms.
Describe several methods of implementing the Access matrix.
Explain program threats.
With the help of a diagram, explain the abstract view of the components of a computer system.
What are the memory devices that can be connected to a computer? Organize them in a hierarchy.
Explain Priority scheduling with the help of an example. What are Starvation and aging?
What are the situations in which Round robin scheduling is preferred and situations in which it results in overhead.
What are the advantages of monitors over semaphores? Solve the Dinning philosopher’s problem using monitors.
What is addressing binding? How base and limit registers can be used for address protection.
What is Contiguous memory allocation?
What is Dynamic loading?
How operating system performs the function of Input and Output.
What are the different file attributes and file operations.
What are the different types of files supported by an operating system?
What are the different types of mass storage structures?
How access matrix can be used for providing protection.
How Firewalls are used for protection.
Discuss operating system from user point of view and system view
Compare the computer systems based on the number of processors.
What are the different types of Scheduling Queues? What are the different types of schedulers?
What is the difference between Preemptive and non-preemptive scheduling?
What are the criteria for evaluating scheduling algorithms? Evaluate any one scheduling algorithm using those criteria.
What is the difference between binary and counting semaphore. Give a solution for bounded buffer problem.
What is dynamic linking? What is its use?
What is the need for swapping?
What are the different types of fragmentation and what are the solutions for it.
What is Safe state? Write the Bankers algorithm and explain it with the help of an example.
How locks are used in the context of files.
Compare sequential and direct access methods.
What are the different disk scheduling algorithms?
What are the different schemes for protection?
What is the difference between symmetric and asymmetric multiprocessing.
How multiprogramming improves CPU utilization.
What is the difference between process and program? How they are related.
How and what information about a process is represented using PCB.
What is Critical Section problem? What are the different solutions to critical section problem?
Explain the memory management technique Paging.
What is Resource allocation graph? How Resource allocation graph can be used in the context of Deadlocks.
How Deadlocks can be prevented considering the four necessary conditions.
What are the different schemes for logical structure of a directory?
How stable storage is implemented.
With the help of a diagram explain the Disk structure.
Classify the different types of Security threats. What are the different solutions for them?
What is Dual mode operation of operating system?
How Caching improves performance of a system.
What is system call? What is the difference between system call and system program. What are the different types of system calls?
With the help of a diagram, explain the different states of a process.
What is the need for Process synchronization? How hardware can be used to solve synchronization problem.
What is the need for demand paging.
Illustrate Optimal and LRU page replacement algorithms with the help of an example.
What is Deadlock? What are the necessary conditions for deadlock? What are the overheads associated with Deadlock prevention and Deadlock avoidance algorithms.
What are the different file allocation methods?
Explain the different RAID levels.