Review for Exam 1 Topics covered: For each of these data structures

Slides:



Advertisements
Similar presentations
Lecture 22, Revision 1 Lecture notes Java code – CodeFromLectures folder* Example class sheets – 4 of these plus solutions Extra examples (quicksort) Lab.
Advertisements

Binary Trees, Binary Search Trees CMPS 2133 Spring 2008.
Binary Trees, Binary Search Trees COMP171 Fall 2006.
Course Review COMP171 Spring Hashing / Slide 2 Elementary Data Structures * Linked lists n Types: singular, doubly, circular n Operations: insert,
TCSS 342 BST v1.01 BST addElement To addElement(), we essentially do a find( ). When we reach a null pointer, we create a new node there. void addElement(Object.
Binary Search Trees. BST Properties Have all properties of binary tree Items in left subtree are smaller than items in any node Items in right subtree.
Chapter 19 - basic definitions - order statistics ( findkth( ) ) - balanced binary search trees - Java implementations Binary Search Trees 1CSCI 3333 Data.
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 223 – Advanced Data Structures Course Review Midterm.
Binary Trees, Binary Search Trees RIZWAN REHMAN CENTRE FOR COMPUTER STUDIES DIBRUGARH UNIVERSITY.
Review for Final Andy Wang Data Structures, Algorithms, and Generic Programming.
Binary Search Trees Nilanjan Banerjee. 2 Goal of today’s lecture Learn about Binary Search Trees Discuss the first midterm.
Final Exam Review CS Total Points – 60 Points Writing Programs – 50 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Review for Exam 1 Topics covered: –Asymptotic analysis –Lists and list implementations Stacks and queues –General trees, binary trees –BST For each of.
Review for Exam 2 Topics covered (since exam 1): –Splay Tree –K-D Trees –RB Tree –Priority Queue and Binary Heap –B-Tree For each of these data structures.
Binary Tree. Some Terminologies Short review on binary tree Tree traversals Binary Search Tree (BST)‏ Questions.
Exam 3 Review Data structures covered: –Hashing and Extensible hashing –Priority queues and binary heaps –Skip lists –B-Tree –Disjoint sets For each of.
CMSC 202, Version 5/02 1 Trees. CMSC 202, Version 5/02 2 Tree Basics 1.A tree is a set of nodes. 2.A tree may be empty (i.e., contain no nodes). 3.If.
 Saturday, April 20, 8:30-11:00am in B9201  Similar in style to written midterm exam  May include (a little) coding on paper  About 1.5 times as long.
Final Exam Review CS Total Points – 20 Points Writing Programs – 65 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Review for Exam 2 Topics covered: –Recursion and recursive functions –General rooted trees –Binary Search Trees (BST) –Splay Tree –RB Tree –K-D Trees For.
Chapter 6 – Trees. Notice that in a tree, there is exactly one path from the root to each node.
Week 15 – Monday.  What did we talk about last time?  Tries.
COSC 2007 Data Structures II Chapter 13 Advanced Implementation of Tables II.
Final Exam Review COP4530.
Final Exam Review CS 3358.
Trees Chapter 15.
COMP 53 – Week Fourteen Trees.
Midterm Review.
Topics covered (since exam 1):
Exam Hints.
Cinda Heeren / Geoffrey Tien
Week 6 - Wednesday CS221.
Week 15 – Monday CS221.
October 30th – Priority QUeues
COMP 103 Binary Search Trees.
Cse 373 April 26th – Exam Review.
November 1st – Exam Review
Review for Final Exam Non-cumulative, covers material since exam 2
Tree data structure.
Review for Final Exam Non-cumulative, covers material since exam 2
Binary Search Trees Why this is a useful data structure. Terminology
Binary Trees, Binary Search Trees
Review for Midterm Neil Tang 03/04/2010
ECET 370 HELPS Education Your Life-- ecet370helps.com.
Exam 2 Review CS 3358 Data Structures.
CSE373: Data Structures & Algorithms Lecture 6: Binary Search Trees
Exam 2 Review CS 3358 Data Structures.
Topics covered (since exam 1):
Tree data structure.
Topics covered (since exam 1):
Final Exam Review COP4530.
Topic 10 Trees.
Exam 2 Review CS 3358 Data Structures.
EE 312 Software Design and Implementation I
Trees CMSC 202, Version 5/02.
CMSC 202 Trees.
Topics covered (since exam 1, excluding PQ):
Chapter 10 1 – Binary Trees Tree Structures (3 slides)
Binary Trees: Motivation
Binary Trees, Binary Search Trees
Final Review Dr. Yingwu Zhu.
Overview Analysis Notation Specific ADTs
CSC 143 Binary Search Trees.
BST Insert To insert an element, we essentially do a find( ). When we reach a NULL pointer, we create a new node there. void BST::insert(const Comp &
EE 312 Final Exam Review.
Topics covered (since exam 1):
1 Lecture 13 CS2013.
EE 312 Software Design and Implementation I
Binary Trees, Binary Search Trees
For each of these data structures
Presentation transcript:

Review for Exam 1 Topics covered: For each of these data structures 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

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

Lists Stacks and queues 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

General tree Binary trees 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

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)

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