some mcqs was from the given file and some was new
Q:is every NP is NP complete?
Q:matrix was given tell the graph is directed or not?
Q:matrix was given tell the graph cantains loop or not?
Q:explain the property of matrix which tell that graph
contain loop or not?
Q:which approach prove tobe optimal for activity
scheduling?
Q:how dijkistra algo works?
Q:basic cases of floyd warshal
Q:2 % marks Qs was scenario was given we have to select
suitable algo
Q:prove the correctness of greedy activity scheduling?
Q:time complexity of prims for extracting vertices from
queue?
Comments
Post a Comment
Please give us your feedback & help us to improve this site.