Q1. Among the given options, which search algorithm requires less memory?

• Course Name: Data Structures

A. Optimal Search

B. Breadth-First Search

C. Linear Search

D. Depth First Search

Answer: C. Linear Search

Q2. Which of the following is not performance-related?

• Course Name: System Performance

A. System throughput

B. System capacity

C. System availability

D. System response time

Answer: C. System availability

Q3. A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

• Course Name: Operating Systems