Catalog Search
> Engineering/Engineering Technology
> EECE.3220
Course No: EECE.3220; Last Offered: Summer 2024;
Course 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 & Notes
- Prerequisites:
- Special Notes:
- Credits: 3; Contact Hours: 3
Questions About This Course?
Contact the Advising Center at 978-934-2474 or
Continuing_Education@uml.edu
Use the Back button in your browser to go back to search results.