Description
To investigate the essential properties of data structures and algorithms for operating on them; to use these structures as tools to assist algorithm design; to extend exposure to
searching, sorting and hashing techniques.
Credits: 4
01:198:111; CALC1. Credit not given for this course and 14:332:351.
Please note that courses for which a student has received a grade of D cannot be used to satisfy prerequisite requirements.
Semesters Offered:Spring, summer and fall
Topics: Linked lists, stacks, queues
Binary trees
Sequential search, binary search
Binary search trees, balanced binary search trees, hash tables
Heaps for priority queues
Graphs and graph algorithms
Sorting algorithms
Asymptotic analysis of time and space requirements
Expected Work: Several problem sets and programs
Exams: One midterm and one final exam
Department Learning Goals:Computer Science majors ...
- will be prepared to contribute to a rapidly changing field by acquiring a thorough grounding in the core principles and foundations of computer science (e.g., techniques of program design, creation, and testing; key aspects of computer hardware; algorithmic principles).
- will acquire a deeper understanding on (elective) topics of more specialized interest, and be able to critically review, assess, and communicate current developments in the field.
- will be prepared for the next step in their careers, for example, by having done a research project (for those headed to graduate school), a programming project (for those going into the software industry), or some sort of business plan (for those going into startups).
