Id: 003179 Credits Min: 3 Credits Max: 3

Description

Covers algorithms and their performance analysis, data structures, abstraction, and encapsulation. Introduces stacks, queues, linked lists, trees, heaps, priority queues, and hash tables, and their physical representation. Discusses efficient sorting (quicksort and heapsort) and experimental algorithm analysis. Examines several design issues, including selection of data structures based on operations to be optimized, algorithm encapsulation using classes and templates, and how and when to use recursion. Assignments include programming of data structures in an object-oriented language.

Prerequisites

Pre-Req: EECE.2160 ECE Application Programming

View Current Offerings