CSE 331 Event Driven Programming Oakland University

CSE331 Lecture 21 Heaps, Binary Files, and Bit Sets Chapter 14 Complete Binary Tree Example Maximum and Minimum Heaps Heap Insertion pushHeap() popHeap() Adjusting popHeap() Heap Sort Heapifying File Structure Direct File Access bitVector Class Los

CSE 331 Lecture 8 Chapter 5 Pointers Data Addresses in Memory Declaring Pointer Variables Assigning Values to Pointers Arrays and Pointers Dynamic Memory Management new & delete The Destructor The Copy Constructor An Overloaded Assignment Operator T

What is a \" Set\" ? 12 179 47 19 93 81 3 Associative Container like lists, vectors, etc. intSet: a set of integers Members of intSet 3 12 19 47 81 93 179 access data by value, not index set: unique key values multiset: duplicat

C+ Syntax (Cheat Sheet) -Terms in <> are tokens which describe generically what goes in there. All other terms are literally themselves. EXAMPLE: <name> = <expression> represents x = 5 or name = \"John\" + \"Stewman\" Also, a <statement> can be a functio

Department of Computer Science and Engineering University of Notre Dame CSE 331 - Data Structures Fall 2004 Description The student who completes this course will have a sound understanding of the fundamental data structures and algorithms that lie a

CSE 331 Sample Midterm Questions 1. In a class, the _ section identifies data and operations that can be used only by methods in the class. The public member functions of a class provide the _ of the class for a programmer. (a) abstract operations (

Chapter 10 Binary Search Tree Locating a Node Inserting a Node Removing a Leaf Removing a non-leaf 1 child 2 children CSE 331 Lecture 16 BSTree Iterator Begin End Operator+ Operator* Summary Slides Demo tsimND Discuss Traffic Simulation 1 Main In

CSE 331 Lecture 11 Queues & Sorting Chapter 8 Model for a Queue The Queue Queue ADT Radix Sort Algorithm Example Code Analysis Priority Queue Summary Slides Priority Queue ADT Heap Definition Example Removing from a Heap HeapSort (simplified) Algor

CSE 331 Lecture 10 Chapter 7 Stacks Pushing/Popping a Stack LIFO Stack API STL stack Class Adaptor vs. Container Using a Stack to Convert number bases (dec2hex) Uncoupling Stack Elements Summary Slides Activation Records Mathematical Expressions RPN