Algorithms Answers

 Find out the assignment and cost of assignment for assigning 6 jobs to 6 persons using Branch and Bound Technique.

Find maximum Benefit in case of Knapsack Problem with Knapsack Capacity is given as 10 for 10 items with their weights and values respectively are (4,15),(3,12),(1,20),(3,40),(2,25),(5,30),(7,35),(2,45),(6,50),(4,16).Also mark the items which lead to the maximum benefit. Solve using Dynamic Programming. 

Find an optimal Parenthesization for 4,8,6,2,5,7,8,3 using Dynamic Programming

Design an Optimal Binary Search Tree for 7 nodes with their probability is given respectively as

(2,8,7,6,4,3,9). Also find the leaf nodes, root, internal nodes, external nodes, height of OBST, Depth

of the last leaf, Level of the second last leaf node

Write short descriptions with simple intuitive illustrations of ONE type of each of the following categories of Clustering algorithms; other than Mac-Queen's (1967) K-means and the Johnson's (1967) Hierarchical clustering algorithms discus. (a) Exclusive clustering (b) Overlapping clustering (c) Probabilistic clustering and (d) Hierarchical clustering

‘”Illustrate how you would cluster the following 10 items using K-means clustering where k=3; A(30kg), B(10kg), C(5kg), D(40kg), E(15kg), F(20kg), G(50kg), H(25kg), I(35kg) and J(45kg)

Design an Optimal Binary Search Tree for 7 nodes with their probability is given respectively as

(2,8,7,6,4,3,9). Also find the leaf nodes, root, internal nodes, external nodes, height of OBST, Depth

of the last leaf, Level of the second last leaf node.

Design an Optimal Binary Search Tree for 7 nodes with their probability is given respectively as

(2,8,7,6,4,3,9). Also find the leaf nodes, root, internal nodes, external nodes, height of OBST, Depth

of the last leaf, Level of the second last leaf node.