Lectures

Arrays || ||   || Robert lafore || Big-O analysis of both search || DSLec3.pdf ||  || - parenthesis validity check - infix to postfix conversion - computation of postfix expression || Above ppt ||  || Infix expression to postfix expression convertion algorithim || Stack implementation ||  ||
 * Sno# || Day || Date || Topic || Download || Reading ||
 * 1 || Thursday || Sep16,2010 || Introduction to data Structures
 * 2 || Monday || Sep 20, 2010 || Abstract data types Multidimensional array || [[file:DSLec2.pdf]] ||  ||
 * 3 || Thursday || Sep 23, 2010 || Class canceled ||  ||   ||
 * 4 || Monday || Sep 26,2010 || Time Complexity, Big O notation || [[file:DSLec3.pdf]] || Chapter 2
 * 5 || Thursday || Sep 30,2010 || Linear search and Binary search
 * 6 || Monday || Oct 4, 2010 || Limitation of arrays and need of linklist || [[file:DSLec_4_5_6(LinkList).pptx]] ||  ||
 * 7 || Thursday || Oct 7, 2010 || Canceled ||  ||   ||
 * 8 || Monday || Oct 11, 2010 || Canceled ||  ||   ||
 * 9 || Thursday || Oct 14,2010 || Link List (insert, display, find) || Above ppt ||  ||
 * 10 || Monday || Oct 18,2010 || Circular Link List (insert, display, find) || Above ppt ||  ||
 * 11 || Thursday || Oct 28, 2010 || Doubly Link List || Above ppt ||  ||
 * 12 || Monday || Nov 1, 2010 || Recursion || [[file:DSLec_8(Recursion).pptx]] || Read Hand out and chapter 6 ||
 * 13 ||  || Nov 4, 2010 || Recursion (linear, binary) || Above ppt ||   ||
 * 14 ||  || Nov 8, 2010 || Stack ADT || [[file:DSLec(Stack).pptx]] || chap7 ||
 * 15 ||  || Nov 11, 2010 || Stack Application (Arithmetic expression solver)
 * 16 ||  || Nov 15, 2010 || Stack Applications
 * 17 || Thursday || Nov 18, 2010 || Eid ul Azha ||  ||   ||
 * 18 || Monday || Nov 22, 2010 || Queue || [[file:DSLec(Queues).ppt]] || chap7 ||
 * 19 || Thursday || Nov 25, 2010 || Binary Tree || [[file:DSLec(BinaryTrees).pptx]] ||  ||
 * 20 || Saturday || Nov 27, 2010 || Binary Tree: insertion, Traversals || above ppt || Chapter8 ||
 * 21 || Saturday || Nov 27,2010 || Binary Tree: deletion, Applications(Huffman coding, expression trees) || above ppt || Trees ||
 * 22 || Monday || Nov 29, 2010 || Multiway Trees, 2-3-trees ||  ||   ||
 * 23 || Thursday || Dec 8, 2010 || Sortings: Bubble sort, Selection sort, Insertion sort ||  || chap 3 ||
 * ||  ||   || 2nd midterm exam ||   ||   ||
 * 24 || Monday || Dec13, 2010 || Balance Tree: Red-Black tree ||  || Chap9 ||
 * 25 || Thursday || Dec 16, 2010 || Muharram holiday ||  ||   ||
 * 26 || Monday || Dec 20, 2010 || 2-3-4 trees and B-trees ||  ||   ||
 * 27 || Thursday || Dec 23, 2010 || Building a Heap (min or max), heapsort ||  || chap 12 ||
 * 28 || Monday || Dec 27, 2010 || Benazeer bhutto (holiday) ||  ||   ||
 * 29 || Thursday || Dec 30, 2010 || Hashing ||  || chap 11 ||
 * 30 || Monday || Jan 3, 2010 || Hashing ||  ||   ||
 * 31 || Monday || Jan 3, 2010 || Revision ||  ||   ||
 * 32 || Thursday || Jan 6, 2010 || Quick Sort ||  || Chap7 ||
 * 33 || Thursday || Jan 6, 2010 || Quiz and revision ||  ||   ||
 * 34 || Monday || Jan 10,2010 || radix sort ||  || Chap7 ||