CS 5610D - Data Structures

• Students will develop the ability to analyze simple iterative and recursive functions.
• Students will develop the ability to solve simple summations and recurrence relations.
• Students will develop the ability to use graphs and graph algorithms in programs to solve practical problems.
• Students will develop the ability to use tree traversal techniques for practical applications (e.g., evaluating expressions).
• Students will gain an understanding and ability to use the basic terminology concerning asymptotic analysis.
• Students will gain an understanding of basic graph algorithms for searching (breadth first, depth first), finding shortest paths (Dijkstra’s algorithm and Bellman-Ford), and finding minimum cost spanning trees (Kruskal’s and Prim’s algorithm).
• Students will gain an understanding of the average and worst case analysis of the standard sorting techniques.
• Students will gain an understanding of the basic data structures and algorithms associated with hash tables and their asymptotic running times.
• Students will gain an understanding of the basic data structures and operations on heaps and their implementations.
• Students will gain an understanding of the basic data structures for storing trees (arrays, linked data structures, left-child/right sibling approaches).
• Students will gain an understanding of the basic graph data structures and terminology.
• Students will gain an understanding of the basic operations on binary search trees and their asymptotic running times.
• Students will gain an understanding of the basic operations on graphs and their running times.
• Students will gain an understanding of the basic tree traversal techniques (pre, post, and inorder traversals) and their asymptotic running times.