Recent posts tagged interview-experience

4
refer to this:http://math.stackexchange.com/questions/351948/the-basic-of-the-count
5
Actually to prove a problem to be in NP-complete we always reduce a NP-complete (which is also NP) to it. If we reduce a NP problem to our problem, our problem becomes NP...
8
I just want to confirm whether all optimization problems are in NP or not say to find the shortest path this can be done in polynomial time and If I am given a graph and ...
9
Well, we are not doing this reduction for A, but for B. The reason is not for making problem B unsolvable in polynomial time but rather to realize that B is unsolvable in...
11
Yes Sir thats where I am stuck that when we know that A cannot be solved in polynomial time then what's the point of reducing it to some other algorithm B when it too won...
12
Sir , just one confusion that as u said that we convert one problem which is not polynomial to some other problem because we don't have any solution for the present time ...
13
(d) cannot be option.i think .both (a) and (b)... rest i dont know...
14
No, Strings of length n, 2n, 3n ... form the same equivalence class.
15
Lets follow our checklist one by one to see what property this algebraic structure follows.Closure -yes ($m*n=\max(m,n)$) Output is either $m$ or $n$ whichever is maximum...
17
SQL query will be SELECT cno FROM Completed, Pre-Req WHERE student_no = '2310' GROUP BY cno HAVING pre-Cno IN ( SELECT C.cno FROM Completed AS C WHERE C.student_no = '231...
18
Refer to the similar thread below to get answer for this questionhttps://gateoverflow.in/4273/char-pointer-to-access-an-int
20
sir that we do in dijkstra as well , there also we chose initially one vertex as source vertex , but there are only V passes .
22
Sir,How is the loop nested when we have semicolon at the end of both for loops? Am i missing something ?
24
i am not sure , i just give a try on this :{ p | (&exist;q)(&exist;r) works(p q r) and ( (&forall;y) (works(x y z )^( y = small bank co-operation)) - (&exist;z) (z<r) )}
25
in bellman ford algo v-1 times will give you the shortest path but if there is any -ve edge cycle to check you have to perform 1 more cycle . Why V-1times ? simple , a ve...
27
A. Encapsulation http://stackoverflow.com/questions/24626/abstraction-vs-information-hiding-vs-encapsulation
28
lg *n, (Inverse Ackermann function) is the number of times we can take log repeatedly until we get 1. This function can almost be considered constant for all practical pu...
29
Surely a misprint in question, but don't follow that book for GATE.
30
In topological sort, in the inner loop we consider only "adjacent vertex". So, the complexity at max can be O(|V|2) which happens when |E| = |V|2. In Bellman Ford algorit...