CMPT 225 Lecture Schedule

 

Reading are from the course text: Data Structures and Algorithms in C++ (2nd edition), Michael Goodrich, Roberto Tamassia, David Mount, John Wiley and Sons, 2011, 9780470383278.

 

Presentations will be added before the first class on that subject. I will only post the .pdf version of presentations - if you want to see the PowerPoint version then come to class!

 

Introduction

Presentation

 

Stacks and Queues

Presentation

Readings: Chapters 3 (not3.5) and 5

 

Object Oriented Programming and Design

Readings: Chapters 1 and 2 (not 2.2)

postfix.cpp, Stack.cpp, Stack.h, Node.h

StackTemplate.cpp, StackT.h

ListTemplate.cpp, List.h, ListNode.h

 

Recursion

Presentation

Linked List Example

Readings: Section 3.5

 

O Notation

O Notation Presentation

O Notation Quiz

Readings: Chapter 4

 

Sorting

Sort timing demo (includes mergesort implementation): main program, sort.h

Sorting notes and radix sort

Readings: Chapter 11

 

Hash Tables

Presentation

Readings: Chapter 9

 

Binary Search Trees

Tree Presentation

Balanced Binary Search Trees

Readings: Chapters 7 and 10 and section 14.3

 

Heaps and Priority Queues

Presentation

Readings: Chapter 8

 

Graphs

Presentation

 

CMPT 225 Home

 

John Edgar (johnwill@sfu.ca)