Data Structures & Algorithm Analysis

Final Schedule

Your final schedule can be viewed in your Student Center. For your convenience, the following is the final times for this course.

Section Date Time
1
Thursday, December 11 12:45 pm - 2:45 pm
2
Thursday, December 11 3:00 pm - 5:00 pm
5
Thursday, December 11
10:15 am - 12:15 pm

The Family Guide to the Internet

Audio Files

Nothing says the "technology" better than cheezy music!

Name Download
Theme Song MP3 File
iPhone Ringtones (probably will work with Android) Zip File

The Video

Welcome to Data Structures

Introduction

This course deals with one of the more important questions of writing programs... how to make it work well.

There are a number of different ways to store, manipulate, and analyze data that, can have, a huge impact on whether a program completes in a second, minute or - in worst cases - years.

Major Topics

  • Design, representation and implementation of data structures
  • Algorithm analysis and design: Big-O notation; time requirement; space requirement; counting techniques
  • Application of stacks and queues, priority queues
  • Trees: binary and n-ary trees; traversals; threaded trees; heaps; binary search trees, AVL trees, B-trees, and general search trees
  • Sets and their representation: bit map, hash table, union-find
  • Graphs: traversals; spanning trees; shortest paths
  • Recursion and stack-based memory management
  • Sorting

Course Format

This class is in-person.