# Week3 - CS130B DATA STRUCTURES AND ALGORITHMS II DISCUSSION...

This preview shows pages 1–12. Sign up to view the full content.

CS°3± B ² D ATA S TRUCTURES AND A LGORITHMS II ' ,6&866,21 6 (&7,21 : ((. ±

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
: 5,77(1 \$ 66,*10(17 ² Ɣ 'ue )riday³ )ebruary ±rd at ´pm Ɣ 7urn in to &6µ±¶b box in the mail room ·+)+ ²µ¶¸¹ Ɣ ´ problems
3 52%/(0 µº & 2,1 & +\$1*( Ɣ 'esign a greedy algorithm to make change with the fewest number of coins ·penny³ nickle³ dime³ quarter¹ Ɣ 3rove it»s optimal Change ³ Quarters ³ Dimes ³ Nickles ³ Pennies ¼¶½ ± ² ´ ¼µ½µ¾ ´ ² ² ¼¶½µ¿ µ µ ² ¼¶½´² µ µ µ ²

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3 52%/(0 ²º 0 ,1,080 6 3\$11,1* 7 5((
3 52%/(0 ²º 0 ,1,080 6 3\$11,1* 7 5((

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3 52%/(0 ²º 0 ,1,080 6 3\$11,1* 7 5((
3 52%/(0 ²º 0 ,1,080 6 3\$11,1* 7 5(( 'oes the shortest path necessarily lie on the 067"

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3 52%/(0 ±º \$ /*25,7+06 ±a¹ (xecute 'ijkstra»s shortest path algorithm on the given graph ±b¹ (xecute 3rim»s minimumºcost spanning tree algorithm and .ruskal»s minimumºcost spanning tree algorithm on the given graph½
3 52%/(0 ± \$ º ' ,-.675\$ 6hortest path from one point to all other points 5equirement! \$ll the edge costs must be positive

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3 52%/(0 ± \$ º ' ,-.675\$ 3ick a starting point and add this to our visited set
3 52%/(0 ± \$ º ' ,-.675\$ /abel all other vertices as having distance infinity ·+ere represented as ºµ¹

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern