1.
Round robin scheduling is essentially the
preemptive version of ________.
1 FIFO
2
Shortest job first
3
Shortes remaining
4
Longest time first
Ans ) 1
2.
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
Ans ) 2
3.
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
Ans ) 1
4.
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
Ans ) 3
5.
Which
is not the state of the process ?
1
Blocked
2
Running
3 Ready
4
Privileged
Ans ) 4
6.
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
Ans ) 2
7.
A program at the time of executing is called
________.
1
Dynamic program
2
Static program
3 Blinded
Program
4 A
Process
Ans ) 4
8.
Shell
is the exclusive feature of
(A) UNIX
(B) DOS
(C) System software
(D) Application software
Ans: (A)
9.
A
program in execution is called
(A) Process
(B) Instruction
(C) Procedure
(D) Function
Ans:
(A)
10.
Interval
between the time of submission and completion of the job is called
(A) Waiting time
(B) Turnaround time
(C) Throughput
(D) Response time
Ans: (B)
11.
A
scheduler which selects processes from secondary storage device is called
(A) Short term scheduler.
(B) Long term scheduler.
(C) Medium term scheduler.
(D) Process scheduler.
Ans:
(C)
12.
The
scheduling in which CPU is allocated to the process with least CPU-burst
time is called
(A) Priority Scheduling
(B) Shortest job first Scheduling
(C) Round Robin Scheduling
(D) Multilevel Queue Scheduling
Ans: (B)
13.
The “turn-around” time of a user job is
the
(A) time since its submission
to the time its results become available.
(B) time duration for which the
CPU is allotted to the job.
(C) total time taken to execute
the job.
(D) time taken for the job to
move from assembly phase to completion phase.
Ans: (C)
14.
Program
‘preemption’ is (
A) forced de allocation of the
CPU from a program which is executing on the CPU.
(B) release of CPU by the
program after completing its task.
(C) forced allotment of CPU by
a program to itself.
(D) a program terminating itself due to detection of an error.
Ans: (A)
15.
Which
of the following is not a fundamental process state
(A)
ready
(B) terminated
(C) executing
(D) blocked
Ans: (D)
No comments:
Post a Comment
Thank you for using this blog.