CS502 Final Term Short Notes by VU Topper RM

Cs-502 Important SubjectiveFor Final Term: Solve By Vu_Toper-RM

All Paid Services Is Available !! · VU · Online Classes + Project · Nothing Is Impossible >> O3224021365 · Where Arise Clique Cover? (pg176)

Answer: The clique cover problem arises in applications of clustering. We put an edge between two nodes if they are similar enough to be clustered in the same group. We want to know whether it is possible to cluster all the vertices into k groups.

Q5. How to get Knapsack optimal solution with dynamic programming algorithm table? (5)

Answer: (Page 96) The algorithm for computing V [I, j] does not keep record of which subset of items gives the optimal solution. To compute the actual subset, we can add an auxiliary Boolean array keep [I, j] which is 1 if we decide to take the itch item and 0 otherwise. We will use all the values keep [I, j] to determine the optimal subset T of items to put in the knapsack as follows: • If keep[n,W] is 1, then n 2 T. We can now repeat this argument for keep [n − 1,W − wn]. • If kee[n,W] is 0, the n 62 T and we repeat the argument for keep[n − 1,W].

What are common problems related to Communication Network and Circuit designing.(2)

Answer: A common problem is communications networks and circuit design is that of connecting together a set of nodes by a network of total minimum length. The length is the sum of lengths of connecting wires.

Diff between Forward And Cross Edge.(2)

tree. Cross edge: (u, v) where u and v are not ancestor or descendent of one another.

Write the computational Time of Bellman ford Algorithm.(2)

Answer: Bellman-Ford applies relaxation to every edge of the graph and repeats this V − 1 times.

How Dijkstra’s algorithm works. (3)

Answer: Dijkstra’s algorithm is a simple greedy algorithm for computing the single-source shortest-paths to all other vertices. Dijkstra‟s algorithm works on a weighted directed graph G = (V, E) in which all edge weights are non-negative, i.e., w(u, v) _ 0 for each edge (u, v) 2 E.

What is polynomial time Algorithms? Give Example (3)

Answer: A polynomial time algorithm is any algorithm that runs in O(nk) time. A problem is solvable in polynomial time if there is a polynomial time algorithm for it What Is Activity scheduling?? Give example (3)

Answer: Activity Selection: The activity scheduling is a simple scheduling problem for which the greedy algorithm approach provides an optimal