Courses Detail Information

VE281 – Data Structures and Algorithms


Instructor: Weikang Qian

Instructors (Faculty):

Credits: 4 credits

Pre-requisites: Ve 203 and Ve 280

Description:

Introduction to asymptotic algorithm analysis and big-O notation; Fundamental data structures including priority queues, hash tables, binary trees, binary search trees, balanced search trees, and graphs; Searching and sorting algorithms; Basic graph algorithms; Introduction to dynamic programming.

Course Topics:

  1. Asymptoticalgorithm analysis
  2. Sorting algorithms
  3. Linear-time selection algorithms
  4. Hashing
  5. Priority queues
  6. Binary search trees
  7. k-d trees
  8. Balanced search trees, such as AVL trees and red-black trees
  9. Graphsand basic graph algorithms
  10. Dynamic programing

Course Profile