CST 250 COMPUTER SCIENCE II
Continuation of Cst l50; development of problem solving using a high level language including abstract data types, multidimensioned arrays; strings; records and structures; function design, construction, and parameter passing methods; recursion; introduction to objects and classes; pointers: lists, stacks, queues, and trees; and file I/O. Multiple sorting and searching algorithms including concepts of program complexity. Extensive programming required. A computer use course.
(with a min grade of C-)
View the Course Finder for more detailed prerequisite information.
MATH 245 recommended. A computer use course.