CSCI 3383 Algorithms
This course is a study of algorithms for, among other things, sorting, searching, pattern matching, and manipulation of graphs and trees. Emphasis is placed on the mathematical analysis of the time and memory requirements of such algorithms and on general techniques for improving their performance.
Course overview
- Department
- Computer Science
- School
- MCAS
- Credits
- 3
- Level
- Undergraduate
- Offered
- Every Fall,Every Spring
Catalog details
- Prerequisites
- CSCI2243 or MATH2216 and CSCI1102 and CSCI2244 or MATH4426
Requirements fulfilled
- Computer Science B.A.: CSCI 2000-level-or-higher elective (Current University Catalog; students should confirm their catalog year)
- Computer Science B.A.: CSCI 3000-level-or-higher elective (Current University Catalog; students should confirm their catalog year)
- Computer Science B.S.: CSCI 3000-level-or-higher elective (Current University Catalog; students should confirm their catalog year)
- Mathematics B.S.: Natural science, computer science, or economics corequisites (Current University Catalog; students should confirm their catalog year)
- Computer Science B.A.: Required computer science core (Current University Catalog; students should confirm their catalog year)
- Computer Science B.S.: Required computer science core (Current University Catalog; students should confirm their catalog year)
Official evaluation summary
3.48 / 5
Data freshness
Instructors
- Ilya Volkovich
- Alexander Creiner
- Donglai Wei
- Hsin Hao Su
- Jose Bento Ayres Pereira
- Sergio Alvarez
Sections
- Section 01