- Type
- Quiz
- Course
- CS604P Operating Systems (Practical)
- Size
- PDF 846 KB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
Preview text
Text from pages 1, 2 of 2. Download the file for all 2 pages.
Q1. A system is said to be in a safe state if _____________________.
Correct answer: processes can finish in some order
Q2. In Logical to Physical Address Translation, how is the 20-bit Physical Address calculated?
Correct answer: (Segment * 16) + Offset
Q3. The Solution of Dining Philosopher Problem is used to avoid __________.
Correct answer: Deadlock condition
Q4. Suppose there are 32 number of frames so number of bits needed for f is:
Correct answer: 5
Q5. In Banker's Algorithm, the system must know the ________ resource demand of each process in advance.
Correct answer: maximum
Q6. In Banker algorithm Max data structure is used. If______, then process Pi can request maximum k instances of resource type Rj.
Correct answer: Max[i,j] = k
Q7. In dining philosopher problem all the five philosophers can do two things ______________.
Correct answer: thinking and eating
Q8. Logical Address generated by the CPU is divided into two parts: a page number (p) and a page offset (d) and is calculated by following formula:
Correct answer: p % d
Q9. In dining philosopher problem, a philosopher can start eating once he has ______chopsticks
Correct answer: 2
Q10. For Logical to Physical Address Translation , which register is used to hold the physical address in memory?
Correct answer: Memory Address Register (MAR)
Related CS604P files
All CS604P files →Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.