Module One: Data Structure Basics 

1. General discussion on programming principles and software engineering Ch. 1,2.
2. The importance of Data Structures will be motivated. HW: big program involving files.
3. Growth of functions.
4. Complexity: Sec. 3.2, 3.3 from Rosen.

Module Two: Stack

1. The concept of ADT and Stacks: contiguous implementation. (Ch. 3). 
2. Stacks: linked implementation. (Ch.3).

Module Three: Recursion 

1. Recursion, Recursion vs. iteration, tail recursion, unnecessarily recursion (Ch. 3). 

Module Four: Queues 

1. More on ADT and queues (contiguous implementation) Ch. 4. 
2. Queues: linked implementation. 
3. General lists: contiguous implementation. Ch. 4, Ch. 5.

Module Five: Lists 

1. General lists: linked implementation.
2. Sequential search Ch.5, Ch.6.

Module Six: Binary search and Tree

1. Binary search Ch. 6. 
2. Some tree terminology and rigorous analysis of Binary search, and proving important theorems.
3. Trees and BST Ch. 9.
4. BST (cont.) including deleting nodes. 
5. Graph representation and Breadth first and depth first traversal.

Module Seven: Project 

1. Group of 2-3 persons select an idea. 
2. The lecturer discusses the code with you.
3. Guide you to reach for the best practical project.