OS Pre Placements
OS Pre Placements
o Answer: B
o C) When a process does not have enough frames for its active pages
o Answer: C
3. Which of the following best describes the impact of thrashing on system performance?
o Answer: C
o A) Locality Model
o B) FIFO Model
o D) LRU Model
o Answer: A
5. In the working set model, what does a process's locality refer to?
o Answer: B
Virtual Memory
o Answer: A
7. In virtual memory systems, what does the term 'paging' refer to?
o Answer: B
o Answer: B
o Answer: B
o Answer: B
Page Replacement Algorithms
11. Which page replacement algorithm replaces the oldest page in memory?
o B) First-In-First-Out (FIFO)
o C) Optimal
o D) Random
o Answer: B
o A) When increasing the number of page frames results in a higher page fault rate
o Answer: A
o A) FIFO
o B) LRU
o D) Second Chance
o Answer: C
o Answer: A
15. The Second Chance page replacement algorithm is a modification of which algorithm?
o A) LRU
o B) FIFO
o C) Optimal
o D) Random
o Answer: B
Segmentation
o Answer: B
o Answer: B
o A) No external fragmentation
o Answer: C
o B) External fragmentation
o C) Complexity in addressing
o D) Reduced performance
o Answer: B
o A) Only paging
o B) Only segmentation
o Answer: C
Process Management
o A) A program in execution
o B) A set of instructions
o C) A type of hardware
o Answer: A
o A) New
o B) Ready
o C) Running
o Answer: D
o Answer: C
o A) To manage memory
o Answer: B
o Answer: D
CPU Scheduling
o C) To optimize throughput
o Answer: D
o B) Unlimited time
o D) No time at all
o Answer: A
o A) Round Robin
o C) Priority Scheduling
o Answer: B
o Answer: A
o Answer: A
Synchronization
o Answer: A
o A) Mutex
o B) Semaphore
o C) Monitor
o Answer: D
Synchronization
o Answer: A
o A) A state where processes cannot proceed because they are waiting for each other
o Answer: A
36. Which of the following conditions is NOT necessary for a deadlock to occur?
o A) Mutual exclusion
o C) Preemption
o D) Circular wait
o Answer: C
o Answer: B
o A) Mutex
o B) Semaphore
o C) Condition Variable
o Answer: D
Memory Management
o Answer: B
o Answer: B
42. Which type of fragmentation occurs when free memory is divided into small blocks?
o A) Internal fragmentation
o B) External fragmentation
o C) Memory pooling
o Answer: B
o Answer: B
File Systems
o Answer: A
o A) Name
o B) Size
o C) Location
o D) Process ID
o Answer: D
o Answer: B
47. In which type of file allocation does the file system allocate contiguous blocks of disk
space?
o A) Linked allocation
o B) Indexed allocation
o C) Contiguous allocation
o Answer: C
o A) FAT32
o B) NTFS
o C) ext3
o D) Both B and C
o Answer: D
I/O Management
o D) To schedule processes
o Answer: B
50. Which of the following I/O techniques allows a program to continue executing while
waiting for I/O operations to complete?
o A) Blocking I/O
o B) Non-blocking I/O
o C) Polling
o D) Direct I/O
o Answer: B
o Answer: A
o Answer: D
o Answer: A
Advanced Concepts
o C) To execute applications
o Answer: B
o A) Linux
o B) Windows NT
o C) QNX
o D) UNIX
o Answer: C
o Answer: B
57. Which type of operating system allows multiple users to share resources simultaneously?
o A) Real-time OS
o B) Batch OS
o C) Time-sharing OS
o D) Network OS
o Answer: C
o D) To allocate memory
o Answer: B
General Knowledge
o A) Batch OS
o B) Time-sharing OS
o C) Resource management OS
o D) Real-time OS
o Answer: C
o Answer: B
o Answer: B
o D) Priority Scheduling
o Answer: B
o Answer: B
o Answer: B
o B) To reduce the number of disk I/O operations by caching frequently accessed data
67. Which scheduling algorithm is based on assigning a fixed time slice to each process?
o D) Priority Scheduling
o Answer: C
o Answer: B
Virtual Memory
69. What does the term 'paging' refer to in the context of virtual memory?
o Answer: B
o D) To handle interrupts
o Answer: B
o B) To define who can access certain resources and what actions they can perform
o C) To schedule processes
o Answer: B
o A) Segmentation
o B) Data encryption
o C) Compression
o D) Paging
o Answer: A
o Answer: B
o Answer: B
o Answer: B
77. Which protocol is used for sending error messages and operational information on a
network?
o A) TCP
o B) IP
o C) ICMP
o D) FTP
o Answer: C
o Answer: A
o Answer: B
o Answer: B
o Answer: B
Miscellaneous
82. Which of the following is a command used to display the current working directory in a
Unix/Linux environment?
o A) cd
o B) pwd
o C) ls
o D) dir
o Answer: B
o Answer: A
o C) To schedule tasks
o Answer: A
85. Which type of user interface allows users to interact with the operating system using
graphical elements?
o Answer: B
86. In the context of operating systems, what does 'virtualization' refer to?
o D) Encrypting data
o Answer: B
o A) Windows
o B) Android
o C) iOS
o Answer: D
o Answer: B
89. Which of the following can be a consequence of not managing system resources
effectively?
o Answer: B
PROBLEMS:
Shortest Job First (SJF)
1. In the Shortest Job First (SJF) scheduling algorithm, how is the next process to be executed
determined?
o Answer: B
2. Which of the following is a disadvantage of the Shortest Job First (SJF) scheduling algorithm?
o C) It is easy to implement
o Answer: A
o Process P1: 6 ms
o Process P2: 8 ms
o Process P3: 7 ms
o Process P4: 3 ms
o What is the average waiting time using the SJF scheduling algorithm?
o A) 5.5 ms
o B) 7 ms
o C) 6 ms
o D) 4.5 ms
o Answer: A
o Calculation:
Waiting times: P4 = 0, P1 = 3, P3 = 9, P2 = 16
4. In the Round Robin scheduling algorithm, what happens if a process does not finish within its
time quantum?
o A) It is terminated immediately
o D) It is paused indefinitely
o Answer: B
o C) It prevents starvation
o D) It is easy to implement
o Answer: B
6. Consider the following processes with burst times and a time quantum of 4 ms:
o Process P1: 8 ms
o Process P2: 4 ms
o Process P3: 9 ms
o Process P4: 5 ms
o What is the average turnaround time using the Round Robin scheduling algorithm?
o A) 11.75 ms
o B) 12.5 ms
o C) 13 ms
o D) 10 ms
o Answer: A
o Calculation:
Deadlock
o A) Mutual Exclusion
o C) Preemption
o D) Circular Wait
o Answer: C
8. In a system with 3 processes and 2 resources, if each process holds 1 resource and is waiting
for 1 more resource, what is the system experiencing?
o A) Starvation
o B) Deadlock
o C) Thrashing
o Answer: B
o C) Ensuring that at least one of the necessary conditions for deadlock cannot hold
o Answer: C
10. Which algorithm is used to avoid deadlocks by ensuring that the system is always in a safe
state?
o A) First-Come, First-Served
o B) Banker's Algorithm
o D) Round Robin
o Answer: B
11. If there are 5 processes and 3 resources in a system, how many additional resources must be
available to ensure the system is deadlock-free?
o A) 1
o B) 2
o C) 3
o D) 4
o Answer: B