JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III OPERATING SYSTEMS Previous Question Paper (January/February - 2023 - R16)
Note: i) Question paper consists of Part A, Part B. ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions. iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.
Part A
Explain the functions of operating system.
Answer
- Process Management: Creating, deleting, suspending, and resuming processes, and providing mechanisms for 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.
- Protection and Security: Ensuring controlled access to system resources and protecting data from unauthorized users.
What is difference between system program and application program?
Answer
| Feature | System Program | Application Program |
|---|---|---|
| Purpose | Provides an environment for program development and execution. | Designed to perform specific tasks for the user. |
| Interaction | Interacts directly with hardware/OS kernel. | Interacts with the user via OS services. |
| Examples | Compilers, linkers, loaders, shells. | Web browsers, text editors, games. |
Write about Process states.
Answer
Sign in to view the complete answer paper.
Explain Process Control Block.
Answer
Sign in to view the complete answer paper.
What is thrashing?
Answer
Sign in to view the complete answer paper.
Illustrate the external fragmentation.
Answer
Sign in to view the complete answer paper.
List out the file Access Methods.
Answer
Sign in to view the complete answer paper.
Explain the File System Mounting.
Answer
Sign in to view the complete answer paper.
Explain safe, unsafe and deadlock state process.
Answer
Sign in to view the complete answer paper.
What are the conditions used in Banker’s algorithm?
Answer
Sign in to view the complete answer paper.
Part B
What is a system call? What are different types of system calls? Explain them.
Answer
Sign in to view the complete answer paper.
Build the Operating System Design and Implementation.
Answer
Sign in to view the complete answer paper.
Survey in detail about computer system architecture.
Answer
Sign in to view the complete answer paper.
Identify the different types of operating systems? Explain them in detail.
Answer
Sign in to view the complete answer paper.
Consider five processes P1 to P5 arrived at same time. They have estimated running time 10, 2, 6, 8 and 4 seconds respectively. Their priorities are 3, 2, 5, 4 and 1 respectively with 5 being highest priority. Compute the average turnaround time and average waiting time for Round Robin(q=3) and priority scheduling algorithm.
Answer
Sign in to view the complete answer paper.
Write down the Petersons solution to critical section problem and explain it.
Answer
Sign in to view the complete answer paper.
Identify the differences between pre-emptive and non-pre-emptive scheduling.
Answer
Sign in to view the complete answer paper.
Consider the page reference string 1, 0, 2, 5, 3, 0, 1, 0, 2, 4, 0, 3, 0, 4, 2, 4, 3, 4, 1, 4, 0. Evaluate how many page faults occur for the Optimal and LRU Page replacement algorithms with 4 frames?
Answer
Sign in to view the complete answer paper.
Explain in detail about segmentation on with paging technique.
Answer
Sign in to view the complete answer paper.
What is the need of demand paging? Explain briefly.
Answer
Sign in to view the complete answer paper.
Discuss in detail about file system structure and implementation.
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. Estimate 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.
Identify the principles of protection? And explain the access matrix in detail.
Answer
Sign in to view the complete answer paper.
Examine deadlock detection algorithm with an example.
Answer
Sign in to view the complete answer paper.
Consider a system with three processes and four resources. Resource R1 and R3 with one instance, R2 with two instance, process P1 holding an instance of R2 and waiting for R1, process P2 is holding an instance of R1 and R2 and waiting for R3, process P3 is holding an instance of R3.
Draw resource allocation graph for the given system.
Answer
Sign in to view the complete answer paper.
Is it possible to apply the Resource allocation graph algorithm to avoid deadlock? Explain.
Answer
Sign in to view the complete answer paper.