Consider

the following intermediate Reduced Matrix in one of the step of solving TSP

problem using LC Branch and Bound Approach. The new path length and costs of

next level of nodes in State Space Tree are.

Consider 4

Queen Problem which is an instance of N Queen Problem. How many possible ways

are there to place 4 queens with (i) Attack allowed and (ii) Without any attack

in 4 Queen Problem?

Consider a graph G(V,E) where V is set of vertices and E is the set of edges represented 

using adjacency list.  What is the running time of Prim’s algorithm using priority queue on 

the graph G? 

What

is the advantage of recursive approach than an iterative approach?

Consider Sum

of Subset Problem having n distinct positive numbers represented by w

Let G=(V,E) be a directed graph

with weighted edges (weights can be negative, but no negative-weight cycles).

You are given an algorithm that computes the shortest path distances between

At each step k, the algorithm

updates the distance matrix D

D^(k)[i][j]=min(D(k−1)[i][j],D^(k−1)[i][k]+D^(k−1)[k][j])

Assuming D⁽⁰⁾

[i][j] is

initialized as:

1.0 if i=j

2.weight of edge (i,j) if it

exists

3. ∞ otherwise

Which of the following is TRUE?

Consider the

0/1 Knapsack Problem with knapsack capacity m=16. The four items having weights

as (w