Operating System and Data Storage

Operating System and Data Storage
Contact www.kimsharma.co.in for best and lowest cost solution or
Email: solvedstudymaterial@gmail.com
Call: +91 82907-72200 (Call/WhatsApp) or +91 88003-52777 (WhatsApp Only)

Q1. What is an operating system? Discuss the functions of an operating system? Give a general architecture of the operating system.
Q2. What are the cooperating processes and how they communicate? Explain by taking a suitable example.
Q3. Write a note on the multi-processor scheduling.
Q4. What are the characteristics of a good scheduling algorithm? Give a comparison of FCFS and RR algorithm giving pros and cons of each with example.
Q5. Define deadlock. What are the necessary and sufficient conditions for deadlock to occur?
Q6. What is the need for Page Replacement? Discuss different page replacement techniques giving a performance comparison.
Q7. What is the requirement of Memory Management? How the address binding of instructions and data is carried to memory address.
Q8. What is the purpose of directory structure in file system? Explain various types of directory structure with suitable diagram

Case Study

Consider the following snapshot of a system:
Allocation Max Available
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656

Answer the following questions using the banker’s algorithm:
a. What is the content of the matrix Need?
b. Is the system in a safe state?
c. If a request from process P1 arrives for (0,4,2,0), can the request begranted immediately?

1. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called—
2. Which of the following is crucial time while accessing data on the disk?
3. Which of the following memory allocation scheme suffers from External fragmentation?
4. Information about a process is maintained in a _________.
5. Distributed OS works on the ________ principle.
6. Which file system does Windows 95 typically use?
7. Identify the odd thing in the services of operating system.
8. Cryptography technique is used in ________.
9. Which of the following is not advantage of multiprogramming?
10. In ______ OS, the response time is very critical
11. Real time systems are ________.
12. Inter process communication can be done through __________.
13. The primary job of the operating system of a computer is to ________.
14. Consider the two statements.
(i) A network operating system, the users access remote resources in the same manner as local resource.
(ii) In a distributed operating system, the user can access remote resources either by logging into the appropriate remote machine or transferring data from the remote machine to their own machine. Which of the statement is true?
15. Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given with their priorities in the order: Process : Burst Time : Priority respectively .
P1 : 10 : 3 ,
P2 : 1 : 1 ,
P3 : 2 : 4 ,
P4 : 1 : 5 ,
P5 : 5 : 2.
16. The operating system manages ________.
17. The Hardware mechanism that enables a device to notify the CPU is called-_____
18. ___________ begins at the root and follows a path down to the specified file
19. Process State is a part of
20. Virtual Memory is commonly implemented by __________.
21. Virtual memory is __________.
22. _________ page replacement algorithm suffers from Belady’s anomaly.
23. Paging _________.
24. A major problem with priority scheduling is _________.
25. A ___________ contains information about the file, including ownership, permissions, and location of the file contents.
26. The term ” Operating System ” means ________.
27. The operating system of a computer serves as a software interface between the user and the ________.
28. The collection of processes on the disk that is waiting to be brought into memory for execution forms the ___________
29. Mutual exclusion
30. Which scheduler controls the degree of multiprogramming?
31. In memory management, a technique called as paging, physical memory is broken into fixed-sized blocks called ___________.
32. In the running state
33. In a multi threaded environment _______.
34. Which of the following statement is not true?
35. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the _______________ condition of deadlock
36. In the ___________ method of data transfer, the participation of the processor is eliminated during data transfer.
37. A thread is a __________ process.
If all page frames are initially empty, and a process is allocated 3 page frames in real memory and references its pages in the order 1 2 3 2 4 5 2 3 2 4 1 and the page replacement is FIFO, the total number of page faults caused by the process will be __________.
38. If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98,37,14,124,65,67.
39. Multiprogramming systems ________.

Contact www.kimsharma.co.in for best and lowest cost solution or
Email: solvedstudymaterial@gmail.com
Call: +91 82907-72200 (Call/WhatsApp) or +91 88003-52777 (WhatsApp Only)

Leave a Reply

Your email address will not be published. Required fields are marked *