General Review & Guide to final exam.
|
Lecture Number |
Title |
Final Exam. Guide |
|
1 |
Overview of the
course & basic data structure concepts |
Idea |
|
2 |
Good programming
principles |
Idea |
|
3 |
Review of Searching
methods - informal analysis |
Idea |
|
4 |
Introduction to formal
Algorithm Analysis --Big-O notation |
Detail |
|
5 |
Big-O notation -- generation of run-time function and
simplification rules |
Detail |
|
6 |
Application of
Algorithm analysis to Simple Sorting methods –Insertion, Selection and Shell |
Idea |
|
7 |
Application of Algorithm
analysis to Divide and Conquer sorting methods |
Idea |
|
8 |
Introduction to
Tables -- index table/function |
Idea |
|
9 |
Introduction to
Hashing – hash functions, probing methods |
Detail |
|
10 |
Implementation of
Hash tables – open addressing & chaining (as home work) |
Detail |
|
11 |
Implementation of
Stack |
Detail |
|
12 |
Application of Stack
– infix to postfix conversion |
Detail |
|
13 |
Recursion |
Idea |
|
14 |
Closer look at
recursion – Tail-end recursion |
Idea |
|
15 |
Implementation of
queue |
Detail |
|
16 |
Application of Queue |
Idea |
|
17 |
Implementation of
linked list |
Detail |
|
18 |
Introduction to
Binary Tree |
Detail |
|
19 |
Binary Search tree |
Detail |
|
20 |
Building a balanced
binary tree |
Idea |
|
21 |
AVL tree |
Detail |
|
22 |
Heap Sorting |
Detail |
|
23 |
Introduction to
Graphs |
Detail |
|
24 |
Graph traversal |
Detail |
|
25 |
Topological Sorting |
Detail |
|
26 |
Shortest path |
Detail |
|
27 |
Graph as an ADT. |
Detail |