Cs502 9:30
Explain Activity scheduling
Diagraph making
Optimal solution 0_1for knapsack ko define krna tha
Is kruskals algo is example of minimum spanning tree .define how and why.?
Dijkstra se related bhi ik statment type question tha
Mcq just 50%past se thy
Cs502 9:30
Explain Activity scheduling
Diagraph making
Optimal solution 0_1for knapsack ko define krna tha
Is kruskals algo is example of minimum spanning tree .define how and why.?
Dijkstra se related bhi ik statment type question tha
Mcq just 50%past se thy
Cs502 done alhamdolilah, mcqs about 50% from past kch mcqs kafi tough thy... But luckily subjective was relatively easy
Prims algorithm k 2 questions thy,
dijkstra or bellman ford m difference
warshall se aik question tha... Asymptotic notation se question tha... Edit distance
0 Comments