# Fall 2011: Program Design and Data Structures - INFS 519

## Problem Sets

- Problem Set 1 (due Sep. 20)
- Problem Set 2 (due Oct. 11)
- Problem Set 3 (due Nov. 29)
- Problem Set 4 (due Dec. 13)

## Programming Assignments

- Linked List (due Oct. 4)
- RPN Calculator (due Nov. 15)
- Heap (due Dec. 2)
- Dijkstra's Shortest Path (due Dec. 13)

## Midterm

- October 25
- Covers material from chapters 1-7
- Open notes; handwritten, single-side, 8.5 x 11
- Review

## Final

- December 13, 7:30pm – 10:15pm
- Covers material from chapters 9, 10 (sec. 1 and 2), 11, 12, and 14
- Open notes; handwritten, single-side, 8.5 x 11
- Review

## Lecture Notes

- August 30 (Introduction)
- September 6 (Objects, collections, and linked lists)
- September 13 (Generic programming)
- September 20 (Stacks, queues, and recursion)
- September 27 (Stacks, queues, and recursion)
- October 4 (Trees)
- October 11 (No class)
- October 18 (Review)
- October 25 (Midterm)
- November 1 (Searching)
- November 8 (No class)
- November 15 (Heaps and sorting)
- November 22 (Graphs)
- November 29 (B-trees)
- December 6 (Review)
- December 13 (Final)

## Study Plan

Topics | Sections |
---|---|

Introduction & classes | 1, 2 |

Collections & linked list | 3, 4 |

Generic programming and Java built-ins | 5 |

Stacks and queues | 6, 7 |

Recursion & trees | 8, 9 |

Binary search & hash tables | 11 |

Heaps & sorting | 10.1, 12 |

B-trees | 10.2 |

Graphs | 14 |