Approximate Course Schedule CS 1723/CS 1721

Week
Lecture
Topic
Reading
(Case Study No)
Topic
(Quiz No)
Emphasis
(Lab No)
Topic
Due
1 Introduction Ch 1        
2 Review of OO Ch 2 Review of OO
(1) File enumeration
(1) Review of OO (1) Simple class hierarchy  
3 Collections Ch 3 (2) Array implementation of SetADT
(3) Four versions of contains
(2) Iterators
Scope and visibility
(2) Application of SetADT Lab 1
4 Linked structures Ch 4 (4) Linked SetADT (3) ArraySet
BigOh
(3) Application of SetADT with exceptions Lab 2
5 Stacks
Postfix
Ch 6 (5) ArrayStack
(6) Postfix
(4) Linked versions of SetADT (4) Doubly-linked implementation Lab 3
6 Queues
Simulation
Ch 7 (7) LinkedQueue
(8) LinkedPriorityQueue
(9) Simulation Case Study
(5) Stacks and postfix (5) Stacks and Postfix Proj 1
Lab4
7 Review
Test
      (6) Simulation
part I
Exam 1
8 Lists Ch 8 (10) Doubly-linked lists
(11) Big decimal (optional)
(6) Queues (7) Simulation
part II
Lab 5
9 Recursion Ch 10 (12) Tracing recursive sum
(13) Towers of Hanoi
(14) N-queens and backtracking
(7) Lists (8) Career Services Lab 6
Lab 7
10 Searching
Sorting
Ch 11 (15) Searching
(16) Quadratic sorts
(17) Fast sorts
(8) Recursion (9) Recursive traversal of a directory tree Proj 2
11 Trees
Huffman coding
Ch 12 (18) LinkedBinaryTree
(19) Huffman coding
(9) Searching and Sorting (10) Multilists Lab 9
12 Review
Test
      (11) Huffman coding Exam 2
13 Binary search trees Ch 13 (20) LinkedBinarySearchTree
(21) BinarySearchTreeOrderedList
(22) Java TreeSet and TreeMap
(10) Trees and traversals (11) Huffman coding (cont) Lab 10
14 Heaps
Priority queues
Ch 15 (23) ArrayHeap
(24) HeapPriorityQueue
(25) Heap sort
    Lab 11
15 Hashing
Review
Ch 17 (26) Hashing in Java     Proj 3