1 / 11

Final Review

Final Review. Intro to OO and UML. Understand the basic principle of object orientation (A, E, M, H) Understand the basic concepts and terms of object orientation and the associated UML notation Appreciate the strengths of object orientation Understand some basic UML modeling mechanisms.

henrik
Download Presentation

Final Review

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Final Review

  2. Intro to OO and UML • Understand the basic principle of object orientation (A, E, M, H) • Understand the basic concepts and terms of object orientation and the associated UML notation • Appreciate the strengths of object orientation • Understand some basic UML modeling mechanisms

  3. Chapter 2 Array • Array: a sequential and random access data structure • Operations • Insert • Delete • Find • Sorted vs. unsorted • Big O notation

  4. Chapter 3 Simple Sortings • Introduction • Bubble Sort • Selection Sort • Insertion Sort • Comparison

  5. Chapter 4 Stack & Queue • ADT • Operations • Various queue ADT • Applications • comparison

  6. Chapter 5 Linked Lists • ADT • Why lists vs. array? • Double-ended vas Doubly linked lists • Sorted list • Finding and deleting • Iterators

  7. Chapter 6 Recursion • A programming technique in which a function calls itself • Recursion programming technique • Applications • Pros and cons • Complexity Analysis

  8. Chapter 8 Binary Tree • What is it? • Why vs. other DS? • Operations • Insert • Find • Delete (leaf, 1 child, 2 children) • Complexity

  9. Chapter 11 Hash Table • What is it? • Why vs. other DS? • Operations • Insert • Find • Delete (leaf, 1 child, 2 children) • Hash function • Open addressing vs. separate chaining • Collision and solutions • Complexity

  10. Chapter 13 Graph • What is it? • Representations, vertices vs. edges • Applications • DFS • BFS • MTS • Complexity

  11. A take home question 10% of your final • Your final is 100% and comprehensive. No note, books and discussion during the exam. • However, there is one take home question (10%) • Discuss your final project, what is your role and what you have learn from it. What and how did you apply things that you leant from the class to your final project development. Read the handout “Connect the Dosts…” and tell me what do you think about your experiences that you have gotten from the class.

More Related