JNTU

JNTU B.Tech III OPERATING SYSTEMS Previous Question Paper (March - 2021 - R16)

B.Tech | III | III-I | R16 | March - 2021

Answer PaperPaper Code: 135CVMaximum Marks: 75Time: 3 hours

Answer any five questions. All questions carry equal marks.

Main

115 marks
a

Describe some usage scenarios in which network systems are advantageous than personal computers.

7 marks

Answer

Network systems offer significant advantages over standalone personal computers in scenarios requiring resource sharing, centralized management, and high availability. Key usage scenarios include:

  • Resource Sharing: In environments like corporate offices or laboratories, expensive hardware such as high-speed printers, scanners, or large-capacity storage arrays can be shared among multiple users, reducing overall infrastructure costs.
  • Centralized Data Management and Collaboration: Network systems allow multiple users to access and modify shared databases or documents simultaneously. This ensures data consistency and facilitates real-time collaboration, which is impossible with isolated personal computers.
  • Scalability and Load Balancing: Networked systems enable the distribution of computational tasks across multiple servers. This allows for horizontal scaling, where additional nodes can be added to handle increased traffic, and load balancing, which prevents any single machine from becoming a bottleneck.
  • Reliability and Fault Tolerance: Through network-based redundancy, critical services can be replicated across multiple machines. If one server fails, the network can reroute requests to another, ensuring continuous availability of services.
b

Discuss the advantages and disadvantages of using same system call interface for manipulating both files and devices.

8 marks

Answer

Using a unified system call interface (such as open, read, write, and close) for both files and devices is a design principle known as device-file abstraction. This approach treats hardware devices as special files within the filesystem hierarchy.

Advantages:

  • Uniformity and Simplicity: Programmers can use the same set of system calls to interact with diverse hardware, reducing the learning curve and the complexity of application code.
  • Extensibility: New devices can be integrated into the system without requiring new system calls. Once a device driver is mapped to a file node, existing applications can interact with it immediately.
  • Composability: Tools designed for file manipulation (like redirection or piping) can be applied to device streams, allowing for powerful command-line operations where device input/output is treated as a data stream.

Disadvantages:

  • Semantic Mismatch: Files are typically persistent and seekable, whereas many devices (like network sockets or keyboards) are transient or sequential. Forcing these into a file interface can lead to confusing behavior, such as seeking on a stream where it is logically undefined.
  • Limited Control: The standard file interface may lack the granularity required for device-specific control operations, such as setting baud rates for serial ports or configuring hardware interrupts, often necessitating the use of ioctl calls, which bypasses the uniformity goal.
  • Performance Overhead: The abstraction layer may introduce unnecessary overhead for high-speed devices that require direct memory access or specific buffer management strategies not optimized for general file I/O.
215 marks
a

List and explain the advantages of using cache memory.

7 marks

Answer

Sign in to view the complete answer paper.

b

What are different methods available to pass the parameters to the operating system? Explain in detail.

8 marks

Answer

Sign in to view the complete answer paper.

315 marks
a

Consider the situation of Dining Philosophers’ problem exemplifying classic process synchronization problem, explain and give a solution for the same.

7 marks

Answer

Sign in to view the complete answer paper.

b

Given following data and quantum is 3, find the average waiting of process by using round robin scheduling.

ProcessArrival timeExecution timeService time
P0059
P1136
P22814
P3360
8 marks

Answer

Sign in to view the complete answer paper.

415 marks
a

Consider the following set of processes, with the length of the CPU burst given in milliseconds: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpre-emptive priority (a smaller priority number implies a higher priority). Find turnaround time and waiting time of each process for the above algorithms and find which algorithm results in minimum average waiting time?

ProcessBurst Time(ms)Priority
P1103
P211
P323
P414
P552
7 marks

Answer

Sign in to view the complete answer paper.

b

Differentiate ordinary pipes and named pipes in Unix.

8 marks

Answer

Sign in to view the complete answer paper.

515 marks
a

Consider the following page reference string 7, 0, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0,1,7,0. Assuming 3 frames, how many page faults would occur in each of the cases: (i) LRU (ii) FIFO.

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain first fit, best fit, worst fit system along with example.

7 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

Define page fault. When does a page fault occur? Describe the action taken by operating system when page fault occurs.

8 marks

Answer

Sign in to view the complete answer paper.

b

What is the advantage of combining paging and segmentation?

7 marks

Answer

Sign in to view the complete answer paper.

715 marks
a

What is meant by File Allocation Table (FAT)? Explain its structure.

7 marks

Answer

Sign in to view the complete answer paper.

b

Suppose that a disk drive has 1000 cylinders numbered from 0 to 999. The drive is currently serving a request at cylinder 53 and the previous request was at cylinder 125. The queue of pending requests in FIFO order is: 98, 183, 37, 122, 14, 124, 65 and 67. Starting from the current head position, what is the total distance that the disk arm moves to satisfy all the pending requests for each of the following disk scheduling algorithms? [Assume suitable direction for head movement]. i) SCAN ii) LOOK.

8 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

What is Resource Allocation Graph (RAG)? How RAG can be helpful in specifying whether a deadlock occurred or not?

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain language based protection.

8 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of OPERATING SYSTEMS from JNTU for B.Tech IT III III-I, March - 2021, R16.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in OPERATING SYSTEMS

Loading Question Papers

Fetching data from database...