DOC PREVIEW
UCSD CSE 101 - Homework 1

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Due: Day 8ExercisesCSE 101: Homework 1Due: Day 8When presenting an algorithm, make sure you have:• A clear (pseudo-code) description of the algorithm• A proof that it is correct (loop invariants may help)• An analysis of its runtime (stating the runtime isn’t sufficient, pro-vide a proof or justification).For full credit, you need all three pieces.ExercisesKleinberg refers to the class textbook Algorithm Design by Kleinberg andTardos.1. For the following graph, use Dykstra’s algorithm to determine thedistances from node 1 to each other node. Show the distances in theorder that Dykstra’s algorithm determines them. 10 pts.12345678151089117654612142312. For the previous graph, provide the edges added to the MST in orderusing Prim’s algorithm (starting with node 1) and Kruskal’s algo-rithm. 10 pts.3. Kleinberg Chapter 4, Exercise 2. 10 pts.4. Kleinberg Chapter 4, Exercise 3. 10 pts.5. Kleinberg Chapter 4, Exercise 12. 20 pts.6. Kleinberg Chapter 4, Exercise 19. 20 pts.7. Kleinberg Chapter 4, Exercise 21. 20 pts.8. Kleinberg Chapter 4, Exercise 29. Extra credit, 20


View Full Document

UCSD CSE 101 - Homework 1

Download Homework 1
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Homework 1 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Homework 1 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?