The next Topics of COSC 2320

Remark: Some topics will be covered in parallel!!!

0) Measuring the complexity of pieces of C-Code
1) Object-Oriented Systems and ADT (chapter 1 + extra material)
2) Big O, Big Omega, and Theta (chapter 1)
3) Arrays and Structures in general (2.1, 2.2)
4) The Reservation System Assignment
5) The Polynomial ADT (2.3)
6) Pointers in C (4.1-4.3)
7) Single linked and doubly linked lists (4.2, 4.8); pointer programming
8) Stacks and Recursion (chapter 3); postfix and infix; mazing problems
9) Polynomial revisted (4.4)
10) Sparse Matrices(various places in the textbook)
11) Linked Data Structures vs. Arrays
12) Assignment 2
13) Trees (chapter 5)
14) Stacks and recursion; removing recursion
15) Graphs (ch. 6, focusing on 6.1, 6.2 and 6.4)
16) Hashing (ch.8)
17) Sorting (ch.7; covers 7.1-7.10)
18) AVL-trees (ch. 10.2, if time left)