Register

iit written test

326 views
0 votes
0 votes

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
SPluto asked May 2, 2019
521 views
IIT Madras MS written test 2019 - Algorithms - 1
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph....
User Avatar
0 votes
0 votes
2 answers
2
utpal podder asked Feb 13, 2019
378 views
iit written test
what is the time complexity to find the determinant of a n*n upper triangular matrix in terms of n?
what is the time complexity to find the determinant of a n*n upper triangular matrix in terms of n?
User Avatar
1 votes
1 votes
1 answer
3
Shreya Roy asked Feb 28, 2017
304 views
IIT Kanpur written
If a graph has k-independent components, it it n-k+1 colorable
If a graph has k-independent components, it it n-k+1 colorable
User Avatar
3 votes
3 votes
1 answer
4
Shreya Roy asked Feb 28, 2017
1,657 views
IIT Kanpur written test
Number of distinct BFS, DFS trees in a complete graph ?
Number of distinct BFS, DFS trees in a complete graph ?
User Avatar
Link Copied!