ITEC 122
DISCRETE MATHEMATICS

1. Catalog Entry

ITEC122. Discrete Mathematics
Three hours lecture (3).

Prerequisite: ITEC 120 ("C" or better) and MATH 121, or MATH 138 or MATH 140 or MATH 145 or MATH 151 or MATH 155.

An introduction to discrete mathematical concepts including set theory, finite state machines, and induction. Students who have received credit for CPSC 122 may not receive credit for ITEC 122.

2. Detailed Description of Content of Course

Topics covered:

1. Logic and sets: basic concepts, combinatorial circuits, Boolean algebra, mathematical induction and recursion
2. Counting principles: basic techniques, combinations, permutation, notation, the binomial theorem
3. Recurrence relations
4. Graph theory: trees, binary trees, search algorithms, shortest path algorithms, spanning trees, connectedness, matching, cycles, applications
5. Complexity of algorithms: time and space, big O notation

The topics above follow the recommendations of the Mathematical Association of America Committee on Discrete Mathematics in the First Two Years.

3. Detailed Description of Conduct of Course

The course is usually taught by lectures which present concepts and examples of applications. Regular homework exercises are assigned and discussed in class. Exercises range from routine drills on basic definitions and concepts to problems which require considerable ingenuity to solve.

4. Goals and Objectives of the Course:

• To introduce certain theoretical concepts of discrete mathematics which are especially pertinent to computer science.
• To further acquaint students with the methods of mathematical problem solving in general.
• To apply mathematical theory to aid in designing computer programs.

5. Assessment Measures

Assessment of student achievement is measured by written tests and the grading of programming and problem solutions done outside of class.

6. Other Course Information

None.

7. Review and Approval

DATE ACTION APPROVAL
Sept. 25, 2001 Updated John P. Helm, Chair