0 votes
32
0 votes
33
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
0 votes
36
Which of the following represents the minimum number of states in DFA for following languageL={ anb | n≥0 } U { bna | n≥1 }a. 5 statesb. 6 statesc. 7 statesd. 8 state...
2 votes
39
between B trees and B+ trees,which one is suited for random and which one is suited for sequential access??please explain
0 votes
41
2 votes
43
Is it compulsory that the block sizes of the main memory and the cache memory are always equal?
0 votes
44
Let L be a Context Free Language. Even(L) is the set of all strings w in L such that |w| is even.What can you say about Even(L)?(a) It will be regular (b) It will b...
2 votes
46
1 votes
47
A condition that is caused by run time error in a computer program is known as a)Fault b)Exceptionc)Syntax errord)Semantic error
2 votes
49
In hash function using linear probing to reduce collision, the number of probes required to insert an item is identical with number of probes needed to retrieve it.is it ...
2 votes
51
3 votes
53
The natural join of 2 tablesa) Cartesian product alwaysb)Combination of Union and filtered Cartesian productc)Combination of Selection and filtered Cartesian productd)Com...
1 votes
54
1 votes
55
0 votes
56
0 votes
57
1 votes
58
0 votes
59
For n=0 : P1 :signal(n);wait(n);CS;signal(n);P2 : wait(n)CSsignal(n);For n=1;P1 :wait(n);CS;signal(n);P2:wait(n);CS;signal(n);Where i am wrong ?