Register

Recent posts tagged year-wise-interview-experiences

1,389
views
IIT JODHPUR Mtech Interview Questions (2020)
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 ... version of a problem is polynomial solvable and its similar decision version is NP.
User Avatar
1,441
views
IIT JAMMU Mtech Data Science Interview Questions (2020)
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 ... (We are still not sure about the problems in class outside P but in NP).
User Avatar
858
views
IIIT Bangalore MS Written Exam (2020)
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't be solved in polynomial time .
User Avatar
575
views
IIT INDORE MS INTERVIEW QUESTIONS (2020)
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 ... be NP ,since no polynomial time algo is yet known for NP problems as well
User Avatar
329
views
IITs 2008 Interview Experience List
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 = '2310'; )
User Avatar
273
views
IITs 2010 Interview Experience List
Refer to the similar thread below to get answer for this questionhttps://gateoverflow.in/4273/char-pointer-to-access-an-int
User Avatar
321
views
IITs 2012 Interview Experience List
sir that we do in dijkstra as well , there also we chose initially one vertex as source vertex , but there are only V passes .
User Avatar
290
views
IITs 2014 Interview Experience List
Sir,How is the loop nested when we have semicolon at the end of both for loops? Am i missing something ?
User Avatar
384
views
IITs 2016 Interview Experience List
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) )}
User Avatar
470
views
IITs 2017 Interview Experience List
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 ... to check them you need V-1 times ( there is no -ve edge cycle ) .
User Avatar
614
views
IITs 2018 Interview Experience List
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 direct mapping is used and word size 1 byte.
User Avatar
2,917
views
IITs 2020 Interview Experience List
A. Encapsulation http://stackoverflow.com/questions/24626/abstraction-vs-information-hiding-vs-encapsulation
User Avatar
To see more, click for the full list of questions or popular tags.