The second course in an introductory sequence for the computer science major, minor and others. Continues software engineering methodology through specification, design, coding and program correctness. Nested procedures and functions, scope and recursion. Introduction to data structures such as stacks, queues, linear lists, trees, sets and files. Analysis of sorting and searching algorithms.
Credit 3 hrs May not be repeated for additional credit Grade Mode Normal (A-F) Course Rotation
Prerequisites -COSC 111 Corequisites -COSC 212 Restriction by Major - Restriction by Class - Undergraduate standing