Register
Filter

Questions by Ravi_1511

0 votes
1 answer
2
Gate Practice Question
A relational schema R with attributes (ABCDEFG).It is known that D never appears on RHS of any FD.How many different possibilities are there for what a Candidate key of R can be.?
A relational schema R with attributes (ABCDEFG).It is known that D never appears on RHS of any FD.How many different possibilities are there for what a Candidate key of R...
6 votes
1 answer
3
Gate Practice Question
A binary min-heap contains keys 1,2,3,4.....2047,2048 What is smallest key that can be at leaf node.??
A binary min-heap contains keys 1,2,3,4.....2047,2048What is smallest key that can be at leaf node.??
1 votes
1 answer
6
Gate Practice
L1 = {a^nb^nC^n | n>=0} L2 = {a^nb^mc^k | k=m+n , n,m>=0} L1.(L2)* = ??
L1 = {a^nb^nC^n | n>=0}L2 = {a^nb^mc^k | k=m+n , n,m>=0}L1.(L2)* = ??
0 votes
2 answers
7
C programming
a=4 and b=3 printf("%d",a+++b); output.?? My doubt is that we will read from left as a++ or as ++b.
a=4 and b=3printf("%d",a+++b);output.??My doubt is that we will read from left as a++ or as ++b.
3 votes
1 answer
8
Gate Practice Question
int j=0; for(i=0;i<n;i++) { for(i=0;i<2n;i++) { while(j<n) { j++; } } } time complexity.? a.$O(n^{2})$ b.$O(n^{4})$ c.$O(n^{3})$ d.$O(n)$
int j=0; for(i=0;i<n;i++) { for(i=0;i<2n;i++) { while(j<n) { j++; } } }time complexity.?a.$O(n^{2})$ b.$O(n^{4})$ c.$O(n^{3})$ ...
0 votes
2 answers
9
Doubts
An umambiguous grammar has same right most and left most derivation>?? True or false.?
An umambiguous grammar has same right most and left most derivation>??True or false.?
1 votes
1 answer
10
Ace Pregate Question
T(n) = T(n/4) + T(3n/4) + n if n>1 = 1 if n =1 T(n) = ??
T(n) = T(n/4) + T(3n/4) + n if n>1 = 1 if n =1T(n) = ??
0 votes
0 answers
11
Gate Practice Question
Assume bit error of 2*(10^-4).What maximum size block is possible if probability that a block containing an error is to be no longer than 10^-1 ?
Assume bit error of 2*(10^-4).What maximum size block is possible if probability that a block containing an error is to be no longer than 10^-1 ?
0 votes
1 answer
12
Gate Practice Question
for n>=0 , if f(n)<g(n) and h(n)<g(n) . How many of the following are false. ? 1. f(n) is O(h(n)). 2.f(n) is not O(g(n)). 3.f(n)+h(n) is O(g(n)). 4.g(n) is not O(f(n)). 5.f(n)*h(n) is O(g(n)).
for n>=0 , if f(n)<g(n) and h(n)<g(n) . How many of the following are false. ?1. f(n) is O(h(n)).2.f(n) is not O(g(n)).3.f(n)+h(n) is O(g(n)).4.g(n) is not O(f(n)).5.f(n)...
2 votes
3 answers
15
Digital electronics
Given the sequence 010202010 is generated from a sequential circuit of n flip-flops. And these flip-flops generate the sequence respectively. What is the minimum value of n?
Given the sequence 010202010 is generated from a sequential circuit of n flip-flops. And these flip-flops generate the sequence respectively. What is the minimum value of...
1 votes
1 answer
16
Compiler
E -> E+T/T T -> T*F/F F -> id is it LR(1).?
E - E+T/TT - T*F/FF - id is it LR(1).?
0 votes
1 answer
18
Gate Practice questions
If the set of all words over alphabet S is countable then Any language over S must be finite. at least one language over must be uncountable. any language over S is countable. each language over S is finite
If the set of all words over alphabet S is countable thenAny language over S must be finite.at least one language over must be uncountable.any language over S is countabl...
0 votes
1 answer
19
Gate Practice Question
An NFA has 11 states of which 5 are final .If we convert this NFA into DFA atmost how many states can be final states ?
An NFA has 11 states of which 5 are final .If we convert this NFA into DFA atmost how many states can be final states ?
0 votes
1 answer
20
Gate practice question
True or false 1. b*a* intersection a*b* = a* union b* 2. If L is regular, the minimum state DFA for both L and ~L(complement) have same number of states.
True or false1. b*a* intersection a*b* = a* union b*2. If L is regular, the minimum state DFA for both L and ~L(complement) have same number of states.
Page: