CS 245A - Int Data Structs and Algs w/AI

Unit(s): 4

Algorithm analysis and asymptotic running time calculations. Review of arrays, linked lists, stacks, queues, binary trees, with a focus on runtimes of their member methods. Algorithm design techniques and implementation details using Python. Algorithms for sorting and searching, trees, graphs, and other selected topics. Applications will be focused on utilizing AI and designing AI models.

Prerequisite: (MATH 235 with a minimum grade of C or MATH 201 with a minimum grade of C) and CS 112A with a minimum grade of C
College of Arts & Sciences