CSS 342 Data Structures, Algorithms, and Discrete Mathematics I Final Review. FINAL: THURSDAY DEC 15

Final: Text Carrano: Cusack Review tests and problems: Chapters 1 – 15 (not 5.1, 5.2) Interludes 1 – 2 (not 1.4, 1.5) Appendix: A, B, D, E Cusack Chapters 4.1 – 4.2 Review tests and problems: http://courses.washington.edu/css342/dimpsey/ProgramExamples/code.html Review programming examples here: http://courses.washington.edu/css342/dimpsey/ProgramExamples/code.html

Final Topics Interface Design Encapsulation C++ fundamentals Tenets of OOP/C++ Interface Design Encapsulation C++ fundamentals Constructors Operator Overloading: when/how Pass by value, ref, const ref Copy Constructors Assignment

Final Topics Pointers Dynamic Memory Allocation heap v. stack usage Recursion Templates

Final topics: Data Structures String Vector Array Linked list (single, double) Stack Queue Binary Search Tree

Final Topics: Algorithms Recursion Binary Search Sorting Bubble Insertion Selection Merge Quick Shell Radix Efficiency of different sorts. What sorts work with what data= Manipulating BSTree (add, find, remove, )

Final Topics: Discrete Math Induction Efficiency Determining BigO of code snippets Proving BigO Determining efficiency of key algorithms Propositional Logic Representing English sentences in propositional phrases Boolean Algebra Truth Tables

Some items to highlight for final study… Recursion Dynamic Memory Allocation Interface Design Pointers Sorting Big O Propositional Logic