Академический Документы
Профессиональный Документы
Культура Документы
Ans: (D)
18 LRU page replacement policy is
(A) Last Replaced Unit. (B) Last Restored
Unit.
(C) Least Recently Used. (D) Least Required
Unit.
Ans: (C)
19 Which of the following is true?
(A) Block cipher technique is an encryption
technique.
(B) Steam cipher technique is an encryption
technique.
(C) Both (A) and (B).
(D) Neither of (A) and (B).
Ans: (C)
20 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)
21 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)
22 Which amongst the following is not an
advantage of Distributed systems?
(A) Reliability (B) Incremental growth
(C) Resource sharing (D) None of the above
Ans: (A)
23 An imperative statement
(A) Reserves areas of memory and
associates names with them
(B) Indicates an action to be performed
during execution of assembled program
(C) Indicates an action to be performed
during optimization
(D) None of the above
Ans: (B)
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
(C) Bootstrap loader (D) Relating loader
Ans: (C)
25 Poor response time is usually caused by
(A) Process busy
(B) High I/O rates
(C) High paging rates
(D) Any of the above
Ans: (D)
26 Throughput of a system is
49 An assembly language is a
(A) low level programming language
(B) Middle level programming language
(C) High level programming language
(D) Internet based programming language
Ans: (A)
50 TII stands for
(A) Table of incomplete instructions
(B) table of information instructions
(C) translation of instructions information
(D) translation of information instruction
Ans: (A)
51 An analysis, which determines the
syntactic structure of the source statement,
is
called
(A) Sementic analysis (B) process analysis
(C) Syntax analysis (D) function analysis
Ans: (C)
52 Action implementing instructions
meaning are a actually carried out by
(A) Instruction fetch
(B) Instruction decode
(C) instruction execution
(D) Instruction program
Ans: (C)
53 The field that contains a segment index or
an internal index is called
(A) target datum (B) target offset
(C) segment field (D) fix dat
Ans: (A)
54 A program in execution is called
(A) process (B) function
(C) CPU (D) Memory
Ans: (A)
55 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)
56 A set of techniques that allow to execute
a program which is not entirely in memory
is called
(A) demand paging (B) virtual memory
(C) auxiliary memory (D) secondary memory
Ans: (B)
57 SSTF stands for
(A) Shortest-Seek-time-first scheduling (B)
small small-time-first
(C) simple-seek-time-first (D) small-simpletime-first
scheduling
Ans: (A)
58 Before proceeding with its execution,
each process must acquire all the resources
it needs is called
(A) hold and wait (B) No pre-emption
(C) circular wait (D) starvation
Ans: (A)
59 Virtual memory is
(A) simple to implement
(B) used in all major commercial operating
systems
(C) less efficient in utilization of memory
(D) useful when fast I/O devices are not
available
Ans: (B)
60 Relocation bits used by relocating loader
are specified by
(A) Relocating loader itself (B) Assembler or
Translator
(C) Macro processor (D) Both (A) and (B)
Ans: (B)
61 Resolution of externally defined symbols
is performed by
(A) Linker (B) Loader
(C) Compiler (D) Editor
Ans: (A)
62 Relocatable programs
(A) cannot be used with fixed partitions
(B) can be loaded almost anywhere in
memory
(C) do not need a linker
(D) can be loaded only at one specific
location
Ans: (B)
63 Page stealing
(A) is a sign of efficient system
(B) is taking page frames other working sets
(C) should be the tuning goal
(D) is taking larger disk spaces for pages
paged out
Ans: (B)
64 The total time to prepare a disk drive
mechanism for a block of data to be read
from is its
(A) latency
(B) latency plus transmission time
(C) latency plus seek time
(D) latency plus seek time plus transmission
time
Ans: (C)
65 To avoid race condition, the maximum
number of processes that may be
simultaneously inside the critical section is
(A) zero (B) one
(C) two (D) more than two
Ans: (B)
66 The memory allocation scheme subject to
external fragmentation is
(A) segmentation (B) swapping
(C) pure demand paging (D) multiple fixed
contiguous partitions
Ans: (A)
67 Page fault frequency in an operating
system is reduced when the
(A) processes tend to the I/O-bound
(B) size of pages is reduced
(C) processes tend to be CPU-bound
(D) locality of reference is applicable to the
process
Ans: (D)