Data Structures - 605.202

This course investigates abstract data types (ADTs), recursion, algorithms for searching and sorting, and basic algorithm analysis. ADTs to be covered include lists, stacks, queues, priority queues, trees, sets, and dictionaries. The emphasis is on the trade-offs associated with implementing alternative data structures for these ADTs. There will be four substantial programming assignments. This course will be taught in a language agnostic fashion. Students may choose to develop their work in Java, C++, or Python Prerequisite(s): One year of college mathematics. EN.605.201 Introduction to Programming Using Java or EN.605.206 Introduction to Programming in Python or equivalent. Course Note(s): Not for graduate credit. A course in data structures is needed for admission to the Computer Science and Cybersecurity program. Students who lack this prerequisite can fulfill admission requirements by completing this course with a grade of B– or better. A course in data structures is conditionally required for admission to the Information Systems Engineering program. Students who lack this prerequisite can satisfy it by completing this course with a grade of B– or better before taking any course that requires it. A second course in programming is required for admission to the Artificial Intelligence program. Students who lack this prerequisite can satisfy it by completing this course with a grade of B– or better before taking any course that requires it. Students in the Artificial Intelligence program who plan to take the EN.605.621 Foundations of Algorithms and EN.605.649 Introduction to Machine Learning Sequence are required to take EN.605.202 or equivalent.