0 votes
2 answers
1
f(n) + O(f(n)) = Θ(f(n))True or not? Explain please
0 votes
0 answers
2
Option (a) Best fit (b) Next fit (c) First fit
0 votes
3 answers
3
All safe states are deadlock free. But we can go to deadlock with some combination of sequence? So if the question is, from the safe state can we enter deadlock? Ans shou...
1 votes
0 answers
4
0 votes
1 answer
5
CRC can detect any odd number of errors.CRC can detect all burst errors of less than the degree of the polynomial.Please explain and if possible give proof
0 votes
0 answers
6
Every regular set has an LR(1) grammar.What does this line mean??
0 votes
0 answers
7
What is relation between CGF, Regular grammar, CSG, LL(1), LL(k), LR(0), SLR(1), LALR(1), CLR(1).What is the meaning of expressive power? I know thatLR(0)<SLR(1)<LALR(1)<...
0 votes
1 answer
8
0 votes
1 answer
9
In how many ways can 10 similar roses be distributed among 3 girls?In how many ways can 10 different roses be distributed among 3 girls?
0 votes
2 answers
10
2 votes
1 answer
11
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??
2 votes
2 answers
12
How to Construct Full Binary Tree from given preorder and postorder?Thank you.
0 votes
2 answers
13
Is it necessary that euler graph should always be simple graph?
0 votes
2 answers
14
What is the English of both statement∀x((x!=0)→∃y(xy=100))∀x∃y((x!=0)→(xy=100))
1 votes
1 answer
15
dog(x) = x is a dogInt (x) = x is intelligentwrite in logic formNo dogs are intelligent.
0 votes
2 answers
16
P(x,y,z), xy=z, Universe is interger;write in logic formIf xy=x for all y, then x =0.Thank you