Documente Academic
Documente Profesional
Documente Cultură
Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory Hierarchy, Cache
Memory, Direct Memory Access, Multiprocessor and Multicore Organization. Operating system overview-
objectives and functions, Evolution of Operating System.- Computer System Organization-Operating System
PART-A
Structure and Operations- System Calls, System Programs, OS Generation and System Boot.
Computer System Overview
1. Define OS?
2. What is the goal of OS? (or) what are the purposes of OS?
3. List down the function of OS?
4. Define system software and application software?
Memory Hierarchy
5. Draw the memory hierarchy?
Cache Memory
System Calls
33. Why API need to be used rather than system calls? (M/ J 2015)
34. What are the purposes of system programs? ( M/J 2016)
35. Define system call? What are the classifications?
System Boot
Cache Memory
UNIT - 2
Process Scheduling
CPU Scheduling
72. Define the term dispatch latency
73. What are the CPU scheduling criteria?
74. What is the difference between preemptive and non preemptive scheduling?
75. What are the different scheduling algorithm?
Deadlocks.
76. What are the methods for handling Deadlocks?
77. Define starvation
78. What are the classical problems of Synchronization?
79. What is dead lock?Give the necessary conditions for deadlock to occur.(M/J 2013)
(or)
What are the four necessary conditions a system should possess in order to be termed as deadlock?
80. What is bankers algorithm?
81. What is deadlock? What are the schemes used in operating system to handle deadlocks?
PART-B
Processes-Process Concept,
22. Explain in detail about the PCB and process states with diagram?(8M)
Process Scheduling
23. Describe the actions taken by a kernel to context switch between process( 8M)(M/J 2016)
24. Explain in detail about the process scheduling (8M)
25. What are different operations on process?
IPC
26. Explain in detail about the IPC ?(13 M)
Threads
27. Define thread ? write the advantages of thread? Explain in detail about the thread life cycle and its
model(types)?(13 M)
28. Provide two programming examples in which multi threading does not provide better performance than a
single threaded solution ?(8M)(M/J 2016)
29. Explain the different multi threading models along with their issues?(8M)(M/J 2015)
30. Explain thread and SMP management ?(8M)(N/D 2015)
Process Synchronization
31. Explain in detail about the process synchronization(13M)
Locks
32. Explain in detail about the Mutex and locks (8M)
Semophores
35. Show how wait() and signal() semaphore operations could be implemented in multiprocessor environments
using TEST and set() instruction. The solution should exhibit minimal busy waiting .Develope pseudocode for
implementing operations ? (13M) (M/J 2015)
36. Illustrate the semaphore with examples (8M)(N/D 2015)
CPU Scheduling
37. Discuss the different techniques used for evaluating CPU scheduling ?(13M) (M/J 2013)
38. Explain the FCFS , preemptive and non preemptive versions of shortest job first and round robin (time slice
=2) scheduling algorithm with gantt chart for the four process given below. Compare their average turn around
time and waiting time .(13M)(M/J 2015)
Process Arrival time Burst time
P1 0 10
P2 1 6
P3 2 12
P4 3 15
39. Consider the following process with the CPU burst time given in milli seconds
Process Burst time priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
Process are arrived in order p1 ,p2,p3,p4,p5
i)draw the gantt chart to show execution using FIFO,SJF,preemptive priority and round robin
(qunantum=1)scheduling
ii)also calcullate waiting time and turn around time for eacg scheduling algorithm (13 M)(N/D 2015)
40. Consider the following swt of processes , with the length of the CPU burst time givn in milli seconds . all the
five processes arrive at time 0 in the order given .
Burst time
Process
P1 10
P2 29
P3 3
P4 7
P5 12
1)Draw the gantt chart illustrate the execution of these processs using FCFS,SJF and RR(quantum=10ms)
Scheduling
2)calculate the average turn around time and waiting time for each type of scheduling above.(13M)(M/J
2013)
Deadlocks.
41. It is possible to have concurrency but not parallelism ? explain?(8M) (M/J 2016)
42. Discuss the deadlock could be detected in detail .( 8M)(M/J 2015)
43. Consider a system consisting of four resources of the same type that are shared by three processes, each of
which need at most two resources. show that the system is dead lock free.(13M) (M/J 2016)
44. The operating system contains three resources the number of instance of resource type are 7,7,10. The
current resource allocates state is as shown below:
process Current allocation Maximum need
R1 R2 R3 R1 R2 R3
P1 2 2 3 3 6 8
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4
Is the current allocation is safe state ?(8M ) (N/D 2015)
45. Discuss the bankers algorithm for deadlock avoidance with an illustration (13 M)
46. Consider the following snapshot of a system : p0-p4 are 5 processes present and A,B,C,D are the resources .
the maximumneed of a process and the allocated resources details are given below:
Answer the following based on bankers algorithm.
1)what is the content of need matrix?
2)Is the system in a safe state ?
3)if a request from process p1 arrives for(0,2,0)can the request be granted immediately.
UNIT – III
UNIT III STORAGE MANAGEMENT
Main Memory-Contiguous Memory Allocation, Segmentation, Paging, 32 and 64 bit architecture
Examples; Virtual Memory- Demand Paging, Page Replacement, Allocation, Thrashing; Allocating Kernel
Memory, OS Examples.
PART-A
Main Memory
82. Write Memory management function ?
83. What is the difference between physical and logical address?
84. What is the advantages and disadvantages of fixed partition size?
Contiguous Memory Allocation
85. Define Lazy swapper.
86. Define swapping?
87. Differentiate a page from a segment.
88. What is page frame?
89. Define fragmentation ?
90. What is internal and external fragmentation?
91. What is address binding?
92. What is meant by mounting of file?
93. In memory management consider the program named as stack1 which size is 100KB . this program is loaded
in the main memory from 2100 to 2200KB.show the contents of the page map table for the given scenario.
(N/D 2016)
paging
94. Define demand paging in memory management. What are the steps required to handle n page fault in demand
paging? (N/D 2016)
95. What is paging? What are the advantages of paging?
96. What is the difference between paging and segmeantation?
97. What is demand paging ? what are advantages of demand paging?
98. What is a translation look aside buffer used for?
Segmentation
99. What do you mean by page fault?
100. What is virtual memory? Mention its advantages.
101. Differentiate between global and local page replacement algorithms.
102. What is segmentation?
Thrashing
103. Define thrashing(M/J 2015)
104. Mention the significance of LDT and GDT segmentation (M/J 2015)
105. Define swapping.
106. What is segment number and offset?
107. Define locality of reference?
108. Define temporal and spatial locality?
page-replacement algorithms
109. What are the types of page-replacement algorithms?
110. Define be lady’s anomaly.(M/J 2013)
PART-B
Main Memory
51. Explain in detailabout the concept of main memory?
Contiguous Memory Allocation
52. Why are segmentation and paging sometimes combined in to one scheme? Explain in detail with example?
(8M)(M/J 2016)
53. Explain about contiguous memory allocation with neat diagrams. (13)
54. Discuss the given memory management techniques with diagrams (N/D 2015)
55. Discuss segmentation in detail. Compare it with paging.(8)
56. Given memory partition of 100 KB, 500 KB, 200 KB and 600 KB (in order). Show with neat sketch how
would each of the first-fit, best-fit and worst fit algorithms place processes of 412 KB, 317 KB, 112 KB and
326 KB (in order). Which algorithm is most efficient in memory allocation? (13)
Virtual Memory
57. Explain how paging supports virtual memory. With a neat diagram explain how logical address is translated
into physical address. (8)
58. Under what circumstance do page fault occurs ?describe the actions taken by the operating systems when a
page fault occurs(8M)(M/J 2016)
59. Discuss the situations in which the LFU page replacement algorithm generates fewer page fault than the LRU
page replacement algorithm. Also discuss under what circumstances the opposite holds good.(8M) (M/J 2016)
Paging
60. Explain in detail about the concept of demand paging in detail with neat diagram?(13M)
61. Explain the concept of paging in detail with necessary diagrams.(8)
62. Explain FIFO, Optimal and LRU page replacement algorithms with an example reference string.(10)
63. discuss the memory management techniques with diagram (N/D 2015)
i)partition allocation methods (6M)
ii)paging and translation look aside buffer (7M)
64. What do you mean by paging? Discuss in detail about the structure of page tables with appropriate
examples. (13)
65. With a neat sketches , explain how logical address is translated in to physical address using paging
mechanism(13M) (M/J 2015)
Segmentation
66. Explain in detail about the segmentation concept?
thrashing
67. Explain in detail about the concept of thrashing (7M ) (N/D 2015)
68. Consider the following segment table: (16)
Segment Base length
0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96
What are the physical addresses for the following logical addresses?
(1). 0 , 430 (2). 1, 10
(3). 2 , 500 (4). 3, 400
Page Replacement
Mass Storage Structure- Overview, Disk Scheduling and Management; File System Storage-File
Concepts, Directory and Disk Structure, Sharing and Protection; File System Implementation- File
System Structure, Directory Structure, Allocation Methods, Free Space Management, I/O Systems
PART-A
Mass Storage Structure
Allocation Methods
PART-B
Mass Storage Structure
72. Explain in detail about the mass storage structure(13M)
73. Explain in detail about the I/O devices with its types?(8M)
74. Explain in detail about the disk performance parameters?(8M)
75. Explain in detail about the organization of I/O function?(8M)
76. Why is it important to balance file system I/O among the disks and the controllers on a system in a
Disk Scheduling
77. Compare the functionality of FCFS, SSTF,CSCAN, and C-LOOK disk scheduling algorithms with an
example. (16)
79. . Describe the important concepts of application I/O interface. (16)
80. Explain the different types of disk scheduling algorithms with suitable example. (16)
81. On a disk with 200 cylinders numbered 0 to 199, compute the number of tracks the disk arm must move to
satisfy the entire request on the disk queue. Assume the last request received was at track 100. The queue in
FIFO order contains the request for the following tracks 55,58,39,18,90,160,150,38,184. Perform the
computation to find the seek time for the following disk scheduling algorithm.
1)FCFS 2)SSTF 3)SCAN 4)C-SCAN 5)LOOK
Disk Management
82. Explain in detail about the disk management with necessary examples?(13M)
83. Explain about the RAID structure in disk management with various RAID levels of organizations in detail.
organizations? If so , how?
85. Explain the different levels of RAID. (8)
86. Discuss briefly about the various directory structures?(8M) (M/J 2015)
87. Write short notes on free space management (6M )(8M) (M/J 2015)(N/D 2015)
88. Explain the various attributes of a file.(4)
89. Explain linked file allocation methods.(6)
2016)
95. Write short notes on free space management?
(or)
Explain in detail about the concept of virtual file system?(M/J 2015) (6 M)
96. Explain in detail about the file directory and its structure?(13M)(M/J 2013)(M/J 2015)
Directory Structure
UNIT – 5
System Administration
Virtualization- Basic Concepts, Setting Up Xen,VMware on Linux Host and Adding Guest OS.
115. Explain the significance and steps involved in setting up xen,VMware softwares on linux host for
successful virtualization in detail .(13M)(M/J 2015)
116. Explain in detail about the Linux multi function server , DNS Vmware on the Linux host (13M)(N/D
2015)
117. Why is live migration possible in virtual environments but much less possible for a native operating
system ?(7M)(M/J 2016)