Jawaharlal Nehru Technological University Hyderabad
Jawaharlal Nehru Technological University Hyderabad B.Tech II OPERATING SYSTEMS Previous Question Paper (December - 2018 - R16)
Note: This question paper contains two parts A and B. Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 10 marks and may have a, b, c as sub questions.
Part A
Explain the functions of operating system.
Answer
- Process Management: Creating, deleting, suspending, and resuming processes, and managing process synchronization and communication.
- Memory Management: Tracking memory usage, allocating and deallocating memory space, and managing virtual memory.
- File Management: Creating, deleting, and manipulating files and directories, and managing secondary storage.
- I/O System Management: Managing device drivers, buffering, caching, and spooling for hardware devices.
- Security and Protection: Controlling access to system resources and protecting data from unauthorized users.
Explain about the abstract view of the components of a computer system.
Answer
- Hardware: The physical components (CPU, memory, I/O devices) that provide basic computing resources.
- Operating System: The software layer that controls and coordinates the use of hardware among various applications and users.
- Application Programs: Software (compilers, databases, browsers) that defines the ways in which system resources are used to solve computing problems.
- Users: The people, machines, or other computers that interact with the system via application programs.
Distinguish between I/O bound process and CPU bound process.
Answer
Sign in to view the complete answer paper.
What are the requirements of Critical section problem?
Answer
Sign in to view the complete answer paper.
What is Demand Paging?
Answer
Sign in to view the complete answer paper.
Distinguish between logical and physical address space.
Answer
Sign in to view the complete answer paper.
Explain about the Acyclic graph directory.
Answer
Sign in to view the complete answer paper.
Explain about the Solid state disk.
Answer
Sign in to view the complete answer paper.
What is Access Control?
Answer
Sign in to view the complete answer paper.
Explain how to eliminate the deadlocks using resource preemption.
Answer
Sign in to view the complete answer paper.
Part B
Explain how operating systems are used in a variety of computing environments.
Answer
Sign in to view the complete answer paper.
What is operating system? Explain multiprogramming and time sharing systems.
Answer
Sign in to view the complete answer paper.
Explain about the dual mode operation in OS with a neat block diagram.
Answer
Sign in to view the complete answer paper.
Explain about the Process Control Block.
Answer
Sign in to view the complete answer paper.
What is Semaphore? How can we achieve the synchronization using semaphore for producer consumer problem?
Answer
Sign in to view the complete answer paper.
Discuss the Peterson’s solution for the race condition with algorithm.
Answer
Sign in to view the complete answer paper.
What is the average waiting time and average turn around times of all processes for FCFS, SJF algorithm?
Answer
Sign in to view the complete answer paper.
Consider the following page reference string 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2. With four Frames. How many page faults would occur for the FIFO, Optimal page replacement algorithms? Which algorithm is efficient? (Assume all frame are initially empty)
Answer
Sign in to view the complete answer paper.
What is Thrashing? Explain the Causes of Thrashing.
Answer
Sign in to view the complete answer paper.
Consider the following reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. Assume there are three frames. Apply LRU replacement algorithm to the reference sting above and find out how many page faults are produced. Illustrate the LRU page replacement algorithm in detail and also two feasible implementation of the LRU algorithm.
Answer
Sign in to view the complete answer paper.
Explain about Swapping.
Answer
Sign in to view the complete answer paper.
Suppose that a disk drive has 5000 cylinders numbered 0 to 4999. The drive is currently serving a request at cylinder 143. The queue of pending requests in FIFO order 86,1470,913,1774,948,1509, 1022, 1750, 130 starting from current head position. What is the total distance that disk arm moves to satisfy all the pending request for FCFS and SSTF disk scheduling algorithm.
Answer
Sign in to view the complete answer paper.
Explain about the system call for File operations.
Answer
Sign in to view the complete answer paper.
Explain the following disk scheduling algorithm with proper diagram: a) FCFS b) SSTF c) SCAN d) LOOK e) C-SCAN.
Answer
Sign in to view the complete answer paper.
Explain about the Language based Protection.
Answer
Sign in to view the complete answer paper.
Explain about the bankers algorithm for deadlock avoidance.
Answer
Sign in to view the complete answer paper.
Explain the protection mechanism illustrating the use of protection domain and access control list.
Answer
Sign in to view the complete answer paper.
What is deadlock? Explain the conditions that lead to deadlock.
Answer
Sign in to view the complete answer paper.