17 votes
121
consider an open address hash table with a total of 10000 slots containing 9800 entries. a) 2b) 3c) 4d) 4.5
4 votes
122
Consider the following c fragment : void DAA(n) { int i,j,k,x=0; for (i=1 ; i <=n ; i++) for (j=1 ; j <= i * i ; j++) { if ( j mod i == 0 ) for ( k = 1 ; k <= j ; k++) x=...
3 votes
123
6 votes
124
Which of the following flip-flops is free from race condition ?(A) T flip-flop(B) SR flip-flop(C) Master-slave JK flip-flop(D) None of the above
3 votes
125
6 votes
126
5 votes
128
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
7 votes
129
Given Language L1 is DCFL and L2 is DCFL ? Then (L1$\cap$L2)c will beRegularDCFLCFLCSL but not CFL
8 votes
130
Is the assertion "This statement is false" a proposition?
4 votes
131
Find regular expression for strings over {a,b}, "starting with any number of a's followed by one or more a's followed by a single b, followed by any number of a's followe...
4 votes
132
Choice of write-through and write back design involves a tradeoff between miss rate and miss penalty.
3 votes
133
23 votes
134
8 votes
135
DFS is done for a graph.So we need a visited array to keep track of cycles.Do we need visited array for DFT of a tree?What is the basic difference between traversal and s...
23 votes
138
How many times is the comparison $i \geq n$ performed in the following program?int i=85, n=5; main() { while (i >= n) { i=i-1; n=n+1; } }$40$$41$$42$$43$
5 votes
139
4 votes
140
T(n) = 1, if n = 1 = T(n-1) + 2^n , otherwise
3 votes
141
A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G}. Which of the following is a candidate key?AABABCAB...
4 votes
142
Consider the graph given below: The two distinct sets of vertices, which make the graph bipartite are:(A) (v1, v4, v6); (v2, v3, v5, v7, v8)(B) (v1, v7, v8); (v2, v3, v5,...
7 votes
143
(a) The set of negative integers is countable.(b) The set of integers that are multiples of 7 is countable.(c) The set of even integers is countable.(d) The set of real n...
3 votes
144
int fun(int n){ int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; }then this function should give O(nlogn).since outer lo...
11 votes
145
8 votes
146
7 votes
147
Use of triple pointer ?
6 votes
148