CS 226 – Program & Algorithmic Design I
Prerequisites/Corequisites: Take CS-190; Minimum grade C. (Required, Previous). Credit Hours: Min: 3; Max: Description: Introduction to problem-solving with algorithm and program development. Includes problem analysis, algorithm representation and verification, scalar and structured data types, file input and output, techniques for program design, coding, testing, and documentation and basic sorting, and searching algorithms.
CS 227 – Programming & Algorithmic Design II
Prerequisites/Corequisites: Take CS-226; Minimum grade C. (Required, Previous). Credit Hours: Min: 3; Max: Description: Continuing study of algorithmic design, implementation, and analysis including object oriented design and implementation, abstract data types, stacks, queues, and linked structures.
CS 190 – Programming Fundamentals
Prerequisites/Corequisites: Take MATH-111 or MATH-121. (Required, Previous). Credit Hours: Min: 3; Max: Description: Introduction to problem-solving and algorithm development techniques based on the program development process. Study of basic computer concepts and computer systems; elementary data types and data structures; input and output processing; control structures; modular program design; elementary file processing; algorithm design and […]
CS 190L – Programming Fundamentals Lab
Prerequisites/Corequisites: Take MATH-111 or MATH-121. (Required, Previous). | Take CS-190. (Required, Concurrent). Credit Hours: Min: 1; Max: Description: Laboratory demonstrates the topics and principles presented in the lecture.