Test 1, Quizzes 1-3, Homework Assignments 1-3

Quiz 1, 04/06/15, covers 2.2-2.7
Practice problems: 2.2.11, 2.3.1 d, 2.3.9, 2.3.10, 2.4.2, 2.4.3, 2.5.1, 2.5.2, 2.6.2 a,b, 2.7.1

Relevant examples: 2.4, 2.7-2.15, 2.17, 2.21, 2.22

 

Homework 1 due in class on 04/13/15

Textbook problems: 2.3.2, 2.4.6, 2.5.4, 2.6.3

Quiz 2, 04/13/15, covers 2.8-2.9, 5.2-5.4

Practice problems: 2.8.1, 2.8.2 (follow the pattern of Fig. 2.30), 2.9.1 (correct to Fig. 2.31(a)), 2.9.2, 5.2.1, 5.2.7, 5.3.1, 5.3.2 b, 5.4.1, 5.4.2, 5.4.5, 5.4.6, 5.4.7

Relevant examples: 2.23-2.25, 2.28, 5.1-5.9, 5.11, 5.13-5.16

Homework 2 due in class on 04/20/15

Textbook problems: 2.7.8, 5.2.8, 5.3.6, 5.4.3

 

Quiz 3, 04/20/15, covers 5.5-5.8

Practice problems: 5.5.1, 5.5.3, 5.6.1, 5.6.5, 5.7.2 (skip delete operations), 5.8.1
Relevant examples: 5.17-5.24


Homework 3 due in class on 04/27/15

Textbook problems: 5.5.4, 5.6.2, 5.6.6, 5.9.5

Test 1, 04/27/15, covers 2.2-2.9, 5.2-5.10,
Review Problems
POTs and heapsort - practice problems: 5.9.1, 5.9.7, 5.10.1
POTs and heapsort - relevant examples: 5.27-5.32


C programs relevant to Test 1:

Selection-sort: iterative p. 31, recursive p. 73
Merge-sort p. 81 and related functions: merge p. 77, split p. 79

Traversal algorithms: pre-order & post-order for leftmost-child-right-sibling representations p. 240, p. 242, pre-order for binary trees p. 257

Evaluating arithmetic expressions p. 244

Computing the height of all the nodes of a tree p. 246

Lookup and insert operations of BSTs p. 262, p. 263
Heap-sort p. 284 and related functions: bubbleUp p. 275, insert p. 276, bubbleDown, deletemax p. 277, heapify p. 282