1.
Which
of the following approaches do not require knowledge of the system state?
(A) deadlock detection.
(B) deadlock prevention.
(C) deadlock avoidance.
(D) none of the above.
Ans: (D)
2.
Program
generation activity aims at
(A) Automatic generation of program
(B) Organize execution of a program written in PL
(
C) Skips generation of program
(D)
Speedens generation of program.
Ans: (A)
3.
“Throughput”
of a system is
(A) Number of programs processed by it per
unit time
(B) Number of times the program is invoked by
the system
(C) Number of requests made to a program by
the system
(D) None of the above
Ans: (A)
4.
The “blocking factor” of a file is
(A) The number of blocks accessible to a
file
(B) The number of blocks allocated to a file
(C) The number of logical records in one
physical record
(D) None of the above
Ans: (C)
5.
Which
of these is a component of a process precedence sequence?
(A) Process name
(B) Sequence
operator ‘;’
(C)
Concurrency operator ‘,’
D) All of the
above
Ans: (D)
6.
Which
amongst the following is valid syntax of the Fork and Join Primitive?
(A) Fork <label>
(B) Fork <label> Join <var> Join <label>
(C) For
<var>
(D)
Fork <var> join
<var> join
<var>
Ans: (A)
7.
Nested Macro calls are expanded using
the
(A) FIFO rule (First in first out)
(B) LIFO (Last in First out)
(C) FILO rule (First in last out)
(D) None of the above
Ans: (B)
8.
The
expansion of nested macro calls follows
(A) FIFO rule.
(B) LIFO rule.
(C) LILO rule.
(D) priority rule.
Ans: (B)
9.
Which
scheduling policy is most suitable for a time-shared operating system
(A)
Shortest-job First.
(B)
Elevator.
(C) Round-Robin.
(D)
First-Come-First-Serve.
Ans: (C)
10.
A critical section is a program segment
(A) which should run in a certain
specified amount of time.
(B) which avoids deadlocks.
(C) where shared resources are
accessed.
(D) which must be enclosed by a pair of semaphore
operations, P and V.
Ans: (C)
11.
An
operating system contains 3 user processes each requiring 2 units of
resource R .The minimum number of units
of R such that no deadlocks will ever arise is
(A) 4.
B) 3.
(C) 5.
(D) 6.
Ans: (A)
12.
Jobs
which are admitted to the system for processing is called
(A) long-term
scheduling
(B) short-term
scheduling
(C)
medium-term scheduling
(D) queuing
Ans: (A)
13.
____________
is a technique of temporarily removing inactive programs from the memory of computer system
(A)
Swapping
(B) Spooling
(C) Semaphore
(D) Scheduler
Ans: (A)
14.
___________
is a technique of improving the priority of process waiting in Queue for
CPU allocation
(A) Starvation
(B) Ageing
(C) Revocation
(D) Relocation
Ans: (B)
15.
Round robin algorithm is suitable for which type
of systems?
1) Real time systems
2) Embedded
3) Multiprogramming
4) Time sharing
Answer: 4
No comments:
Post a Comment
Thank you for using this blog.