Scribd
Upload
28 views1 page

CSE2203 - Digital Assignment 2 - G1 - Slot

The document provides instructions for three data structures and algorithms problems: 1) Use Prim's or Kruskal's algorithm to find the maximum spanning tree of a graph by transforming the edge weights and comparing the time complexity to finding the minimum spanning tree. 2) Find the articulation points of a graph using an appropriate graph traversal algorithm and illustrate the step-by-step process. 3) Solve the problem of picking coins from a row to maximize value without taking adjacent coins, using both dynamic programming and greedy approaches, illustrating each and comparing their time complexities.

Uploaded by

Nikita Shakya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
28 views1 page

CSE2203 - Digital Assignment 2 - G1 - Slot

The document provides instructions for three data structures and algorithms problems: 1) Use Prim's or Kruskal's algorithm to find the maximum spanning tree of a graph by transforming the edge weights and comparing the time complexity to finding the minimum spanning tree. 2) Find the articulation points of a graph using an appropriate graph traversal algorithm and illustrate the step-by-step process. 3) Solve the problem of picking coins from a row to maximize value without taking adjacent coins, using both dynamic programming and greedy approaches, illustrating each and comparing their time complexities.

Uploaded by

Nikita Shakya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Digital Assignment 2

CSE2003- Data Structures and Algorithms


Slot:G1 Faculty: Dr.K.Suganthi

1. Use any one of the two minimum spanning tree algorithms prim's/kruskal's to compute a
maximum spanning tree of the graph given below.
A maximum spanning tree is the spanning tree with the largest sum of the edge weights
Explain the necessary transformations involved.
Is there any difference in the time complexity of the algorithms to compute the maximum and
the minimum spanning trees? Justify. ( 3 marks)

2.Find the articulation points of the following graph and justify your answer.(Use the
appropriate traversal algorithm and illustrate step by step procedure) ( 2 marks )

3. Consider that there is a row of n coins whose values are some positive integers c1, c2, . . . , cn,
not necessarily distinct. The goal is to pick up the maximum amount of money subject to the
constraint that no two coins adjacent in the initial row can be picked up. Use Dynamic
programming approach and Greedy approach to solve the problem with illustration and give the
comparison based on time complexity.
Input: coin row of denominations:1,5,2,10,1,2,5,20 ( 5 marks)

You might also like