results will be declared on 17th March. it is better not to discuss ... Everyone did their best ... time to rest ... :P
one of programming question 240 jiska input tha shayd not sure, uska answer kya hai???
mene 5 mark kiya tha :/ 240 wala
#chromatic no :-
Bhai I am quite sure that it will not be 2. It will be more than 2.. and I got 3. If I am not wrong Aisa hi tha kuch..
2 states should be the answer
as state 00 on in=0 was staying on 00
and state 11 on in=1 was staying on 11
@ Pranav Madhani are you talking about the co question ?
Yes, I am kinda very sure that answer for that question was
"Hi Bye Hi bye"
For the verbal ability question's answers eas "Meandering"
And another answer for C Programming was, IMO
'0 ', 'c'
Because, it was clearly written printf("%c %c", ...) Which means whatever you give it, if will convert it to corresponding char.
Thus, not 0 c but '0' 'c' should be the answers.
ADITYA CHAURASIYA 5 I Think producer consumer is D .. PLEASE TELL!!
Pranav Madhani the computer organization prob... 4 types of instruction,...??
oh thanks.. Warlock lord ..:)
Pranav Madhani it's in safe state.
Ryt answer of area of circle
i think ans should be 1/2 pi d
gate available solution
woah ... thank god it had no negative marking ... thank you for clarification @severustux
did anyone solve this apti qn
q = ry p = qx ....
I tried applying log but didn't help
p = qx
r = pz
q = ry
log(p) = x.log(q)
log(r) = z.log(p)
log(q) = y.log(r)
x.y.z = log(p)/log(q) * log(q)/log(r) * log(r)/log(p) = 1
if they asked for the value of x.y.z
solution for knapsack problem
Vgreedy = 44
Voptimal = 60
answer = 60-44 = 16
anyone else got the same ans ?
anyone remember this answer do comment !!!
yes we cant represent but check for full condition. we have to select such strings in in which m=n=p && p !=q. In such case we can push for m pop for n and do nothing for p specifically we have to make p more or less but not equal to q so in stack either p should be there or q should be there.
option m=o and n = p what ever alternate comparision can be solved by linear bounded automata so thats not possible for sure.
sumit goyal 1