Available courses

Problem-solving methods and algorithm development in a high-level programming language. Program design, coding, debugging, and documentation using techniques of good programming style. Program development in a powerful operating environment.  Prerequisites: MATH 127 or MATH 128

Data structures and algorithms for manipulating linked lists. String and file processing. Recursion. Software engineering, structured programming and testing, especially larger programs.  Prerequisite: CS 135. 3 credits.

Introduction to sequential and linked structures.  File access including sequential, indexed sequential and other file organizations.  Internal structures including stacks, queues, trees, and graphs.  Algorithms for implementing and manipulating structured objects. Big-O-notation.  Prerequisites: CS 202 and MATH 181. 3 credits.

Problem-solving methods and algorithm development in a high-level programming language. Program design, coding, debugging, and documentation using techniques of good programming style. Program development in a powerful operating environment.  Prerequisites: MATH 127 or MATH 128