This course is designed to provide a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation. Initially, students become familiar with fundamental data structures (i.e., arrays and link lists) that are the building blocks for constructing all higher-level complex data structures. Then, recursion and algorithm analysis is covered. This course presents a subset of higher-level data structures that are more pertinent to data science by way of abstract data types. Trade-offs between a number of different implementations of each abstract data type (ADT) are analyzed.
Prerequisites: LE/EECS 1019 3.00 or LE/EECS 1028 3.00 or SC/MATH 1019 3.00 or SC/MATH 1028 3.00; LE/EECS 1516 3.00.
Course Credit Exclusion: LE/EECS 2011 3.00, LE/EECS 2101 3.00, LE/DIGT 2102 8.00.
Tips: you can drag and drop the boxes to clone them to different sections or groups within a prerequisite equation.
Prerequisite Equation
Edit the prerequisite equation to this course:
note: adding data in this section will override data in the Prerequisite List.
+ add prereq equation
Prerequisite List(Overridden by Prerequisite Equation)
Edit the list of prerequisites to this course:
note: data in this section will be override by the Prerequisite Equation if it exists.
+ add new course
Exclusion List
Edit the list of course cerdit exclusions to this course:
+ add new course
Your name (optional):
Any additional comment (optional):
Thank you for your edit suggestion!
Our staff will review and approve it soon.
You can close this page now.
There might have been an error with the server or your input.
Please check your entry and/or try again later.