Skip to content
2019 SpringCST 370 Section 03, 4 units
Design&Analysis ofAlgorithms
Days, times, and locations
- Tuesday, Thursday 4:00pm to 5:50pm
Joel and Dena Gambord Business and Information Technology Building - Room 117
Enrollment
- Open seats
- 1
- Total enrolled
- 37
- Maximum enrollment
- 38
How to register
To register, you need permission from the instructor.Learn more about permission codes.
Use this number to register for the course in OASIS:
23712
Instructors
Students learn important data structures in computer science and acquire fundamental algorithm design techniques to get the efficient solutions to several computing problems from various disciplines. Topics include the analysis of algorithm efficiency, hash, heap, graph, tree, sorting and searching, brute force, divide-and-conquer, decrease-and-conquer, transform-and-conquer, dynamic programming, and greedy programming. (Prereq: CST 238 AND MATH 170)
University requirements
This course does not fulfill any general university requirements.
Buy books
Purchase books for this course from the CSUMB bookstore