Cabrillo | Cal Poly SLO | CSUMB
CST 231 | CST 237 | CST 238 | CST 300 | CST 311 | CST 328 | CST 329 | CST 334 | CST 336 | CST 338 | CST 363 | CST 370 | CST 383 | CST 438 | CST 462s | CST 499 | General Ed | Math 130 | Math 150 | Math 151 | Math 170
CST 370 - Design and Analysis of Algorithms
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.
Prerequisite(s)/Corequisite(s): (Prereq: CST 238 and MATH 170 with a C- or better)
Typically Offered: Fall, Spring
My Experience in CST-370 - Design and Analysis of Algorithms:
The class was both informative and invaluable
I was able to get some very useful and educational experimenting with ... and ....
Here are links to my journals:
I put lots of example knowledge in my journals as I came across it
The final week was for ...
From previous weeks:
Week 7's ... homework:My ...
And here's my ...
The second week for homework we got to make a ...!:
And my ...
The other assignment we did that week which was also pretty cool was creating ...
Thank You CSUMB for the ... class! The material is extremely broadly applicable and useful, as well as extremely well presented. This class ended ...day, ... ..h, 202.