1 votes
2 answers
1
why not b) option
0 votes
0 answers
2
i think it should be d) because it is not satisfying same no. of a's and b's constraint on some input like aa,bb.
0 votes
0 answers
3
i am not getting Q3.
0 votes
1 answer
4
2 votes
0 answers
5
Which of the following statements is true?Every complete graph contain Hamiltonian cycleEvery complete graph contain Euler cycleBoth (a) and (b)None of the aboveIt should...
0 votes
0 answers
6
0 votes
1 answer
7
Find the equivalent Tuple Relational Calculus query for the following:R ⟕ S , where R(A, B) and S(A, C) are the relations and ⟕ is the left outer join symbol in Relat...
0 votes
0 answers
8
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative whi...
0 votes
0 answers
9
1 votes
1 answer
10
getting A) given D)
1 votes
1 answer
11
given-13my answer-12plz verify.I0IFIDOFPOWO I1 IFIDOFPOPOWO I2 IFID OFPOWO I3 IFID OFPOPOPOPOWO 123456789101112
3 votes
2 answers
13
plz make the waveform diagram for Q
2 votes
1 answer
14
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of e...
3 votes
2 answers
16
0 votes
0 answers
18
What is the average number of probs requires for unsuccessful search into an open-address hash table with load factor α (assume uniform hashing) .there are two derivatio...
1 votes
1 answer
19
0 votes
0 answers
20