QuizFree
GATE CS Practice: Operating Systems
This includes
- 10 questions · 10 marks
- 20 minutes
- Language: English
About quiz
10 questions on CPU scheduling, deadlocks, synchronisation, paging and virtual memory, in the style of GATE CS Section 8. Worked solutions after you submit.
Test details
10Questions
10Marks
20 minDuration
1Sections
10 questions · 1 mark each · no negative marking. Solutions are shown after you submit.
Practice questions
Pick an answer and check it instantly
Q1. Which CPU scheduling algorithm can cause long processes to starve? (1 mark)
Q2. Three processes each need at most 2 instances of a resource. What is the minimum number of instances that guarantees no deadlock? (1 mark)
Q3. A system uses 32-bit virtual addresses and 4 KB pages. How many entries does a single-level page table need? (1 mark)
Q4. Belady's anomaly (more frames causing more page faults) can occur with which page replacement policy? (1 mark)
Q5. Which of these is NOT one of the four necessary conditions for deadlock? (1 mark)
Q6. A program calls fork() three times in a row (no conditions) and then calls printf("hello\n"). How many times is "hello" printed? (1 mark)
Q7. A counting semaphore S starts at 5. Seven P (wait) and four V (signal) operations are performed. What is the final value of S? (1 mark)
Q8. TLB access takes 10 ns, a memory access 100 ns and the TLB hit ratio is 90%. With single-level paging, what is the effective memory access time in ns? (1 mark)
Q9. Thrashing is mainly caused by: (1 mark)
Q10. Round Robin scheduling with a very large time quantum behaves like: (1 mark)
Comments (0)
Login to comment.
