CS502 Final Term Past paper August 2016
q=if we solve the Knap-sap algorithm with brute force technique and it takes o(2 ke power n) tfime of execution.can we improve it's eficiency?
Q:2=Do you think greedy algorithm gives an optimal solution to the 0-1 knapsack?
Q:3=briefly describe the criteria for edge slection in greedy algorithm for finiding a minimum spanning tree in the given graph.
Q:4=is it possible that every planner graph can be colord (maps)with three colors in polinomial time?give reason for your choice.?
Q:5=how the Dijkstra's algorithm work?
Q:6=ley the adjocency list represent of an undirected given graph below is there any loop existed in the list .what gemeral property of the list indicates that the graph has a loop.
a_b_c_e
b_a_d
c_a_d_e_f
d_b_c_f
e_a_f_c
f_c_d_e
q=if we solve the Knap-sap algorithm with brute force technique and it takes o(2 ke power n) tfime of execution.can we improve it's eficiency?
Q:2=Do you think greedy algorithm gives an optimal solution to the 0-1 knapsack?
Q:3=briefly describe the criteria for edge slection in greedy algorithm for finiding a minimum spanning tree in the given graph.
Q:4=is it possible that every planner graph can be colord (maps)with three colors in polinomial time?give reason for your choice.?
Q:5=how the Dijkstra's algorithm work?
Q:6=ley the adjocency list represent of an undirected given graph below is there any loop existed in the list .what gemeral property of the list indicates that the graph has a loop.
a_b_c_e
b_a_d
c_a_d_e_f
d_b_c_f
e_a_f_c
f_c_d_e
No comments:
Post a Comment