Course Outcomes for CSC 316 - Data Structures for Computer Scientists

Upon successful completion of this course, a student will be able to...

  1. characterize the worst-case running time and space usage of algorithms and data structure operations as a function of input size;
  2. identify when recursion is useful, and design and implement complex recursive and iterative algorithms, including sorting algorithms;
  3. construct and use a number of data structures, including a stack, queue, linked list, array, tree, heap, graph, and hash table;
  4. explain how abstract data types (e.g., sequences or graphs) can be represented as different data structures (e.g., adjacency lists or adjacency matrices);
  5. describe and implement algorithms for binary search trees;
  6. describe and implement algorithms on graphs, including breadth-first and depth-first search, constructing minimum spanning trees, and finding shortest paths;
  7. describe and implement hashing functions and hash tables.

See Course Listings

See Course Coordinators