Operating System Set 3 (30 mcqs)

1. The systems which allows only one process execution at a time, are called
a) uniprogramming systems
b) uniprocessing systems
c) unitasking systems

2. In operating system, each process has its own
a) address space and global variables
b) open files
c) pending alarms, signals and signal handlers
d) all of the mentioned

3. In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned

4. A process can be terminated due to
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned

5. What is the ready state of a process?
a) when process is scheduled to run after some execution
b) when process is unable to run until some task has been completed
c) when process is using the CPU
d) none of the mentioned

6. What is interprocess communication?
a) communication within the process
b) communication between two process
c) communication between two threads of same process
d) none of the mentioned

7. A set of processes is deadlock if
a) each process is blocked and will remain so forever
b) each process is terminated
c) all processes are trying to kill each other
d) none of the mentioned
.
8. A process stack does not contain
a) function parameters
b) local variables
c) return addresses
d) PID of child process

9. Which system call returns the process identifier of a terminated child?
a) wait
b) exit
c) fork
d) get
.
10. The address of the next instruction to be executed by the current process is provided by the
a) CPU registers
b) program counter
c) process stack
d) pipe

11. Which module gives control of the CPU to the process selected by the short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned

12. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called
a) job queue
b) ready queue
c) execution queue
d) process queue

13. The interval from the time of submission of a process to the time of completion is termed as
a) waiting time
b) turnaround time
c) response time
d) throughput

14. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned

15. In priority scheduling algorithm
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) equal priority processes can not be scheduled
d) none of the mentioned

16. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of
a) all process
b) currently running process
c) parent process
d) init process

17. Time quantum is defined in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

18. Process are classified into different groups in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

19. In multilevel feedback scheduling algorithm
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned

20. Which one of the following can not be scheduled by the kernel?
a) kernel level thread
b) user level thread
c) process
d) none of the mentioned

21) A monitor is a type of :
a) semaphore
b) low level synchronization construct
c) high level synchronization construct
d) None of these

22) A monitor is characterized by :
a) a set of programmer defined operators
b) an identifier
c) the number of variables in it
d) All of these

23) A procedure defined within a ________ can access only those variables declared locally within the _______ and its formal parameters.
a) process, semaphore
b) process, monitor
c) semaphore, semaphore
d) monitor, monitor

24) The monitor construct ensures that :
a) only one process can be active at a time within the monitor
b) n number of processes can be active at a time within the monitor (n being greater than 1)
c) the queue has only one process in it at a time
d) All of these

25) The operations that can be invoked on a condition variable are : (choose two)
a) wait
b) hold
c) signal
d) continue

26) The process invoking the wait operation is :
a) suspended until another process invokes the signal operation
b) waiting for another process to complete before it can itself call the signal operation
c) stopped until the next process in the queue finishes execution
d) None of these

27) If no process is suspended, the signal operation :
a) puts the system into a deadlock state
b) suspends some default process’ execution
c) nothing happens
d) the output is unpredictable

28) A locking protocol is one that :
a) governs how locks are acquired
b) governs how locks are released
c) governs how locks are acquired and released
d) None of these

29) The two phase locking protocol consists of : (choose two)
a) growing phase
b) shrinking phase
c) creation phase
d) destruction phase

30) The growing phase is a phase in which :
a) A transaction may obtain locks, but does not release any
b) A transaction may obtain locks, and releases a few or all of them
c) A transaction may release locks, but does not obtain any new locks
d) A transaction may release locks, and does obtain new locks

Answers
1-a 2-d 3-a 4-d 5-a
6- b 7-a 8-d 9-a 10-b
11-a 12-b 13-b 14-a 15-a
16-b 17-b 18-d 19-a 20-b
21-c 22-a 23-d 24-a 25-a,c
26-a 27-c 28-c 29-a,b 30-a

Sharing is caring!

Leave a Comment

Your email address will not be published. Required fields are marked *

shares