- Explain the various types of computer systems.
- Explain how protection is provided for the hardware resources by the operating system.
- What are the system components of an operating system and explain them?
- What are the various process scheduling concepts?
- Explain about inter process communication.
- List five services provided by an operating system. Explain how each provides convenience to the users. Explain also in which cases it would be impossible for user level programs to provide these services.
- Explain the types of system structure in detail.
- Explain in detail about virtual machines.
9. Difference between Hard –Real time systems and Soft-RTS.
10. Describe the functions of OS and its services.
11. Explain in detail about Operating System Structures.
12. Explain the Types of System Calls in detail.
13. Explain System Programs in detail.
14. Give an overview about threads.
15. Explain in detail about the threading issues.
Unit-2
1. Write about the various CPU scheduling algorithms.
2. What is critical section problem and explain two process solutions and multiple process solutions?
3. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores.
4. Explain about critical regions and monitors
5. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, A non preemptive priority
(a smaller priority number implies a higher priority), and RR (quantum = 1) scheduling.
b. What is the turnaround time of each process for each of the scheduling algorithms in part a?
c. What is the waiting time of each process for each of the scheduling algorithms in Part a?
d. Which of the schedules in part a results in the minimal average waiting time (over all processes)?
6. Explain briefly about Readers/Writers problem in classical synchronization implement using critical section.
7. What is the use of monitors for resource allocation?
8. What is the advantage of having different time-quantum sizes at different levels in MFQ-Multilevel Feedback Queue based scheduling.
9. Consider the following snapshot of a system:
Process Allocation Max Available
AB C D A B C D AB C D
P0 0 0 1 2 0 0 1 2 15 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following questions using the banker’s algorithm:
a. What is the content of the matrix Need? Is the system in a safe state?
b. If a request from process P1 arrives for (0, 4, 2, 0), can the request be granted immediately?
10. Write detailed explanation about Multiprocessor scheduling and Real time scheduling.
11. Give a detailed description about deadlocks and its
characterization.
12. Explain about the methods used to prevent deadlocks.
13. Discuss the methods of Deadlock detection and Recovery.
Unit-3
1. Explain about contiguous memory allocation.
2. Give the basic concepts about paging.
3. Explain about the techniques for structuring the page table.
4. Explain the basic concepts of segmentation
5. Given memory partitions of 100KB, 500KB, 200KB, 300KB, and 600KB (in order),how would each of the first-fit, best –fit, worst fit algorithms place processes of 212KB,417KB,112KB, and 426KB(in order). Which algorithm makes the most efficient use of memory?
6. Explain the various page replacement strategies.
7. Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
Ø How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, or seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each.
• LRU replacement
• FIFO replacement
• Optimal replacement
8. How many page faults occur for your algorithm for the following reference string, for four page frames?
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2.
a. What is the minimum number of page faults for an optimal page-replacement strategy for the reference string with four page frames?
9. What is meant by Virtual memory. Give some major benefits which are make applicable.
10. Discuss briefly about Paging with Segmentation in 32-bit architecture Intel80x86 Structure analysis.
11. Discuss about
a) Swapping b) Paging c) Segmentation d) TLB hit/miss
Unit-4
1. What are files and explain the access methods for files?
2. Explain the schemes for defining the logical structure of a directory.
3. Write notes about the protection strategies provided for files
4. Explain in detail about Linked allocation.
5. Explain in detail about Indexed allocation.
6. Write notes about Log-Structured file system.
7. What are the directory implementation techniques available? Explain in detail.
8. Explain in detail about various ways of free space management.
9. Explain in detail about Continuous allocation.
10. Write notes about file system implementation.
11. Explain in detail about file system mounting.
Unit-5
1. Write about the kernel I/O subsystem.
2. Explain the various disk scheduling techniques
3. Write notes about disk management.
4. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from the current head position, what is the total distance ((in cylinders) that the disk arm moves to satisfy all the pending requests, for each of the following disk scheduling
a. FCFS
b. SSTF
c. SCAN
d. LOOK
e. C-SCAN
5. What is meant by RAID levels? Which level is used for what purpose?
6. Analyze Disk arm movement reduced when/which one is effective for given
Queue=87, 170, 40, 150, 36, 72, 66, 15
Starting point of current head is 60.
7. Explain in detail about stable storage and tertiary storage implementation.
8. Write notes on disk attachment.
9. Explain about swap-space management.
10. How does DMA increase system concurrency? How does it complicate the hardware design?
11. Write notes on STREAMS.
0 comments:
Post a Comment