Data Structures Lectures for Spring 2013

Lecture

Date

Topics

Overheads

Handouts

01

Jan 15

Ch 1: Python Review

Chapter 1 Slides

Python Review Questions

Python Review Questions - .doc

02

Jan 17

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

Chapter 2 Slides

Python classes and algorithm analysis questions

Python classes and algorithm analysis questions - .doc

03

Jan 22

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

Jan 24

Ch. 3: Linear data structures; stack implementations


Stack implementation questions

Stack implementation questions - .doc

05

Jan 29

Stack applications; Queue implementations


Linked stack implementation questions

Linked stack implementation questions - .doc

06

Jan 31

Queue applications; Deque


Deque questions

Deque questions - .doc

07

Feb 5

Ch. 6.6: Priority Queue: binary heap implementation


Heap questions

Heap questions - .doc

08

Feb 7

Unordered Lists implementations


Unsorted linked list questions

Unsorted linked list questions - .doc

09

Feb 12

Ordered List implementation Ch. 4: Recursion: fibonacci example


Ordred linked list questions

Ordered list questions - .doc

10

Feb 14

Ch. 4: Recursion continued


More recursion questions

More recursion questions - .doc

11

Feb 19

Review for Test 1

Test 1 Review Topics

Test 1 Fall 2012

Test 1 Fall 2012 Solution

Test 1 Fall 2010

Test 1 Fall 2010 Solution

12

Feb 21

Test 1: Chapters 1 - 3


Test 1 Spring 2013 Solution

13

Feb 26

Recursion examples: backtracking coin-change problem an dynamic programming


Coin-change questions

Coin-change questions - .doc

14

Feb 28

Ch. 5: Searching: linear and binary search

On-line Hashing Tutorial

Searching questions

Searching questions - .doc

15

Mar 5

Searching: hashing: chaining/closed addressing implementations


Hashing questions

Hashing questions - .doc

16

Mar 7

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


Simple sort questions

Simple sort questions - .doc

17

Mar 12

Advanced sorts: heap, merge, and quick sorts


Advanced sort questions

Advanced sort questions - .doc

18

Mar 14

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


Tree questions

Tree questions - .doc

Spring Break March 18 to March 22

19

Mar 26

Binary Search Tree implementation


More Tree questions

More Tree questions - .doc

20

Mar 28

Binary Search Tree delete method


BST delete questions

BST delete questions - .doc

21

Apr 2

Review for Test 2

Test 2 Review Topics

Test 2 Fall 2012

Test 2 Fall 2012 Solution

22

Apr 4

Test 2: Chapters 4 – 5


Test 2 Spring 2013 Solution

23

Apr 9

AVL trees


AVL Tree questions

AVL Tree questions - .doc

24

Apr 11

More AVL trees



25

Apr 16

File Structures vs. Data Structures

Good B+ Tree Summary

Wikipedia B+ Tree discussion

B+ Tree

File structure questions

File structure questions - .doc

26

Apr 18

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


Graph questions

Graph questions - .doc

27

Apr 23

Graph implementations


More Graph questions

More Graph questions - .doc

28

Apr 25

Graph select algorithms: topological sort, Dijkstra’s algorithm, Prim's Algorithm

Code from lecture:

lec28.zip

Even More Graph questions

29

Apr 30

Graph algorithms: Traveling Salesperson Problem (TSP)


TSP problem questions

30

May 2

Review for Final Exam

Final Exam Review Topics

TSP problem Backtracking & Best-first search questions

Final Exam, Thursday (May 9) 10-11:50 AM in ITT 322