CSC 303 - Data Structures

Credit Hours: 3
Prerequisite: CSC 233 with a grade of C- or better. Review of professional and ethical issues. Algorithm analysis to include big “O” notation, average and worst case behaviors, time and space trade offs. Fundamental array searching/sorting techniques. Review of basic algorithm design and object-oriented design. Pointers and fundamental pointer structures of stacks, and queues. Advanced data structures of linked-lists, binary trees, graphs, hash tables, and heaps. Fundamental computing algorithms to include hash tables, binary search trees, depth-first and breadth-first traversals, minimum spanning trees, and shortest-path algorithms. Advanced programming techniques as time permits. Fall