Lectures

=Lectures: Data Structues and Algorithms (Theory)=

Lecture slides will be uploaded before each class.

4/04/2009 || Introduction to Data Structures || || || 18/09/2009 || Algorithm complexity || || 29/09/2009 2/10/2009 || Singly Linked List, Doubly Linked List and Circular Linked List || || 20/10/2009 || Stack using Array and LinkedList || || 27/10/2009 || Queues, Circular Queues and Priority Queues || || 6/11/2009 || Binary trees, Binary tree traversal, huffman coding || || 13/11/2009 17/11/2009 || Sorting Algorithms Bubble, quick, insertion, selection and heap sort || || 8/12/2009 || Hashing || ||
 * **Lecture** || **Date** || **Topic** || **Lecture Slides** ||
 * 1 & 2 || 1/09/2009
 * 3 || 8/09/2009 || Arrays || [[file:DSLec3.pptx]] ||
 * 4 || 11/09/2009 || 3D array, Precondition and Post condition || [[file:DSLec4A.pdf]]
 * 5 and 6 || 15/09/2009
 * 7 ,8 and 9 || 25/09/2009
 * 10 and 11 || 16/10/2009
 * 12 and 13 || 22/10/2009
 * 14 || 30/10/2009 || Recursion || [[file:DSLec_14(Recursion).pptx]] ||
 * 15, 16 || 3/11/2009
 * 17, 18, 19 || 10/11/2009
 * 20 || 1/12/2009 || Merge sort || book handout ||
 * 21 || 4/12/2009 || Radix sort || book handout ||
 * 22, 23 || 8/12/2009
 * 24 || 11/12/2009 || Multiway search tree || book handout ||
 * 25 || 15/12/2009 || B-tree ||  ||
 * 26 || 18/12/2009 || AVL Tree ||  ||
 * 27 || 22/12/2009 || AVL Tree ||  ||
 * 28 || 25/12/2009 || Assigned topic presentation ||  ||
 * 29 || 29/12/2009 || Revision ||  ||
 * 30 || 1/01/2010 || Project presentation ||  ||