1 / 6

Comprehensive Exam Review Guide for Data Structures and Algorithms

This review covers key topics like asymptotic analysis, list implementations, stacks, queues, general and binary trees, BST, operations, advantages, limitations, and time performance. Includes explanations, examples, and comparisons. Ideal for exam preparation.

jbuswell
Download Presentation

Comprehensive Exam Review Guide for Data Structures and Algorithms

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. Review for Exam 1 • Topics covered: • Asymptotic analysis • Lists and list implementations • Stacks and queues • General trees, binary trees • BST • For each of these data structures • Basic idea of data structure and operations • Be able to work out small example problems • Advantages and limitations • Asymptotic time performance of their operations • Comparison between different implementations

  2. Asymptotic analysis • Best/Worst/Average performance (time and space) • Big-O notation and properties • Definition (constants c and n0) • Lower order terms, constant coefficients • Sum rule, product rule (be careful) • Proofs • Growth rates of commonly used functions • Constant/logarithm/polynomial/exponential • L’Hospital’s rule

  3. Lists • List ADT. • Basic operations and their time performance (implemen-tation dependent) • List iterators. • List implementation • Array • Linked list • Stacks and queues • ADT and operations (and their time performance) • Implementation: Adaptor • How this design pattern works • Pros and cons

  4. General tree • Definition • Internal and external nodes • Height and depth, path length • Tree storage methods and their nodes • Binary trees • Full, complete and perfect binary trees and their properties • 4 different orders of tree traversals

  5. BST • Definition • Basic operations and their implementations • Find/contains, • findMin, • findMax • insert, • remove, • recursive implementations • Time performance of these operations • Problems with unbalanced BST (degeneration)

  6. Types of questions: Similar to those of the supplementary questions on the web (under Practice Exercises) • Definitions • Short questions • Coding (some may require using operations already defined in the class, mostly in pseudo code) • Applying operations to specific example problems • Proofs

More Related