Graduate Computer Science

CS G100: Data Structures (not open to MS students in CS for credit)

Rapidly introduces programming techniques, algorithms, data structures, abstraction and modularization using a high level language, such as Java. Studies data structures such as records, arrays, linked lists, stacks, queues, trees, heaps and graphs. Introduces iteration and recursion as techniques for problem solving. Examines algorithms for binary search, heap sort, quick sort, depth-first and breadth-first tree and graph traversal, shortest path and minimal spanning tree. Additional topics include: set operations and hashing.
Prerequisites:
Programming experience or permission of instructor
Credit hours: 4
Course offerings: