Register

Recent posts tagged iit-interviews

1
IIT Bombay CMinds (AI), Interview Experience 2023
what i know sugest u is to google the same question and visit stackoverflow everey of your queries will be satisfied there . i know t is better but to explain everything ...
User Avatar
6
IIT Kharagpur MS Interview
refer to this:http://math.stackexchange.com/questions/351948/the-basic-of-the-count
User Avatar
8
Various Interview questions for Research programs at IITs/IISC - 2021
https://answers.yahoo.com/question/index?qid=20140423135641AActyxm#
User Avatar
10
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 am given a graph and ...
User Avatar
11
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 unsolvable in...
User Avatar
13
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 present time ...
User Avatar
14
IIT Madras MS Intelligent Systems Interview Experience
(d) cannot be option.i think .both (a) and (b)... rest i dont know...
User Avatar
15
IIT Bombay MS Intelligent Systems Interview Experience
No, Strings of length n, 2n, 3n ... form the same equivalence class.
User Avatar
16
IIT Gandhinagar MTech(Regular) Interview Experience 2021
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...
User Avatar
18
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 = '231...
User Avatar
20
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
22
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
24
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
25
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 , a ve...
User Avatar
26
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...
User Avatar
28
IITs 2020 Interview Experience List
A. Encapsulation http://stackoverflow.com/questions/24626/abstraction-vs-information-hiding-vs-encapsulation
User Avatar
29
IIT Patna M.Tech. Interview Experience List
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...
User Avatar
30
IIT Bhilai Interview Experience List
Longest simple path cannot be computed like this. To understand why you need to know that Dijikstra's algorithm works using Greedy principle. That is, at each vertex we c...
User Avatar
Page: