4 answers
2
7 answers
3
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is$\Theta(n)$$\Theta(\log n)...
5 answers
4
Which of the following graphs has an Eulerian circuit?Any $k$-regular graph where $k$ is an even number.A complete graph on $90$ vertices.The complement of a cycle on $25...
0 answers
8
the sequence is shown, the element at the lowest level?
0 answers
10
0 answers
11
Why here implementation A is wrong.I feel it is correct.
1 answer
12
Here query is not correct if there are two persons with higher rating?Am I correct?
1 answer
13
0 answers
15
please describe in detail I have no idea how to find rank of the node?
0 answers
16
Actually, In this problem what will, we consider getting the answer(upper bound or lower bound) and why?
1 answer
17
2 answers
19
PLEASE GIVE THE CORRECT ANSWER
2 answers
20
8 answers
21
1 answer
24
0 answers
26
0 answers
28
Plzzz explain...
1 answer
29
I can use 4 state dfa for no. of a should be divisible by 4 then minimum = 4 , or we have to construct dfa with 8 states ??
1 answer
30
How many states in dfa of X= { (a+b)* where no of a is divisible by 4 and 8}