Recent posts tagged year-wise-interview-experiences

What do you mean by a decreasing function???

why you are dividing problem in to 4 parts.can you please explain a bit more

Still a bit confused should we consider best case here or worst case

concatenation is not commutative that's why order matters.

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 ...

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...

does really order matters in every case ??

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...

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 ...

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...

Refer to the similar thread below to get answer for this questionhttps://gateoverflow.in/4273/char-pointer-to-access-an-int

sir that we do in dijkstra as well , there also we chose initially one vertex as source vertex , but there are only V passes .

Sir,How is the loop nested when we have semicolon at the end of both for loops? Am i missing something ?

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) )}

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...

Consider a 8 million word main memory and 256 block cache.Both partitioned into 64 words block.What is the size of additional memory for tags? Size of the cache? consider...

A. Encapsulation http://stackoverflow.com/questions/24626/abstraction-vs-information-hiding-vs-encapsulation