1
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
2
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?
1 vote
3
4
5
Find the 2's complement pattern for – 113? (1) 0001111 (2) 00001111 (3) 10001111 (4) 1110001 Correct Answer: 3 Status: unattempted
6
What is the time complexity of Huffman coding using heap tree data structure ? a) O(n) b) O(n log n) c) O(log n) d) O(n2)
7
46 bit Virtual addressing system uses 3 level paging. The page table entry is 32 bits. Size of Page Table is equal to 1 page. The processor uses 1 MB, 16 way set associative cache with 64 block. What is the size of Page Table? a) 2KB b) 4KB c) 8KB d) 16KB
1 vote
8
9
10
11
What will be the output$?$ int main() { int varl = 35,*var2,*var3; var2 = &var1; //suppose the address of var1 is 1006 var3 = var2; *var2++ = *var3++; var1++; printf("var1 = %d var2 = %d var3 = %d ",var1,var2,var3); return 0; } 36 1010 1010 38 1006 1006 37 1006 1010 38 1010 1006
12
Number of final states in minimal DFA where $\sum = \{ a,b \}$ $L = \{ w| n_a(w)mod\ 3 \geq n_b(w)mod\ 2\}$
13
Please Explain How Q1 and Q2 are equal using state Minimization Technique State Equivalance Algorithm Table Filling Algorithm a b Q1 Q2 Q1 Q2 Q1 Q2
14
Consider the following schedule: The possible values of P & Q for which the above schedule is allowed under Thomas write rule but not under basic timestamp ordering protocol if timestamp(T2 )>timestamp(T1 ) W(B),W(C) W(A),W(A) Both (a)&(b) None of these
15
1 vote
16
17
Define init (L) = {set of all prefixes of L} Let L = {w | w has equal number of 0’s and 1’s}, Ʃ = {0,1} init (L) is: (a) all binary strings with unequal number of 0’s and 1’s (b) all binary strings with ԑ-string (c) all binary strings with exactly 1 more 0’s than the number of 1’s or one more than number of 0’s (d) None of above
1 vote
18
19
If L is Turing-recognizable. Then (a) L and ̅L must be decidable. (b) L must be decidable but ̅ L need not be. (c) Either L is decidable or ̅ L is not Turing recognizable. (d) None of above.
20
How many flip‐flop will be complemented in a 10‐bit binary ripple counter to reach the next count after the following counts? (a) *1001100111
1 vote
21
getting A) given D)
22
$L_{1}=\{a^nb^mc^md^n | m,n \geq 1\} \\ L_{2}=\{0^p1^q\ |p > q\geq 0\} \cup \{0^p1^q\ |q > p\geq 0\} \\ L_{3} = L_1 \cup L_2 \\ L_{4} = L_1L_2$ Then which of the following is necessarily CFL? $A. L_{3} \cap L_{4} \\ B. \overline{L_{3} \cap L_{4}} \\ C.\overline L_3 \cap L_4 \\ D. L_3.L_4$