CS 245 - Int. Data Structures and Algs

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. Algorithms for sorting and searching, trees, graphs, and other selected topics. Four hours lecture. Offered Fall and Spring.

Prerequisite: (MATH 235 with a minimum grade of C or MATH 201 with a minimum grade of C) and CS 112 with a minimum grade of C
Restriction: Field of Study Restricted to Data Science, Computer Science, Computer Science (4+1)
College of Arts & Sciences