IDNO: NAME:

BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI

I SEMESTER 2008-2009
QUIZ 1 – Closed Book
CS C372/IS C362 - Operating System
Weightage: 10 marks
Date: 01/10/2008
Time: 25 Minutes
ENCIRCLE THE CORRECT OPTION
1. If your processor has 64-bit addressing and your system has 4 GB RAM, how much of the
disk you can use as virtual memory?
(a) Entire Hard disk (b) 4 Equal to RAM (c) 12 GB (d) 16 GB
2. In RR CPU scheduling, the average waiting time
(a) Does not depend on time quantum
(b) Depends on time quantum
(c) Independent of order of processes
(d) Is independent of order of processes & time quantum
3. Pick the odd one out:
(a) FCFS (b) RR (c) HRRN (d) VRR
4. Which of the following statement is true?
(a) WFG can be derived from RAG
(b) RAG can be derived from WFG
(c) Both RAG & WFG give the same amount of information
(d) There is no connection between RAG & WFG
5. Void main( )
{
if(!fork( )) if (!fork( )) if (!fork( ));
}

How many new processes are created

by fork calls?
(a) 3 (b) 4 (c) 6 (d) 9
6. Disadvantage of machine instruction based process synchronization is:
(a) Busy waiting is employed (b) Starvation is possible (c) Deadlock is possible (d) ALL
7. Circular wait can be prevented by:
(a) Denying the process a further request
(b) Not allowing mutual exclusion
(c) Defining linear ordering of resource types
(d) Both B & C
8. A safe state is
(a) A state in which there is at least one process that can run to completion
(b) A state where there is a sequence in which all processes can run to completion
(c) A state where the number of resources is less than or equal to number of allocations
(d) None of the above
9. Which of the following statement is true about Unsafe State?
(a) Always leads to a deadlock
(b) Always leads to a circular wait
(c) May lead to a deadlock
(d) Both A & B
10. The return value of the fork( ) system call is:
 (a) The child’s process ID (b) 0 (c) Either 0, or not 0 (d) An error value

11. The SJF scheduling algorithm minimizes the

(a) Time to run a process
(b) Turn around time
(c) Average turn around time
(d) None
12. A program containing race condition will ___________ result in data corruption or som
other incorrect behavior?
(a) Always (b) Sometimes (c) Never (d) None
13. The degree of CPU utilization,
(a) increases with increasing degree of multiprogramming
(b) decreases with increasing degree of multiprogramming
(c) first increase and then decreases with the increasing degree of multiprogramming
(d) first decreases and then increases with the increasing degree of multiprogramming
14. Which of the following statement about semaphore is false
(a) It is an integer that can act as counter
(b) Its value depends on number of resources to be shared
(c) Its value can be greater than 1
(d) It can be used for resource synchronization.
15. A counting semaphore was initialized to 4. Then 28 P(wait) operations and 18 V(signal)
operations were completed on this semaphore. Assume the resulting value of the semaphore
is 0. Then 3 more V(signal) operations occur. What is the value of number of waiting
processes?
(a) 2 (b) 0 (c) 3 (d) 6 (e) None
16. Which of the following statements about monitors is incorrect?
(a) Monitors are used to implement mutual exclusion
(b) Variables declared inside monitors can be used only by local procedures
(c) A local procedure can access variables declared inside as well as those declared outside
the monitor
(d) All of the above
17. The number of operations in system using Bankers algorithm for deadlock avoidance and
having n processes and m resources
(a) Is equal to m x n2
(b) Is less than m x n2
(c) Is equal to n x m2
(d) Is less than n x m2
(e) Is operating system dependent
18. If a process executes signal operation inside the monitor then,
(a) The process must leave the monitor immediately
(b) The process must wait inside the monitor
(c) The process must finish its execution and then leave the monitor
(d) Any of the above
19. Which of the following is not a valid state transition?
(a) New to ready
(b) Ready to running
(c) Ready to exit
(d) Blocked to running
(e) Blocked to exit
20. If n processes are involved in a deadlock, aborting how many processes would resolve the
deadlock
(a) n/2 (b) 1 (c) (n+1)/2 (d) Cannot say