OS Important Question-1

Greater Noida College, Greater Noida
Important Question
CSE 2nd Year
Operating System
1. Define Operating system and mention its major functions.

2. What do you mean by multitasking?
3. Define kernel and names of type of kernel.
4. Explain critical region?
5. Write a short note on inter-process communication.
6. What is process control block?
7. Define scheduling with example.
8. What do you mean by memory management?
9. Define Paging?
10. Explain RAID?
11. Describe in term Directory system.
12. Briefly define the term Real Time Operating System.
13. What do you mean by Concurrent Processes?
14. Define two main functions of an Operating system.
15. Explain the principal advantages of multiprogramming.
16. Define the term busy waiting.
17. Explain starvation problem and its solution.
18. Explain internal and external fragmentation. Describe the typical elements of the process
control block.
19. What are the various scheduling criteria for CPU scheduling?
20. What is the main function of the memory-management unit?
21. Define seek time and latency time.
22. Define SCAN and C-SCAN scheduling algorithms.
23. What is a safe state and an unsafe state?
24. Explain the logical address space and physical address space diagrammatically
25. Explain thrashing and locality of reference.
26. Distinguish between physical and logical address space of a process.
27. Explain various operations associated with a file.
28. Explain tree level directory structure
29. What do we need Scheduling?
30. What are the Performance Criteria in CPU Scheduling?
31. Explain the Logical address space and Physical address diagrammatically.
32. Explain in brief about the Multiprogramming with fixed partitions.
33. What do you mean by the safe state and an unsafe state?
34. What do you mean by the I/O Buffering?
35. Explain in detail about the File system protection and security.
36. Explain in detail about the Process Control Block (PCB) in CPU Scheduling.
37. Explain in detail about the Disk storage and Disk scheduling.
38. Explain in detail about the Mutual Exclusion and Critical Section Problem.
39. Explain in detail about the Multiuser Systems and Multi-Threaded Systems.
40. Discuss the difference between a time-sharing system and real time system.
41. What do you understand by system call? List and explain four system calls used for process
management.
42. Consider the set of processes given in the table and the following scheduling algorithms:
i. Round Robin (Quantum=2)
ii. SJF
Draw the Gantt chart and find the average waiting time and turn-around time for the
algorithms.
Process ID Arrival Time Execution Time
A 0 4
B 2 7
C 3 3
D 3.5 3
E 4 5
43. Explain the various CPU scheduling techniques with Gantt charts clearly as indicated by
(process name, arrival time, process time) for the following (A,0,4), (B,2,7), (C,3,2) and
(D,2,2) for FCFS and SRTF.
44. Define semaphore. Give a scheme for implementation of semaphore primitives.
45. Explain Dining Philosopher problem with its suitable solution.
46. Write short notes on following.
i. File system protection and security
ii. Linked File allocation methods
47. Explain in detail about the Dining Philosopher Problem.
48. Define Process. Explain various steps involved in change of a process state with neat
transition diagram.
49. Explain OS? Define the services provided by the operating system.
50. Describe the Producer-Consumer problem with its suitable solution.
51. Differentiate between user thread and kernel thread. What is thread cancellation?
52. What are the necessary conditions to hold a deadlock in a system?
53. Explain the difference between internal and external fragmentation
54. Explain Batch operating system with example. What is a Critical Section problem? Give
the conditions that a solution to the critical section problem must satisfy.
55. Illustrate the page-replacement algorithms.
i. FIFO
ii. Optimal Page replacement
use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1 for a memory
with three frames.
56. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently serving
the request at cylinder 143,and the previous request was at cylinder 125.The status of the
queue is as follows
86, 1470, 913, 1774,948,1509,1022,1750,130
What is the total distance (in cylinders) that the disk arm moves to satisfy the entire
pending request for each of the following disk-scheduling algorithms?
i. SSTF
ii. FCFS
57. Explain in detail about the Operating System services.
58. Explain in detail about the Threads and their management.
59. Explain the following terms in details.
i. Multiprocessor OS.
ii. Real time system.
iii. Time sharing system.
60. Explain about the concept of File concept. Define in detail about the File organization and
access mechanism.
61. Write and explain Banker’s algorithm for avoidance of deadlock.
62. Given memory partition of 100 K, 500 K, 200 K, 300 K, and 600 K (in order) how would
each of the first-fit, best-fit and worst-fit algorithms place processes of 212 K, 417 K, 112
K, and 426 K (in order)? Which algorithm makes the most efficient use of memory?
63. Define virtual memory concepts and also discuss replacement algorithms in brief.
64. Differentiate between Deadlock and Starvation in detail
65. For the following processes draw a Gantt chart to illustrate the execution using.
i. Pre-emptive priority scheduling.
ii. Non Pre-emptive priority scheduling.
Also calculate average waiting time and average turnaround time.
(Assumption: A larger priority number had higher priority)
Process Arrival Time Burst Time Priority
0 5 4
A
2 4 2
B
2 2 6
C
4 4 3
D
66. Consider the given snapshot of a system with five processes (P0, P1, P2, P3, P4) and three
resources (A, B, C).
Allocation Max Available
A B C A B C A B C
Process/ Resource
1 1 2 4 3 3 2 1 0
P0
2 1 2 3 2 2
P1
4 0 1 9 0 2
P2
0 2 0 7 5 3
P3
1 1 2 11 2 3
P4
i. Calculate the content of Need Matrix.

ii. Apply safety algorithm and check the current system is in safe state or not.
iii. If the request form process P1 arrives for (1, 1, 0) can the request be granted
immediately?
67. Define process and process control block. Also, describe process state transition diagram
in detail.
68. Explain the concept of paging. Also, explain paging hardware support using TLB with
suitable diagram.
69. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently serving
the request at cylinder 143,and the previous request was at cylinder 125.The status of the
queue is as follows 86, 1470, 913, 1774,948,1509,1022,1750,130 What is the total distance
(in cylinders) that the disk arm moves to satisfy the entire pending request for each of the
following scheduling algorithms?
i. SSTF
ii. FCFS
70. Explain in detail about the Inter Process Communication models and Schemes.
71. Explain in detail about the Monolithic and Microkernel Systems.
72. Explain in detail about the Deadlock System model and deadlock characterization.
73. Explain the term RAID and its characteristics. Also, explain various RAID levels with their
advantages and disadvantages.
74. Explain the concept of file system management. Also explain various file allocation and
access mechanism in details.
75. Explain producer consumer problem and its solution using semaphore.
76. Explain dinning philosopher problem and its solution using semaphore.
77. Explain the concept of demand paging. Consider the given references to the following
pages by a program.
0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3
How many pages faults will occur if the program has three page frames available to it and
uses?
i. FIFO replacement
ii. LRU replacement
iii. Optimal replacement
78. Explain the following terms:
i. Multilevel feedback Queue Scheduling
ii. Fixed portioning vs variable partitioning
79. Explain deadlock and necessary conditions for deadlock. Also, explain resource allocation
graph with suitable diagram.
80. Explain the following:
i. Buffering
ii. Polling
iii. Direct Memory Access (DMA)
81. Illustrate the following page-replacement algorithms.
i. FIFO
ii. Optimal Page Replacement
Use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1 for a memory with
three frames.
82. What is an Operating system? Describe the Operating-System Functions
83. Write about monolithic kernel, layered, and microkernel structures of
operating systems.

OS Important Question-1

Uploaded by

Copyright:

Available Formats

OS Important Question-1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

OS Important Question-1

Uploaded by

Copyright:

Available Formats

Greater Noida College, Greater Noida

1. Define Operating system and mention its major functions.

i. Calculate the content of Need Matrix.

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.