1. Distinguish between the client–server and peer-to-peer models of distributed systems.
2. What are the differences between the system calls and library functions?
3. Describe some of the challenges in designing operating systems for mobile devices
compared to designing operating systems for traditional PCs.
4. Describe the differences between symmetric and asymmetric multiprocessing. What are
three advantages and one disadvantage of multiprocessor systems?
5. Why an operating system is called resource manager?
6. Explain Micro Kernels, Client Server Model,
7. Virtual Machines, Exo kernels
8. List and explain categories of s/m progs.
9. How s/m calls used.explain with an exle
10. Define os. Explain any 6 services provide by os to the user.
11. Define virtual m/c. discuss benefits of vm.
12. Explain multi prog and multi tak.
13. Explain different multithreading models.
14. Explain diff scheduling criteria that must be kept in mind while choosing a scheduling
alg.
15. Discuss issues in designing multithreading.
16. Illustrate with a neat diagram PCB.
17. Distinguish b/w IPC.
18. EXPLAIN dining philosophers problem.
19. Consider following processes with length of CPU burst time in milliseconds
i. Process Burst time
ii. P1 8
iii. P2 12
iv. P3 4
v. P4 2
b. All process arrived in order p1, p2, p3, p4 all time zero.
a) Draw Gantt charts illustrating execution of these processes for
SJF.
b) Calculate Waiting time and Turnaround time for each process.
20. Explain Layered Systems with adv and disadv
21. What is thread? Explain benefits of multithreaded programming with an example.
22. . Distinguish between the different types of process schedulers.
23. Priority Scheduling may result in starvation. Why it causes starvation? Propose a
24. solution to overcome starvation.
25. . Write a program to create a process. Ensure that child process is executed before
26. the parent process. Display the process id of the child process.
27. Illustrate with an example Peterson’s solution for a critical section problem. Also prove
mutual exclusion property is preserved.
28. What is a semaphore? What are the different operation and types that can be performed
on semaphore.
29. What is critical section? What are the requirements to be satisfied by any critical section
problem Consider the following snapshot-
i. Allocated Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 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
b. Answer the following questions using banker’s algorithm:
c. What are contents of matrix end? Is the system in safe state?
d. If request for process p1 arrives for (0,4,2,0) .Can the request be granted
immediately?
30. Explain deadlock with its necessary conditions.
31. Explain race condition.
32. Explain producer consumer problem.
33. Explain types of fragmentation.
34. Explain logicall and physical address.
35. Explain copy on write and thrashing.
36. Explain allocation of frames in virtual m/y management.
37. Steps in handling page fault.
38. Explain deadlock avoidance using banker’s algorithm in details.
39. Explain Demand Paging ? explain the steps in handling page fault with a neat diagram.
40. What is segmentation? Explain the basic segmentation method.
41. . Consider the following reference string 7 0 1 4 0 3 2 4 2 3 1 3 2 1 2 0 7 for memory
with 3 frames, How many page faults would occur for OPTIMAL and FIFO page
replacement algorithms.
42. 20 describe contiguous memory allocation in memory management.
43. 21. in a variable partition m/y management tech what strategy is used to allocate
m/yot the process from a set of free holes? Explain with an example.
44. What is virtual memory? How it is implemented in demand paging.
45. write a short note on access matrix.
46. Given the following sequences: 95,181, 44,109, 11,123, 62, 64 with the head initially at
track 50 and ending at track 199, what is the total disk traveled by the disk arm to satisfy
the request using FCFS,SSTF,LOOK and CLOOK.
47. write a brief note on free space management.
48. explain working of SSTF and FCFS alg.
49. describe disk management in detail.
50. list and explain different file allocation methods.
51. Explain goals and principles of protection.
52. Operations performed on file
53. Describe tree structured directory.
54. Diff file allocation methods.
55. Explain any disk scheduling methods.
56. Free memory holes of sizes 15K, 10K, 5K, 25K, 30K, 40K are available. The processes of
size 15K, 8K, 30K, 25K is to be allocated. How processes are placed in first fit, best fit,
worst fit. Calculate internal as well as external fragmentation.
57. Given the following sequences: 95,181, 44,109, 11,123, 62, 64 with the head initially at
track 50 and ending at track 199, what is the total disk traveled by the disk arm to satisfy
the request using FCFS,SSTF,LOOK and CLOOK.
58. Let the page reference string be: 1, 2, 5, 4, 5, 3, 2, 1 ,6,7,4,7,8,9,5,8,3,6. Four frames are
allocated for the program in main memory. Determine the number of page faults in for
the following algorithms: i. Least Recently Used ii. Optimum Page replacement.
59. Explain the concept of Address binding, with a neat labeled diagram.
60. Consider the following reference string 7 0 1 4 0 3 2 4 2 3 1 3 2 1 2 0 7 for memory with
3 frames, How many page faults would occur for OPTIMAL and FIFO page replacement
algorithms.
