Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
cs-236:homework-10 [2017/11/28 10:43]
zalger [Problems for Sections 3 and 4]
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==
 # (3 points) 11.1.2 # (3 points) 11.1.2
 # (4 points) 11.1.4 # (4 points) 11.1.4
Line 12: 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
cs-236/homework-10.1511890991.txt.gz ยท Last modified: 2017/11/28 10:43 by zalger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0