0 votes
1 answer
31
0 votes
2 answers
32
Getting A)
0 votes
1 answer
33
S->AaAb|BbA->εB->εhow can this grammar be left factored grammar?
1 votes
1 answer
34
i am getting mod 6 down counter
0 votes
0 answers
35
consider the sdts(using synthesized attributes)s->aB {out "cat"}s->bA {out "dog"}B->aBB{out "pig"}A->bAA{out "cow"}B->b{out "deer"}A->a{out "lion"}the output for aabb isa...
0 votes
1 answer
36
which is false?a) An unambiguous grammar has same RMD for every sentence.b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the la...
1 votes
1 answer
37
4 votes
1 answer
38
Consider the following system snapshotWhich of the following is a safe sequence?P1, P3, P0, P4, P2P3, P1, P4, P0, P2P3, P4, P1, P0, P2All of these
0 votes
0 answers
39
Consider the effect of using slow start on a line with 5 millisec round trip time and no congestion. The receiver window is 36 KB and the maximum segment size = 2 KB. The...
2 votes
1 answer
41
IP Address=118.35.42.0 subnet mask=255.255.32.0find no. of valid host addresses.
4 votes
1 answer
42
a) a = 169, b = 13 b) a = 144, b = 12 c) a = 169, b = 12 d) a = 144, b = 13my doubt is that as the parameters are passed by reference b should be 169 also.
1 votes
1 answer
43
Brute force algorithm time complexity for subset sum problema) O(N logN) b)O(N^2) c) O(N^2 logN) d) O(2^N)
1 votes
1 answer
46
Consider a relation R(A,B,C,D) and the set of functional dependencies F over the relation R, which is .The highest normal form of Relation R is?(A) 1NF(B) 2NF(C) 3NF(D) ...
0 votes
1 answer
47
Construct dfa for set of all strings where every pair of consecutive 0's occurs before any pair of adjacent 1's ?
1 votes
1 answer
48
Consider the following regular expression (RE) RE = (a+b)*(a+b+ε)aWhich of the following is equivalent to the above RE?a...
0 votes
1 answer
49
R and S are compatible relation .R=9 tuples S=6 tuples.Find minimun and maximum number of tuples in the result R-S.
1 votes
2 answers
50
Which of the following event doesn't effect a process in the running time ?a) Interupt b) exit c) I/O event d)schedular dispatch