OPERATING SYSTEM MCQ SET 6


26) The primary job of the operating system of a computer is to ________.
1 Command Resources
2 Manage Resources
3 Provide Utilities
4 Be user friendly
Ans ) 2

27) With the round robin CPU scheduling in a time-shared system ________.
1 Using very large time slice degenerates in to first come first served algorithm
2 Using extremely small time slices improve performance
3 Using extremely small time slices degenerate in to last in first out algorithm
4 Using medium sized time slices leads to shortest request time first algorithm
Ans ) 1

28) Which of the following is a criterion to evaluate a scheduling algorithm?
1 CPU Utilization: Keep CPU utilization as high as possible.
2 Throughput: number of processes completed per unit time.
3 Waiting Time: Amount of time spent ready to run but not running.
4 All of the above
Ans ) 4

29) Which of the following is contained in Process Control Block (PCB)?
1 Process Number
2 List of Open files
3 Memory Limits
4 All of the Above
Ans ) 4

30) Super computers typically employ _______.
1 Real time Operating system
2 Multiprocessors OS
3 desktop OS
4 None of the above
Ans ) 2

1) To schedule the processes, they are considered _________.
a) infinitely long
b) periodic
c) heavy weight
d) light weight
View Answer

Answer : b
None.

2) If the period of a process is ‘p’, then the rate of the task is :
a) p^2
b) 2*p
c) 1/p
d) p
View Answer

Answer : c
None.

3) The scheduler admits a process using :
a) two phase locking protocol
b) admission control algorithm
c) busy wait polling
d) None of these
View Answer

Answer : c
None.

4) The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption.
a) earliest deadline first
b) rate monotonic
c) first cum first served
d) priority
View Answer

Answer : b
None.

5) Rate monotonic scheduling assumes that the :
a) processing time of a periodic process is same for each CPU burst
b) processing time of a periodic process is different for each CPU burst
c) periods of all processes is the same
d) None of these
View Answer

Answer : a
None.

6) In rate monotonic scheduling, a process with a shorter period is assigned :
a) a higher priority
b) a lower priority
c) None of these
View Answer

Answer : a
None.

7) There are two processes P1 and P2, whose periods are 50 and 100 respectively. P1 is assigned higher priority than P2. The processing times are t1 = 20 for P1 and t2 = 35 for P2. Is it possible to schedule these tasks so that each meets its deadline using Rate monotonic scheduling ?
a) Yes
b) No
c) maybe
d) None of these
View Answer

Answer : a
None.

8) If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then :
a) they can be scheduled by EDF algorithm
b) they cannot be scheduled by EDF algorithm
c) they cannot be scheduled by any other algorithm
d) None of these
View Answer

Answer : c
None.

9) A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is :
a) 0.90
b) 0.74
c) 0.94
d) 0.80
View Answer

Answer : c
None.

10) Can the processes in the previous question be scheduled without missing the deadlines ?
a) Yes
b) No
c) maybe
View Answer

Answer : b

 

1) Round robin scheduling is essentially the preemptive version of ________.
1 FIFO
2 Shortest job first
3 Shortes remaining
4 Longest time first
Right Ans ) 1

2) A page fault occurs
1 when the page is not in the memory
2 when the page is in the memory
3 when the process enters the blocked state
4 when the process is in the ready state
Right Ans ) 1

3) Which of the following will determine your choice of systems software for your computer ?
1 Is the applications software you want to use compatible with it ?
2 Is it expensive ?
3 Is it compatible with your hardware ?
4 Both 1 and 3
Right Ans ) 4

4) Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); —; signal(S);signal(Q) and wait(Q); wait(S);—;signal(Q);signal(S); respectively. The above situation depicts a _________ .
1 Semaphore
2 Deadlock
3 Signal
4 Interrupt
Right Ans ) 2

5) What is a shell ?
1 It is a hardware component
2 It is a command interpreter
3 It is a part in compiler
4 It is a tool in CPU scheduling
Right Ans ) 2

6) Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called _________
1 Static loading
2 Dynamic loading
3 Dynamic linking
4 Overlays
Right Ans ) 3

7) In the blocked state
1 the processes waiting for I/O are found
2 the process which is running is found
3 the processes waiting for the processor are found
4 none of the above
Right Ans ) 1

8) What is the memory from 1K – 640K called ?
1 Extended Memory
2 Normal Memory
3 Low Memory
4 Conventional Memory
Right Ans ) 4

9) Virtual memory is __________.
1 An extremely large main memory
2 An extremely large secondary memory
3 An illusion of extremely large main memory
4 A type of memory used in super computers.
Right Ans ) 3

10) The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by __________.
1 Editors
2 Compilers
3 System Call
4 Caching
Right Ans ) 3

11) If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98,37,14,124,65,67.
1 310
2 324
3 315
4 321
Right Ans ) 4

12) Multiprogramming systems ________.
1 Are easier to develop than single programming systems
2 Execute each job faster
3 Execute more jobs in the same time
4 Are used only on large main frame computers
Right Ans ) 3

13) Which is not the state of the process ?
1 Blocked
2 Running
3 Ready
4 Privileged
Right Ans ) 4

14) The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting.
1 The statement is false
2 The statement is true.
3 The statement is contradictory.
4 None of the above
Right Ans ) 2

15) The problem of thrashing is effected scientifically by ________.
1 Program structure
2 Program size
3 Primary storage size
4 None of the above
Right Ans ) 1