CS604 Final Term MCQs Lectures 1-40 by Anie Satti

FREE GUIDANCE

ASSIGNMENTS QUIZ GDB CISCO ASSIGNMENTS WITH 90 -100 PERCENT GUARANTEED MARKS

LEC WATCHING · Cs604 OPERATING SYSTEM LEC WISE · MCQS FROM LEC 1 TO 40 · MOST IMP AND MOST REPEATED MCQS · BY ANIE · Critical Section, Synchronization & Semaphores

Q1. Which of the following is not a requirement for solving the critical section problem?

1. Mutual Exclusion
2. Starvation
3. Progress
4. Bounded Waiting
5. Correct: B

Correct answer: Correct: B

Q2. Peterson’s algorithm is used for:

1. Deadlock prevention
2. Memory management
3. Process synchronization
4. File protection
5. Correct: C

Correct answer: Correct: C

Q3. Which instruction is commonly used in hardware solutions to implement mutual exclusion?

1. ADD
2. LOAD
3. Test-and-Set
4. JMP
5. Correct: C

Correct answer: Correct: C

Q4. What does the wait() operation in a semaphore do?

1. Increments the semaphore
2. Decrements the semaphore
3. Terminates the process
4. Creates a process
5. Correct: B

Correct answer: Correct: B

Q5. A binary semaphore can have values:

1. 0 or 1
2. 0 to 9
3. True or False
4. Any real number
5. Correct: A

Correct answer: Correct: A

Q6. Dining Philosophers Problem is used to demonstrate:

1. File allocation
2. Deadlock
3. Memory leak
4. Paging
5. Correct: B

Correct answer: Correct: B

Q7. A semaphore with an initial value of 1 is called:

1. Counting semaphore
2. Mutex
3. Buffer
4. Thread
5. Correct: B

Correct answer: Correct: B

Q8. Critical section problems arise in:

1. Batch systems
2. Sequential processing
3. Multiprocessing
4. Spooling
5. Correct: C

Correct answer: Correct: C

Q9. The signal() operation in a semaphore:

1. Decreases the counter
2. Blocks the process
3. Increments the counter
4. Terminates the thread
5. Correct: C

Correct answer: Correct: C

Q10. Which of the following is a classical problem of synchronization?

1. Process swapping
2. File indexing
3. Reader-Writer
4. Contiguous allocation
5. Correct: C

Correct answer: Correct: C

Q11. Semaphore operations are performed using:

1. System calls
2. Interrupts
3. Signals
4. Libraries only
5. Correct: A

Correct answer: Correct: A

Q12. Which mechanism allows multiple readers or a single writer?

1. Paging
2. Readers-Writers
3. Contiguous allocation
4. Threading
5. Correct: B

Correct answer: Correct: B

Q13. The critical section can be exited using:

1. return()
2. exit()
3. signal()
4. release()
5. Correct: C

Correct answer: Correct: C

Q14. Which of the following uses a flag array to indicate interest in entering the critical section?

1. Banker's Algorithm
2. Peterson's Algorithm
3. Linked List
4. Memory Table
5. Correct: B

Correct answer: Correct: B

Q15. In a producer-consumer problem, the buffer is usually implemented using:

1. Arrays
2. Semaphore
3. Mutex only
4. Threads
5. Correct: B

Correct answer: Correct: B

Q16. Busy waiting is a problem associated with:

1. Paging
2. Semaphore
3. Spooling
4. Context switching
5. Correct: B

Correct answer: Correct: B