CSCI 420 Data Structures and Algorithm Analysis

An introduction to data abstraction with the use of object-oriented programming. Introduces the analysis and comparison of algorithms. Considers some of the classic approaches to tasks such as sorting and searching. Explores several traditional abstract data types such as stacks, queues, binary trees, and heaps. Broadens the students' programming skills by concentrating on topics such as recursion and the use of pointers. Algorithm design and analysis, asymptotic analysis, worst and average case, recurrences, generating functions, divide-and-conquer, the greedy method, search and traversal, backtracking, and branch-and-bound.

Credits

4