Data Structures Lectures for Fall 2012

Lecture

Date

Topics

Overheads

Handouts

01

Aug 21

Ch 1: Python Review

Chapter 1 Slides

Python Review Questions

Python Review Questions - .doc

02

Aug 23

Ch. 2: Algorithm Analysis; Big-oh; timing

Chapter 2 Slides

Python classes and algorithm analysis questions

Python classes and algorithm analysis questions - .doc

03

Aug 28

Ch. 2: Performance of Python Built-in data structures

Chapter 2 Part 2 Slides

More algorithm and built-in data structures analysis questions

More algorithm and built-in data structures analysis questions - .doc

04

Aug 30

Ch. 3: Linear data structures; stack implementations


Stack implementation questions

Stack implementation questions - .doc

05

Sept 4

Stack applications; Queue implementations


linked stack implementation questions

Linked stack implementation questions - .doc

06

Sept 6

Queue applications; Deque


Deque questions

Deque questions - .doc

07

Sept 11

Ch. 6.6: Priority Queue: binary heap implementation


Heap questions

Heap questions - .doc

08

Sept 13

Unordered Lists implementations

Code from lecture:

unsortedList.zip

Unsorted linked list questions

Unsorted linked list questions - .doc

09

Sept 18

Ordered List implementation Ch. 4: Recursion: fibonacci example


Ordred linked list questions

Ordered list questions - .doc

10

Sept 20

Ch. 4: Recursion continued


More recursion questions

More recursion questions - .doc

11

Sept 25

Review for Test 1

Test 1 Review Topics

Test 1 Fall 2010

Test 1 Fall 2010 Solution

12

Sept 27

Test 1: Chapters 1 - 3



13

Oct 02

Recursion examples: backtracking coin-change problem an dynamic programming


Coin-change questions

Coin-change questions - .doc

14

Oct 04

Ch. 5: Searching: linear and binary search

On-line Hashing Tutorial

Searching questions

Searching questions - .doc

15

Oct 09

Searching: hashing: chaining/closed addressing implementations


Hashing questions

Hashing questions - .doc

16

Oct 11

Hashing implementations: open addressing implementations; Simple sorts: bubble, selecton, and insertion sorts;


Simple sort questions

Simple sort questions - .doc

17

Oct 16

Advanced sorts: heap, merge, and quick sorts


Advanced sort questions

Advanced sort questions - .doc

18

Oct 18

Quick Sort



19

Oct 23

Ch. 6: tree terminology, binary tree implementation, traversals, parse tree application


Tree questions

Tree questions - .doc

20

Oct 25

Binary Search Tree implementation


More Tree questions

More Tree questions - .doc

21

Oct 30

Review for Test 2

Test 2 Review Topics

Test 2 Fall 2010

Test 2 Fall 2010 Solution

Test 2 Spring 2011

Test 2 Spring 2011 Solution

Test 2 Spring 2012 Solution

22

Nov 01

Test 2: Chapters 4 – 5


Test 2 Fall 2012 Solution

23

Nov 06

Binary Search Tree delete implementation


Even More Tree questions

Even More Tree questions - .doc

24

Nov 08

AVL trees


AVL Tree questions

AVL Tree questions - .doc

25

Nov 13

File Structures vs. Data Structures

Good B+ Tree Summary

Wikipedia B+ Tree discussion

B+ Tree

File structure questions

File structure questions - .doc

26

Nov 15

Ch. 7: Graph terminology, traversals (BFS and DFS)


Graph questions

Graph questions - .doc

Thanksgiving Break November 17 - 25

27

Nov 27

Graph implementations


More Graph questions

More Graph questions - .doc

28

Nov 29

Graph select algorithms: topological sort, Dijkstra’s algorithm



29

Dec 04

Graph algorithms: Prim's algorithms

Code from lecture:

lec29.zip

Even More Graph questions

Even More Graph questions - .doc

30

Dec 06

Review for Final Exam

Final Exam Review Topics


Final Exam, Thursday (December 13) 10-11:50 AM in ITT 322