Drdo Set 2009
Uploaded by
Navneet KumarDrdo Set 2009
Uploaded by
Navneet KumarB @) A
0
I
0
i
0
1
0
1
o|-|-|o|-Jo]o}o|>
la|-|-lolo}4||o}e
-|-1o|-le|-|S}<}
If the initial state is A =0 and B = 0, what is the minimum length of an input string
‘which will take the machine to the state A = 1 and B = 1 with output 1?
(A) 3 @) 4 © 5 @) 6
‘An 8x1 multiplexer has input A, B and C connected to the selection input
8;, 8 and s, respectively. The data input [po Lare as follows: [,
L=1;
i= =D and |,
implements is
D_ The Boolean function that the multiplexer
(A) £(A,B.C.D) = F(.6,7,9,10,11,12)
(BY (A,B,C, D)= 5(0,3,4,5,1112)
(C) £(A.B.C.D)= 0,3,5,7.9, 1113.15)
(D) FA.BC.D)= $0.1,3-4,5,612)
09-C8-¥-8/36 32.
33.
34.
35.
36.
37.
The size of address bus of a microprocessor is 20 bits and the size of data bus is
8 bits. What is the maximum number of RAM chips of size 64 K x 4 that ean be
comnecied to this microprocessor?
A) 8 B) 16 (© 2% @) 32
Static RAM
(A) isa volatile memory
®) isanon-volatile memory
(C)_needs refreshing to retain the value
(D) contains static information, ic., it cannot be modified
Pick up the correet pair in which the first clement refers to the addressing modes
‘with minimum operand fetching time and the second one refers to the addressing,
modes with maximum operand fetching time.
(A) Register direct and memory indirect,
(B) Register dicect and indexed indirect,
(C) Immediate and indexed indirect.
(D) Immediate and indexed.
While an instruction is executed, the Program Counter (PC) should contain the
address of
(A). the current instruetion (B) the next sequential instruction
(C) the operand (D) the previous instruction
A typical vertical microinstruction format is characterized by
(A) limited encoding with limited parallelism
(B) limited encoding with high degree of parallelism
(©) high degree of encoding with high degree of parallelism
(D) high degree of encoding with limited parallelism
In set associative mapping, the cache is divided into v sets, each of which consists
of k lines. The requited relationships are:
m=vxk andi jmodulo y
where
(A) i= cache line number; j = main memory block number, m= number of lines
in the cache
(B) i = main memory biock number; j = cache set aumbec; m= number of blocks
in main memory
(C) i-=cache set number;
the cache
(D) 4 =cache set number; j = cache line number; m= number of set in the cache
yumber of Hines in
jain memory block number, m
09-CS-¥-9136 38.
39.
41.
42.
43
Consider a memory system that uses a 20-bit address to address at the byte level
and a cache that uses a 256-byte line size. Assume a direct map cache with a tag
field of 6-bit inthe address, The number of blocks in main memory and the number
of lines in cache, respectively, are
(A) 024,128 (B) 409664 = (C) 4096, 128 (D) 8192, 64
The number of entries in an inverted page table
(A) depends on the size of the process.
(B)_ is equal to the number of page frames in main memory.
(©) is equal to the number of page frames in virtual memory.
(D) is equal to the size of the page frame.
‘There are four page frames in the memory. The following sequence of virtual pape
numbers is encountered in the course of execution of a program:
3,4,2, 6 4,7,6,1,3,7.35
Assume that main memory is initially empty and LRU replacement policy is
adopted. The number of page transferred during this sequence of reference is
5 @) 8 © 10 @) 12
The instruction mix in an application and instruction execution speed of a
hypothetical machine are as follows:
Instruction Speed (eyele) Occurrence (%)
ADD 8 30
SHIFT 4 20 c
LOAD 2 30
STORE 12 20
If the clock frequency is 2.3 GHz, the machine performance in MIPS is
(A) 230 @) 250 ) 360 (D) 920
‘The address bus of a computer has 16 address lines, Ajso. If the address assigned to
‘one device is 7CA4i¢ and the address decoder for that device ignores lines As and
‘Ao, What are all the addresses to which this device will respond?
(A) TEAS, TCAS 16 TCAGie and IAT ig
(B) 708446, 709416. 7CAdis and 1CB4ig
(CQ) 7CAti, TDAt«, TEAts and FFAG
(D) 7CA4i, 6CAdig SCA4i¢ and 4CA4 ys
Ackerman’s function is defined recursively on the non-negative integers as
follows
An, A) = nel ig m==0
Alm, n) = Alm-1, 1)
Alm, n) = Alm-l, Alm, n-1})
Using the above definition A(2, 2) equals:
(Ay 2 @) 3 © 6 m 7
09-C3-¥-1036 45.
46,
41.
43.
49.
50.
Consider the following C-function that computes (") :
else returnicombin-1, r) + conbin-1, r-1)):
}
‘How many recursive calls are made to the function “eomb'"?
a () B) (";') © fea) o *)-1
r : rl r
Insert 2, 1, 4, 5, 9, 3, 6 into an initially empty AVL tree. The preorder traversal of
the tee after insertion is,
(A) 4,2,1.3.6.5,9 (B) 1.2.4.3,9.5.6
(©) 3.4,1,2,6,9,5 @) 6,5,2,4,3,1,9
The minimum number of comparisons required to sort a sequence of 5 data tems 1s
(A) 4 (B) 5 © 6 @) 7
A file contains characters a, ¢, 1, 0, u, sand 1 with frequencies 10, 15, 12, 3,4, 13
and I respectively. If we use Huffman Coding for data compression then the
average code i
140 46 130
o @
A)
58. 58. 58 3B
‘A sort method is said to be stable if the relative order of Keys is the same after the
sort as it was before the sort. In which of the following pairs both sorting
algorithms are stable?
(A) Quick-sortand Insertion-sort_ _(B)_Insertion-sort and Merge-sort
(©) Quick-sort and Heap-sore (D) Quick-sort and Bubble-sort
Insert keys 4, 12, 8, 16, 6 18, 14, 7 into an initially empty binary search tree.
Delete the node having the key 6. The preorder traversal after deletion is
(A) 4, 12,7,8,24, 18, 16 @B) 4,12, 8,7, 16 18, 24
(©) 4, 12,8,7,24, 18, 16 @) 4,12, 7,8, 16, 18,24
The minimum number of nodes in an AVL tree of height 10 (assuming a tee of
height 0 is a tee having only 1 node) is
(A) 144 (B) 160 ©) 252 @) 257
09-C3-Y-11/36 31.
52,
53,
Let T be a B-tree of order m and height h. Let = [2] and let n be the number of
elements in 7, Then which of the following is TRUE?
(A) m‘-isn
(B) 2d!" ten
(©) hSlog, (41)
©) vo (2 Jsisn
The maximum number of disk accesses needed for inserting a key into a 2-3 tree of
height fis
A a ®) % Om @) 341
Consider the following program:
void f(int x, int ey, const int 42)
‘
ex
void main()
int a= 22, b= 33, © = 44;
E(a,b.e)s
(242-3, b,c);
print€(‘astd bebd ceBd\nt, a, by od;
:
‘What will be the output of the above program?
Consider the following C-function:
int £(int a, int b)
t
if(ea) retumn(ftb.a));
eles iff b==0) rerurn(a);
elec ratuen(£{b, abh}):
Which of the following will be returned by the function call f[18, 30)?
(a) 2 () 3 © 6 8
09-CS-Y-12/36 55.
56.
38.
Consider the following C-function:
Float £(float x, float y)
(
int iz float 2:
48 (2-°0.0) returs 0.0;
LE (y==0.0) return 1.0)
05
for (iso; icyy itt)
‘Which value will be returned by the function call ((2.0, ~3.0)?
(A) -6.0 By -10 (Q 0.125 @) 15
Consider the following program:
tq7
DHINEE(*m=ta, nea, r=t\n", my ny 21)
What will be the output of the above program?
(A) madd, n= 46,r=45 (B) m=45,n=44,r=45
(C) m=46,n=44r=46 (D) m=46,n=43,r=46
In a C program how many bytes are required to store the string “john’
character array?
(a) 2 (B) 3 © 4 © 5
We have the following recurrence relation:
1 ns5
Ce m5
Then which of the following statement is TRUE?
(A) Teme 00") (B) Tine Qe/n)
(C) Mn)e On) (D) 7(n)e Wnlogn)
09-CS-Y-13/36 39.
1.
62.
63.
‘We have the following recurrence relation:
T(n)
1 a
aeaive a>l
Then which of the following statements is TRUE?
(A) Tee O(n) B) Tine O%n'™’)
(©) Tine @(n*y @) Tie Wn")
‘What is the total number of Hamiltonian Cycles in a complete graph of n vertices?
nl (f=)!
(A) at @) (-1)! © [I oO z
‘What is the upper bound on the number of edge disjoint spanning trees in
complete graph of n vertices?
(A) a @) n-1 © lz] o [3]
Ina graph G = (V, EB) the feedback edge set is the set of the minimam number of
edges whose removal will make the resultant graph acyclic. Then the cardinality of
the feedback edge set for an undirected graph G is
A) El-[M+1 @) El-|}) I= 1 @) M-1
Let A, B and C be languages corresponding to decision problems T1,, [1 and 1.
respectively. Let A be NP-Complete. Then which of the following is NOT TRUE?
(A) AENP.
®) VLENP.L You might also like
