Homework 1 - 1 a b c d f e k h g j m n o Section 8.6 10....

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework One CS 291 : Discrete Structures II Winter 2004, VOB, ref. no. 14136 Due date: Feb. 10, Tuesday, in class There are 13 problems with 10 points each. Section 8.2 1. Page 555, Exercise 26 2. Page 556, Exercise 34 3. Page 556, Exercise 42 Section 8.3 4. Page 565, Exercise 38 5. Page 565, Exercise 40 Section 8.4 6. Page 575, Exercise 18(b) Section 8.5 7. Page 589, Exercise 10 8. Page 589, Exercise 28 9. Read the solution for Exercise 55, and then Prove the following graph does not have a Hamiltonian cycle.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 a b c d f e k h g j m n o Section 8.6 10. Use the Dijkstra's algorithm to find the shortest path from a to z for the following graph. The initialization is given in the graph. You need to show detailed steps. a b c d e f g z 5 3 6 3 10 9 4 8 3 12 7 + ∞, nil + ∞, nil + ∞, nil + ∞, nil + ∞, nil + ∞, nil + ∞, nil 0 , nil 1 2 Section 8.7 11. Page 611, Exercise 14 12. Page 611, Exercise 16 13. Page 611, Exercise 22 2...
View Full Document

This note was uploaded on 04/12/2008 for the course CS 291 taught by Professor Shen during the Winter '04 term at University of Missouri-Kansas City .

Page1 / 2

Homework 1 - 1 a b c d f e k h g j m n o Section 8.6 10....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online