Top of page

A study of algorithm development and problem solving using top-down design, data abstraction, object-oriented programming, and program debugging and testing. Topics include memory allocation, recursion, data structures such as arrays, lists, stacks, queues, and trees, simple sorting and searching algorithms, and algorithm complexity. P-CSC 111 or POI. (D)

Second Session Course:

  • TR, 4:00PM-6:00PM, Online – Synchronous & Asynchronous, Kuykendall