CSCI 242 Algorithms & Data Structures

This course introduces fundamental concepts in data structures and algorithms, and their roles in efficient problem-solving in computer science. Topics include basic data structures such as
priority queue, heap, hash table, search trees, and graphs; introduction to classic algorithms such as searching, sorting, and selection; theoretical modeling techniques including time and
space complexity analysis, classification, upper bounds, lower bounds, exact bounds, and divide-and-conquer approaches. Prerequisite: CSCI 161 Computer Science II

Credits

3

Distribution

CS