Documente Academic
Documente Profesional
Documente Cultură
PART - I
Q.2 Analysis which determines the meaning of a statement once its grammatical structure
becomes known is termed as
Ans: (A)
Q.3 Load address for the first word of the program is called
Ans: (B)
Q.4 Symbolic names can be associated with
Ans: (B)
Ans: (B)
Q.6 Shell is the exclusive feature of
Ans: (A)
Ans: (A)
Q.8 Interval between the time of submission and completion of the job is called
Ans: (B)
Q.9 A scheduler which selects processes from secondary storage device is called
Ans: (C)
Q.10 The scheduling in which CPU is allocated to the process with least CPU-burst time
is called
Ans: (B)
Ans: (C)
Q.12 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.
(D) time taken for the job to move from assembly phase to completion phase.
Ans: (C)
Q.13 Which of the following can be used as a criterion for classification of data structures
used in language processing.
Ans: (B)
(A) forced de allocation of the CPU from a program which is executing on the CPU.
Ans: (A)
Q.16 An assembler is
Ans: (C)
Q.17 Which of the following is not a fundamental process state
Ans: (D)
Ans: (C)
Q.19 Which of the following is true?
Ans: (C)
Q.20 Which of the following approaches do not require knowledge of the system state?
Ans: (A)
Ans: (B)
Q.24 Which of the following loader is executed when a system is first turned on or restarted
(A) Boot loader (B) Compile and Go loader
Ans: (C)
Ans: (D)
Q.26 Throughput of a system is
Ans: (A)
Ans: (C)
Ans: (D)
Q.29 Which amongst the following is valid syntax of the Fork and Join Primitive?
Ans: (A)
(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)
Q.31 A parser which is a variant of top-down parsing without backtracking is
Ans: (A)
Ans: (B)
Ans: (D)
(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)
Q.35 Which scheduling policy is most suitable for a time-shared operating system
Ans: (C)
Ans: (C)
Q.37 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)
Q.38 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.
Ans: (B)
(A) Obtain machine code corresponding to the mnemonic from the Mnemonics table
Ans: (C)
Q.40 The syntax of the assembler directive EQU is
Ans: (B)
Q.41 The following features are needed to implement top down parsing
Ans: (D)
Q.44 Which of the following is not a key piece of information, stored in single page table
entry, assuming pure paging and virtual memory
(B) A bit indicating whether the page is in physical memory or on the disk
(C) A reference for the disk block that stores the page
Ans: (C)
(A) Structured into two halves called top half and bottom half
(B) Three equal partitions
(C) Unstructured
Ans: (A)
Ans: (D)
Q.47 Which amongst the following is not a valid page replacement policy?
Ans: (C)
Q.48 Consider a program with a linked origin of 5000. Let the memory area allocated to it
have the start address of 70000. Which amongst the following will be the value to be loaded in
relocation register?
Ans: (A)
Ans: (A)
Q.51 An analysis, which determines the syntactic structure of the source statement, is called
Ans: (C)
Q.52 Action implementing instructions meaning are a actually carried out by
Ans: (C)
Q.53 The field that contains a segment index or an internal index is called
Ans: (A)
Q.55 Jobs which are admitted to the system for processing is called
Ans: (A)
Q.56 A set of techniques that allow to execute a program which is not entirely in memory
is called
Ans: (B)
Ans: (A)
Q.58 Before proceeding with its execution, each process must acquire all the resources
it needs is called
Ans: (A)
Ans: (B)
Q.60 Relocation bits used by relocating loader are specified by
Ans: (B)
Ans: (A)
Q.62 Relocatable programs
Ans: (B)
Ans: (B)
Q.64 The total time to prepare a disk drive mechanism for a block of data to be read
from is its
(A) latency
Ans: (C)
Q.65 To avoid race condition, the maximum number of processes that may be
simultaneously inside the critical section is
(A) zero (B) one
Ans: (B)
Ans: (A)
Ans: (D)
Q.68 In which of the following page replacement policies Baladys anomaly occurs?
Ans: (A)
Q.69 Which of the following are language processors?
Ans: (D)
Ans: (D)
Q.71 Recognition of basic syntactic constructs through reductions, this task is performed
by
Ans: (B)
Ans: (C)
Ans: (A)
Q.74 ___________ is a technique of improving the priority of process waiting in Queue for CPU
allocation
Ans: (B)
Q.75 ________ is the time required by a sector to reach below read/write head.
(A) Seek Time (B) Latency Time
Ans: (B)
Ans: (A)
Ans: (D)