CSCI 325: Data Structures and Algorithms


Message Board

Final exam: 10:00-12:00 Tue May 1st


Lecture Notes

Week

Date

Slides (handouts)

Readings

1R Jan 11
review (style example), make, emacs

1.1

2T Jan 16
2R Jan 18 gdb (simple.cpp), dynamic array
3T Jan 23 pointers & arrays
3R Jan 25 big_o

3

4T Jan 30
4R

Feb 1

ADT & vectors, p1, p2, p3, p4, p5, p6, p7, p8

1.2, 4.1.1

5T

Feb 6

5R

Feb 8

Linked list, p1, p2, p3, slides,Recursion

4.1.2, 4.1.3, 4.1.5

6T

Feb 13

6R Feb 15^(Exam1)
7T Feb 20
7R Feb 22
circular.cpp, Queueslides, arrayqueue, linkedlistqueue, queue_adt, stl_queue.cpp, stl_priority.cpp, priority_adt dynamic_array2d.cpp, stl_deque.cpp, deque_adt

4.3

8T Feb 27
8R Mar 1
9T

Mar 6*(Spring break)

No classes  
9R Mar 8*(Spring break)
10T Mar 13 stl_stack.cpp, stack_adt, arraystack, liststack

4.2

10R Mar 15 tree_adt, binary_tree.notes, bst.cpp, bst.jpg, stl.cpp

5.1-5.4

11T Mar 20
11R Mar 22
12T Mar 27 heap

5.5

12R Mar 29^(Exam2)

hash, hash.cpp, parse_struct.cpp, stl.cpp

9.4
13T Apr 3
13R Apr 5
14T Apr 10

11.1

14R Apr 12
9.1, 15.1, 15.2
15T Apr 17 Sort
15R

Apr 19

7.1-7.2
7.5-7.7
7.9
16T Apr 24
16R Apr 26

Catchup and review

17 May

Final exam

 

Assignments (Please submit assignments to csci325.001@gmail.com with corresponding Assignment # in the subject line):

Assignment 1

Assignment 2

Assignment 3

Assignment 4

Assignment 5

Assignment 6

Assignment 7

Assignment 8

Assignment 9


Resources