4 answers
1
3 answers
2
In a company 45 people earn Rs. 20,000 per month, 25 people earn Rs. 30,000 per month, 20 people earn Rs. 40,000, 8 people earns Rs. 60,000 per month and 2 people earn Rs...
0 answers
4
A) 3B) 2C) 1D) 0
1 answer
5
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
2 answers
6
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 answer
10
1 answer
11
Determine the highest normal for relation R(A,B,C,D)AB →CBC→D
0 answers
12
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
6 answers
13
Consider the following relations $A, B$ and $C:$$$\overset{\text{A}}{\begin{array}{|c|c|c|} \hline \text {ID} & \text {Name} & \text {Age} \\\hline\text{12}& \text{Arun}...
1 answer
14
2 answers
15
0 answers
16
2 answers
17
Find the 2's complement pattern for – 113?(1)0001111(2)00001111(3)10001111(4)1110001Correct Answer: 3 Status: unattempted
2 answers
18
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)
9 answers
19
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
1 answer
20
4 answers
21
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 associat...
2 answers
22
0 answers
23
if dijkstra's shortest path algorithm takes 8 seconds for a graph of 1000 nodes then approx. how much time would it take for a graph of 1000000 nodes?
0 answers
26
Suppose both mouse and keyboard issues interrupt t same time. Which source of interrupt will have more priority- Mouse or keyboard? Why?
0 answers
28
Finally what we have to do?Number of subnets? 2^n -2 or 2^n, where n is the number of borrowed bits ?
1 answer
29
Qus 12. A magnitude comparator consists of inputs A[A3 A2 A1 A0] and B[B3 B2 B1 B0]. The total number of comparisons performed for A>B is ______________