CMPS-2020 "Programming II: Data Structures and Algorithms" |

Fall 2017 #82476 |

Exam scores

Lab-11 was collected grading...

syllabus | textbook | code | scores | |||
---|---|---|---|

Week | Topic | Readings | Assignments |

1 |
Syllabus Review of 2010 course |
Gaddis 1 - 13 |
Lab-1 |

2 |
Classes, access, constructors Memberwise copy Cstrings vs string class Cstring pointers |
Gaddis 14, 15 lab-1 comments homework-1 comments |
Lab-2 |

3 |
Inheritance Base class Constructor, destructor |
Gaddis chapter 15 |
Lab-3 hw-3 |

4 |
Polymorphism Virtual member functions Base class pointers |
Gaddis chapter 15 Google C++ tutorials |
Lab-4 |

5 |
Exceptions, try catch block Templates, functions and classes |
Gaddis chapter 16 |
Lab-5 |

6 |
Prepare for algorithms Searching and sorting Quadratic sorting algorithms |
Gaddis chapter 8 Carrano chapter 11 |
Lab-6 |

7 |
Review of Object oriented Exam |
exam scores | |

8 |
Linked list Single and double Nodes and operations |
linked-list
tutorial |
lab-8 tutorial |

9 |
Stack Queue Array-based lists |
Gaddis, chapter 18 Carrano ch. 6,7,13,14 |
Lab-9 |

10 |
Binary trees and the BST Recursion Tree traversals |
Gaddis chapter 20 Carrano chapter 15 BST insert |
Lab-10 |

11 |
Hashing and hash tables Hash functions Collision resolution Perfect hash table |
hash tables hash table setup hash function insertion deletion collision strategies · linear probing · quadratic probing · double hashing perfect hash |
Lab-11 |

12 |
Recursion Review of algorithms • Midterm Exam - Thurs 11/16 |
||

13 |
Divide and conquer Mergesort, Quicksort Algorithm efficiency Big-O notation |
||

14 |
Heap Heap operations Priority queue Heapsort |
||

15 |
Heapsort Additional algorithms Review |
||

Final Exam: TBD |