0 votes
1
in a sorted array of n distinct element finding i th largest element take o(1) . true / false
0 votes
2
In DFA, does each state need to have transition on "EACH" input alphabet?The answer was given "False" but I dont think so. Can anyone explain?Because if this statement is...
0 votes
3
output?
0 votes
6
Which of the following statements are correct and why.....?Every regular set has LR(1) grammarEvery regular grammar is LR(1).
0 votes
8
Is there a chance for Deadlock in Graph based protocol?
1 votes
9
Given answer is yes but i think should not be LL(1)
0 votes
11
Is differential equation the part of gate cs 2018 syllabus???
0 votes
12
Let a cluster of stations share 48Kbps of pure Aloha channel. Every station outputs frames of length 1024bits on an average of every 50seconds. Then what is the maximum v...
1 votes
13
The selling price of table is 4/5 times its cost price .the gain % is?????
0 votes
14
Is it true that for any nfa M = (Q,Σ,δ,q 0 ,F) the complement of L(M)is equal to the set {w ∈ Σ * : δ *(q 0 ,w) F= Ø}?
1 votes
15
#I am confused in the language (iv) . Someone please explain.
0 votes
16
Space complexity = input size + extra spaceSo, heap sort also takes input of an 'n' size array.Does this mean that space cost of heap sort algo is O (n).
0 votes
17
We need to sort 7 numbers each of 4 digits. What is the number of comparisons in worst case . Options are as follows:1) 402) 383) 474) 280