CST370
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.

Outcomes

Code Samples

The major outcome of this course was our increased knowledge about topics such as time complexities, sorting, searching, trees, and hashing. We learned about different algorithmic approaches such as the brute force approach as seen with selection sort and bubble sort, exhaustive search, and the divide-and-conquer method as used with merge sort and with traversals of binary trees. We discussed depth-first and breadth-first traversal methods and were introduced to counting sort and radix sort. Additionally, we covered AVL trees, 2-3 trees, heaps, and hashing methods such as linear probing and separate chaining.

Below are code samples from some of the algorithms we worked with in this class.

CST370 Algorithms

Outcomes

CST370
Algorithms