CS 240. Algorithms and Data Structures

3.00
Students learn how to implement stacks, queues, lists, sets and maps using arrays, linked lists, binary trees, heaps, binary search trees, balanced trees and hashing. Students study graph representations and algorithms. Students analyze recursive and non-recursive algorithms, illustrated by various searching and sorting algorithms. Additional topics may be included as time permits. You may only enroll in CS 240 at most twice. Prerequisite: Fully admitted Computer Science majors or minors only and grades of “C-” or better in CS 159, CS 227 /MATH 227 or MATH 245 , and MATH 231 or equivalent.