CSS 343-A
Data Structures and Algorithms

Winter 2014

Instructor: Mike Stark
Room: UW1 020
Meeting Times: Mon/Wed: 3:30 pm -- 5:30 pm
Syllabus: (PDF file)
Office Hours: T/Th 1:15–3:15 Truly House

Page Contents

Course Schedule and Calendar

Monday Tuesday Wednesday Thursday Friday
Week 1
1/6

Preliminaries, introduction to trees

1/7

1/8

Huffman encoding, Binary Search Tree
Reading: C++ 10 (5th), C++ 15, 16 (6th) Math 11.1–11.3

1/9

1/10

Week 2
1/13

Priority Queues, Binary Heaps
Reading: C++ 11.2 (5th), C++ 13.3, 17 (6th)

1/14

1/15

Priority Queues, Binary Heaps (continued)

1/16

1/17

Week 3
1/20 no class (Martin Luther King, Jr. Day)

1/21

1/22

Written HW #1 Assigned
Graphs (Dijkstra Shortest Path)
Reading: C++ 13 (partial, 5th), C++ 20 (partial, 6th), Math 10.1–10.3,

1/23

1/24

Week 4
1/27

Written HW #1 Due
Binary Tree Program Assigned
Programming: templates and inheritance
Graphs, continued

1/28

1/29

Graphs: depth/breadth-first searching

1/30

1/31

Week 5
2/3

Graph Program Assigned
C++ templates, function pointers
Balanced trees: AVL, 2-3, 2-3-4, B-trees, red-black
Reading: C++ 12.1, 14.3 (5th ed.)
C++ 19.1, 19.2.1–2.3, 19.5, 21.3.3 (6th ed.)

2/4

2/5

Object oriented design in C++
Representation of nonbinary trees
Trie (retrieval structure) Reading: C++ 1.1–1.2 (5th, 6th ed) 1.3 (6th ed.)

2/6

2/7

Week 6
2/10

2/11

2/12 Midterm Exam

2/13

2/14

Week 7
2/17 no class (President's Day)

2/18

2/19

2/20

2/21

Week 8
2/24

2/25

2/26

2/27

2/28

Week 9
3/3

3/4

3/5

3/6

3/7

Week 10
3/10

3/11

3/12

3/13

3/14

Finals
3/17 Final Exam

3:30 pm -- 5:30 pm

3/18

3/19

3/20

3/21

Other Information Sources

Useful Links

These you might find useful: