Time Left - 10:00 mins

Greedy Method

Attempt now to get your rank among 62 students!

Question 1

Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?

Question 2

If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?

Question 3

Of the following given options, which one of the following is a correct option that provides an optimal solution for 4-queens problem?

Question 4

Which of the following problems is NOT solved using dynamic programming?

Question 5

Let G be an undirected connected graph with distinct edge weight. Let E_max be the edge with maximum weight and E_min the edge with minimum weight. Which of the following statements is false?

62 attempts
0 upvotes
0 comments

Tags :

GATE & PSU CS Algorithms

Jul 5GATE & PSU CS