CS 1120 - Computer Science II

This course is a continuation of Computer Science I with more emphasis on top-down, modular, structured design and techniques involved in the production of large computer programs. Advanced language features such as recursion, sets, pointers, records/structures will be discussed. Data structures and their various implementations are introduced. Design and analysis of various searching and sorting techniques will be presented. Elementary file processing using sequential and random access input and output will be demonstrated. A team project will be assigned.

Prerequisites & Corequisites: Prerequisites: CS 1110 and one of the following: MATH 1220 or MATH 2000 or MATH 1700 or MATH 1230 or MATH 1710 or MATH 2720 or MATH 3740 (Any of the MATH prerequisites may be taken concurrently with CS 1120. Must earn a grade of “C” or better in any prerequisite.)

Credits: 4 hours