{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# 4 - a and resolving ties by the vertex alphabetical...

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

CSCE 350: Data Structures and Algorithms Spring 2010 Homework 4 Solution 03/17/10 1. (0.6 points) Problem 4.4.4. 2. (0.6 points) Problem 4.4.7 (a), (b). 3. (0.6 points) Problem 5.1.3.

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

View Full Document
4. (0.6 points) Use the insertion sort algorithm to sort the list H , O , M , E , W , O , R , K in alphabetical order. H | O M E W O R K H O | M E W O R K H M O | E W O R K E H M O | W O R K E H M O W | O R K E H M O O W | R K E H M O O R W | K E H K M O O R W 5. (0.6 points) Do Problem 5.2.1 part (b) on the following graph. Note that you have to follow the specific instruction in the problem, which is “starting at vertex

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

View Full Document

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

View Full Document

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.

Unformatted text preview: a and resolving ties by the vertex alphabetical order.” 6. (0.6 points) Do Problem 5.2.4 using the above graph. Again, you have to start at vertex a and resolve ties by the vertex alphabetical order. 7. (0.6 points) Problem 5.3.1. 8. (0.6 points) Problem 5.3.5. 9. (0.6 points) Problem 5.5.3. 10. (0.6 points) Problem 5.6.7. Problems for practice: 1. Problem 4.4.1. 2. Problem 4.5.6. 3. Problem 5.1.2. 4. Problem 5.1.7. 5. Problem 5.2.3. 6. Problem 5.5.1. 7. Problem 5.6.8....
View Full Document

{[ snackBarMessage ]}