This shows you the differences between two versions of the page.

Both sides previous revision Previous revision Next revision | Previous revision | ||

cs-236:homework-10 [2015/02/17 10:36] egm |
cs-236:homework-10 [2017/12/01 12:03] (current) kylej13 [Problems] |
||
---|---|---|---|

Line 1: | Line 1: | ||

- | Objectives | + | ==Objectives== |

* Properties of trees and rooted trees | * Properties of trees and rooted trees | ||

* Build, search, and traverse binary search trees. | * Build, search, and traverse binary search trees. | ||

Line 7: | Line 7: | ||

* Compute the strongly connected components in a graph | * Compute the strongly connected components in a graph | ||

- | == Problems for Sections 3 and 4 == | + | ==Problems== |

# (3 points) 11.1.2 | # (3 points) 11.1.2 | ||

# (4 points) 11.1.4 | # (4 points) 11.1.4 | ||

Line 13: | Line 13: | ||

# (2 points) 11.2.4 | # (2 points) 11.2.4 | ||

# (4 points) 11.4.14 | # (4 points) 11.4.14 | ||

- | # (4 points) Repeat problem 11.4.14 only this time assign post-order traversal numbers to each vertex. | + | # (4 points) Repeat problem 11.4.14 only this time assign post-order traversal numbers to each vertex of the spanning tree. |

# (4 points) 11.4.16 (just the graph from problem 11.4.14) | # (4 points) 11.4.16 (just the graph from problem 11.4.14) | ||

# (2 points) 11.5.1 | # (2 points) 11.5.1 | ||

# (4 points) 11.5.2 | # (4 points) 11.5.2 | ||

# (6 points) 11.5.6 | # (6 points) 11.5.6 |