Mar 18, 2018  
2015-2016 Undergraduate Bulletin 
2015-2016 Undergraduate Bulletin [ARCHIVED BULLETIN]

CS 220 - Data Structures

3 credit(s)
The study of linear lists (stacks, queues); static versus dynamic allocation; garbage collection; sparse matrices; prefix, postfix, and infix formulas; recursion and recursive algorithms; trees (binary and other representations of trees, traversal of trees); hashing; searching; sorting (bubblesort, quicksort, heapsort, mergesort); analysis of algorithms in terms of time and space complexity; graphs (representation of graphs, topological sorting, reachability, critical path algorithm).
Prerequisite(s): CS 115  (minimum grade of C).
Laboratory fee.

Click here for Spring 2018 course scheduling information.

Click here for Fall 2018 course scheduling information.