Course Number: CMU-CS 316
Course Name: Fundamentals of Computing 2
Number of Credit Hours: 3 Credits
Corequisite(s):
N/A
Course Description:
This course introduces the student to fundamental data structures & algorithms and the tradeoffs between different implementations of the following abstractions of array lists, linked lists, stacks, queues, heaps, trees, binary search trees, and balanced trees. This course also introduces algorithm designs including searching, sorting, and recursion as well as the basic performance and analysis (i.e., the best case, worst case, average case, linear and non-linear algorithms and their impact on performance).
