CSD335 — Algorithms and Data Structures
5 credits Students study data structures such as stacks, queues, hash tables, heaps, trees, and graphs, and use different algorithmic approaches to problem solving, such as simple recursion, backtracking, divide and conquer, greedy and brute force algorithms, and dynamic programming. Students analyze algorithm efficiency in terms of memory use and speed, using Big O notation for run-time performance estimation. Prerequisites: CS 143 and admission to the BAS IT:CSD program Course
Prerequisites: CS143