Courses Detail Information
ECE2810J – 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:
- Asymptoticalgorithm analysis
- Sorting algorithms
- Linear-time selection algorithms
- Hashing
- Priority queues
- Binary search trees
- k-d trees
- Balanced search trees, such as AVL trees and red-black trees
- Graphsand basic graph algorithms
- Dynamic programing