Data Structures Lectures for Spring 2011

Lecture

Date

Topics

Handouts

01

Jan 11

Algorithm Complexity Analysis

Chapter 11 PowerPoint

Algorithm Complexity Questions

Python Summary

02

Jan 13

Revisit Complexity Analysis, searching, selection sort

Searching and simple sorting Questions

03

Jan 18

Bubble sort, recursion review, and divide-and-Conquer vs. dynamic programming

Recursion and Divide-and-Conquer vs. Dynamic Programming Questions

04

Jan 20

Python “Review”: classes

Class and Object Questions

05

Jan 25

Pydoc, pyunit testing

Chapter 12 PowerPoint

More Qustions on Class and Object

06

Jan 27

Chapter 13 PowerPoint

07

Feb 01

Textbook's Array Class Questions

08

Feb 03

Stack implementations

Chapter 14 PowerPoint

Stack Implementation Questions

09

Feb 08

Queue implementations

Chapter 15 PowerPoint

FIFO Queue Implementation Questions

10

Feb 10

Stack Applications and Priority Queue implementations

Partial Chapter 18 PowerPoint

Priority Queue Implementation Questions

11

Feb 15

Review for Test 1

Test 1 Review Topics

Test 1 Fall 2010

Test 1 Fall 2010 Solution

12

Feb 17

Test 1: Chapters 11 – 14

13

Feb 22

List types and Positional List Implementations

Chapter 16 PowerPoint

List Implementation Questions

14

Feb 24

Iterators, Heap and Merge Sorts

15

Mar 01

Quick Sort with analysis and coin-change problem divide-and-conquer

Chapter 17 PowerPoint

Quicksort and Coin-change divide-and-conquer Questions

16

Mar 03

Coin-change backtracking

Coin-change Backtracking Questions

17

Mar 08

coin-change dynamic programming

Coin-change Backtracking vs Dynamic Programming Questions

18

Mar 10

Binary Tree terminology and operations

Binary Tree and Binary Search Tree implementation

Chapter 18 PowerPoint

Tree terminology and operations Questions

Binary Search Tree implementation Questions

Spring Break

19

Mar 22

Intro. To AVL trees

Intro. To AVL Tree implementation Questions

20

Mar 24

BST vs. AVL performance; Intro. To hashing

Chapter 19 PowerPoint

On-line Hashing Tutorial

BST vs. AVL Tree comparison and Hashing Questions

21

Mar 29

Hash table implementations

Hash Table implementation and performance Questions

22

Mar 31

File data structures: Hashing and B+ Trees

Good B+ Tree Summary

Wikipedia B+ Tree discussion

B+ Tree

Questions on magnetic disk and file structures

23

Apr 05

Review for Test 2

Test 2 Review Topics

Test 2 Fall 2010

Test 2 Fall 2010 Solution

24

Apr 07

Test 2: Chapters: 15-17 and sections 18.9-18.11 on Heaps

25

Apr 12

Finish discussion of file structures including B+ trees

26

Apr 14

Graph Representation

Chapter 20 PowerPoint

Questions on graph representations

27

Apr 19

Graph Traversals

lec28.zip

BFS and DFS Graph Traveral Questions

28

Apr 21

Graph Algorithms: Prim's Min.-Spanning Tree and Dijkstra's Shortest Path

Graph Algorithms Questions

29

Apr 26

30

Apr 28

Review for Final Exam

Final Exam Review Topics

Final Exam, Tuesday (May 3) 8-9:50 AM in ITT 322