My Today's paper cs502
chain matrix mul how it works 2
back edge lemma in which we've to prove that there is no back edge 3
time complexity of knapsack algo 5 marks
kruskal's algorithm graph was given and i was asked to write the final output no intermediate steps are required to be written 5
Reduction definition and one example 5
strongly connected components 5
chain matrix mul ,,, a table was given in which 0 was written on the right diagonal... i was to write the next step which cells of table will be filled next to it mark them with ?
mcq's were very easy mostly from graph theory and huffmen encoding
Thanks remember me in your prayers.
0 comments
Post a Comment