Operating System-SET 03

“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)

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)

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)

A parser which is a variant of top-down parsing without backtracking is

(A) Recursive Descend.          (B) Operator Precedence.

(C) LL(1) parser.                    (D) LALR Parser.

Ans: (A)

The expansion of nested macro calls follows

(A)  FIFO rule.                                (B)  LIFO rule. (C)  LILO rule.          (D)  priority rule.

Ans: (B)

A linker program

(A)  places the program in the memory for the purpose of execution.

(B)  relocates the program to execute from the specific memory area allocated to it.

(C) links the program with other programs needed for its execution. (D)  interfaces the program with the entities generating its input data.

Ans: (C)

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)

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)

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)

Locality of reference implies that the page reference being made by a process

(A) will always be to the page used in the previous page reference.

(B) is likely to be the one of the pages used in the last few page references. (C) will always be to one of the pages existing in memory.

(D)will always lead to a page fault.

Ans: (B)

The syntax of the assembler directive EQU is

(A)  EQU <address space>              (B)  <symbol>EQU<address space> 

(C)  <symbol>EQU                                  (D)  None of the above

Ans: (B)

Please Share it! :)