1.
T(1) =1 ;
T(n) = T(sqrt(n)) +1;
what is the order ?
2.
matrix multiplication :
M*M it takes 1 call
M^n = M* M^(n-1);
for M^n how many we need to do the Multiplications i mean how many times we have to invoke ?
3.
color theory : graph containing an edge where other edges are distinct .
how many colors we need to use to color the graph : 2 (ans) ( i mean star graph it is )
4.
what are the space complexities for the merge sort and quick sort and heap sort ?
5.
1 question on allegation mixture .
6.
2 points on circle p , q . the radius is r what is the probability that the distance between p and q is less than r ?
7.
R = {A,B,C,D}
A->B
B->C
BC->A
which normal form it is ?
8.
n binary semaphores are there
m processes are there .
to enter into critical section how many ways ?
9.
matching question
1.SMTP 2. DNS 3. TCP 4. PPP
A.APPLICATION LAYER B. TRANSPORT LAYER 3. DATA LINK LAYER 4. NETWORK LAYER
10.
In DBMS
undo-logging , redo-logging, undo-redo logging operations are there .
when we do operations on Abort which operation will invoke ?
11.
subnet mask one question
172.21.26.0/21 by giving like this he asked.
12.
Finding out TLB tag bit question....
13.
ages comparision question...
14.
finding out which type of errors are there in a program ?
i mean whether it is lexical or syntax or semantic error.
15.
another question on networks regarding CSMA/CD to find out no of bits it takes ?
16.
one question on program :
1-(x/1!)+(x^2/2!)-(x^3/3!)-...........so on ...
for this series he gave one program .
term =____?;
sum =0;
for(int i=0;i<n;i++)
{
sum = sum+term;
term = _____?;
}
17.
S-->SS#/SS%/E(epsilon)
which of the following are not the viable prefix ?
a. SS b. SS# c. SSa d. Sa
18.
given one list and we need to find out the complexities
for insert fun and finding the min one wat are the complexities ?
19.
one question on tautology , whether it is satisfiable or unsatisfiable ..
20.
one person need to take 10 pills each pill per day .but he takes 1 or 2 or 3 pills .
in how many he can take the pills to complete it ?
21.
1 question on multiplex
22.
d-order
h-height
n-no of nodes
in a B+ tree clustured one if one new node is inserted in that
then what is the height ?
23.
(A<B) and (A>=B or C=5) ???
true or false or unknown.
24.
P=>q , ~q
what is the equivalent one for this ?
25.
he gave one grammar and asking which string will comes out from that grammar ..
26.
height balanced question on binary search tree ..
I am not posting the exact questions but nearly one , any queries or doubts u can ask ..
regarding interview will update soon .
