CSI 2114 A - Data Structures
(Fall 2003)

Professor
Section A:
Paola Flocchini
Office: SITE 5064
Email: flocchin@site.uottawa.ca

Final Marks

Topics covered by the Midterm

Solutions of the Midterm

Assignments

Help desk for the second programming assignment.
General Guidelines
The Assignments

Course Slides

• Introduction: ( here )
• Stacks, Queues and Deques: ( here )
• Algorithm Analysis: ( here )
• More Stacks: ( here )
• Sequences: ( here )
• Priority Queues: ( here )
• Trees: ( here )
• Heaps: ( here )
• Binary Search Trees: ( here )
• AVL Trees: ( here )
• 2-4 Trees: ( here )
• Hash Tables: ( here )
• Tries: ( here )
• Graphs: ( here )
• Graphs a few modifications to some of the previous slides: ( here )
• Traversals: ( here )
• Shortest Path: ( here )
• Min Spanning Tree: ( here )
• Insert, Selection Sort: ( here )
• Bubbleort: ( here )
• Recursive Sorting: ( here )
• Radix Sort: ( here )

 

• ( Other Material: Past Exams )

Some Demos:
• AVL Trees: AVL trees (due to Arsen Gogeshvili)
• 2-4 Trees: 2-4 trees (due to Stern, Naish, Sondergaard)
• Sorting: A Nice Sorting Demo (due to David Eck)

A FORUM for asking questions will be kept on VIRUALCAMPUS . You should get an account.
Some course and Lab material will also be posted there.
The most up-to-date version of our slides will be however posted HERE.
Here are the Instructions for accessing VirtualCampus .