MATH 130

INTRODUCTION TO COMPUTER PROGRAMMING

4 UNITS

Pass/No Pass or Grade is Allowed

Prerequisite: Intermediate algebra proficiency, as determined through the Southwestern College Multiple Measures Process.

Lecture 3 hours, laboratory 3 hours

Offered: ALL

Uses Java to introduce object-oriented programming and software engineering with an emphasis on applications in science, engineering and mathematics. Introduces classes, methods, parameters, control structures, and basic inheritance. Emphasizes use of modularity, abstraction, documentation, testing, and verification techniques. [D; CSU; UC; C-ID COMP 122]

MATH 140

DATA STRUCTURES AND ALGORITHMS

4 UNITS

Pass/No Pass or Grade is Allowed

Fee: $2

Recommended Preparation: RDG 158 or equivalent or through the Southwestern College multiple measures placement processes.

Prerequisite: MATH 130 or equivalent.

Lecture 3 hours, laboratory 3 hours

Offered: ALL

Introduces the fundamental concepts of computational data structures and algorithms. Includes recursion, builds on object-oriented programming ideas, introduces fundamental data structures (including stacks, queues, linked-lists, heaps, priority queues, hash tables, trees, and an introduction to graphs), and the basics of algorithm analysis. Examines implementation and analysis of sorting and searching algorithms. [D; CSU; UC; C-ID COMP 132]

MATH 230

COMPUTER ORGANIZATION AND ARCHITECTURE

4 UNITS

Pass/No Pass or Grade is Allowed

Fee: $2

Prerequisite: MATH 130 or equivalent.

Lecture 3 hours, laboratory 3 hours

Offered: ALL

Provides basic concepts of computer organization and architecture, machine language principles, computer memory organization, Input and Output (I/O) fundamentals, and elements of computer logic design. Emphasizes tradeoffs involved in fundamental architectural design decisions. [D; CSU; UC; C-ID COMP 142]

MATH 265

DISCRETE STRUCTURES

3 UNITS

Grade Only

Prerequisite: MATH 122 or MATH 251 or equivalent; MATH 130 or equivalent.

Lecture 3 hours

Offered: ALL

Introduces discrete structures used in Computer Science with an emphasis on their applications, including programming. Covers topics such as Functions; Relations and Sets; Basic Logic; Proof Techniques; Basics of Counting; Graphs and Trees; and Discrete Probability. [D; CSU; UC; C-ID COMP 152]