This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS130 B Â¡ D ATA S TRUCTURES AND A LGORITHMS II ' ,6&866,21 6 (&7,21 : ((. Â¡ : 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 Â§Â¨Â© Âª Â« Â¨ Â¬ Â§Â¡Â©Â¡Â Â¬ Â« Â« Â¨ Â§Â¨Â©Â¡Â® Â¨ Â¡ Â¡ Â« Â§Â¨Â©Â¬Â« Â¡ Â¡ Â¡ Â« 3 52%/(0 Â¡Â¢ 0 ,1,080 6 3$11,1* 7 5(( 3 52%/(0 Â¡Â¢ 0 ,1,080 6 3$11,1* 7 5(( 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" 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 3 52%/(0 Â¡ $ Â¢ ' ,.675$ 3ick a starting point and add this to our visited set 3...
View
Full
Document
This note was uploaded on 02/19/2012 for the course ENGR 361 taught by Professor Drexel during the Spring '12 term at Bloomsburg.
 Spring '12
 Drexel
 Algorithms, Data Structures

Click to edit the document details