Introduction to discrete mathematics. Computers and programming; running a program under UNIX; the algorithmic language; pseudocode; problem solving and program structure. Constants, variables, data types, assignments, arithmetic expressions, input and output. Top-down design and procedures. Selection and loops. Functions. Enumerated and subrange data types. Arrays, records, sets. Recursion, searching, and sorting.

Prerequisite: graduate status