42 votes
2
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$Which one of the following is FALSE?$T(n)=O(n^2)$$T(n)=\Theta(n \log n)$$T(n)=\Omega(n^2)$$T(n)=O(n \log n)$
0 votes
3
10 votes
6
A relational table Employee (ENo, EName, Dept) has $88$ number of tuples. What will be the result of following SQL statement?SELECT COUNT (ENo) FROM Employee WHERE ENo NO...
2 votes
8
Consider the following Pseudo codemain() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } }Find the total number of processes that will b...
2 votes
11
Minimal finite automata that accepts all strings of a and b where the nth input symbol from right hand side is 'a'a) 2n b)2n c) n d) n+2
5 votes
12
7 votes
13
Let P be a regular language and Q be a context free language such that Q ⊂ P.Which of the following is always regular ?(A) P ∩ Q(B) P-Q(C) Σ* - P(D) Σ* - Q
5 votes
15
15 votes
21
Given the sequence of terms, $\text{AD CG FK JP}$, the next term is$\text{OV}$$\text{OW}$$\text{PV}$$\text{PW}$
16 votes
22
5 votes
26