# CMPE/CMSE 231 Tentative Schedule

 /CMSE  WEEK OF TOPICS Slides (Reference - Various Sources) Slides actually covered in class Notes (Reference - Various Sources) LABS Primitive data structures. Binary and Decimal Integers, Real numbers, Character strings, Memory representation of information, pointers. SL3 Mathematical background SL6 Pointer Basics 1 All topics Arrays and Pointers. Structures, Array of structures. Memory allocation (storage) of arrays. Multi- dimensional arrays (row-major, column-major). Self-referential structures. Dynamic memory allocation in C. Linked lists. SL6 Pointer Basics 2 -Arrays - StructuresSL 5 - Data structures (Prentice Hall): Dynamic Memory Allocation Slides 1-14 SL6 Pointer Basics 2 -Arrays - Structures Doubly linked lists, circular linked lists, abstract data types SL 5 - Data structures (Prentice Hall): Introduction - Self-Referential Structures -Dynamic Memory Allocation - Linked Lists - Stacks -Queues - TreesSL4 Circular Linked list - doubly linked list SL6 Linked Lists (single - double) Linked List Notes Stack as an Abstract Data Type. Primitive operations. Stack applications. Infıx-postfix conversion. SL 5 - Data structures (Prentice Hall)SL1 Stacks - Recursion Stacks continued. Functions. Recursive definitions. Factorial function. Fibonacci sequence. Binary search. The Towers of Hanoi problem. Recursion versus Iteration. SL1 Functions as Data TypesSL 5 - Data structures (Prentice Hall)SL1 Stacks - RecursionFactorialFibonacciSumTowers of Hanoi SL 5 - Data structures (Prentice Hall)  (pdf)FactorialFibonacciSumTowers of Hanoi Stacks and Queues Notes Recursion continued. Binary search.The  Queue as an Abstract Data Type. C implementation of Queues. Circular queue representation. SL4 Circular Queue (bad implementation) SL6 Recursion - Merge Sort - Binary Search (only the binary search part) Stacks and Queues Notes Review Midterm Exams Trees.  Binary Tree Representations. Binary search trees. SL5 Trees - Binary Trees - Binary Search Trees Binary Tree Traversals (inorder, preorder, postorder).  Binary Search Trees. Searching a Binary Search Tree. Inserting into a Binary Search Tree. Deleting from a Binary Search Tree. SL1 Searching - TreesSL1 AVL Trees - B Trees - B+ TreesSL4 Tree - General - Binary - Threaded - AVL - BalancedSL5 AVL Trees 1SL5 AVL Trees 2SL5 Trees - Binary Trees - Binary Search TreesSL 5 - Data structures (Prentice Hall)SL5 B+TREESSL6 Binary trees - Huffman Encoding - Traversals SL5 Trees - Binary Trees - Binary Search Trees  'C' implementation of BST (home grown)Sample run of BSTMidterm Exam Solution: Trees Notes Algorithmic complexity. Sorting. Bubble sort, insertion sort, quick sort, merge sort SL4 Algorithm Def - Asymptotic Notations SL6 Algorithmic Complexity ISL1 SortingSL5 - Quicksort (nice) Trees Notes Heaps. Heap operations. Heap sort. SL5 Heaps - Heap Sort - Priority Queues SL6 Heap - Heapsort - Priority queues SL6 Heap - Heapsort - Priority queues Hashing. Graphs. Application of graphs. Representation of Graphs. SL1 Hash Tables SL5 Hashing Graphs Notes 1 Final Exams