Discrete Mathematics For Computer Technology

Catalog description

The course covers topics in discrete mathematics which are essential to the discipline of computer technology. These include: logic, sequences, mathematical induction, basic set theory, functions, recursion, relations, graphs, and trees. Typically offered Spring. Prerequisite(s): MA 14700 FOR LEVEL UG WITH MIN. GRADE OF C- OR MA 15300 FOR LEVEL UG WITH MIN. GRADE OF C- OR CLM FOR MIN. SCORE OF 076 Course Learning Outcomes 1. Understand the basic concepts of: a) The Logic of a Compound Statement, b) Sequences, c) Set Theory, d) Functions, e) Recursion, f) Graphs and Trees, g) Finite-Sate Automata. 2. Apply basic concepts of discrete mathematics as a tool to solve problems commonly encountered in computer technology to the following areas: a) Digital Logic Circuits, b) Number Systems and Circuits for Addition, c) Solving Recurrence Relations by iteration, d) Regular Expressions and Regular Languages. View Class Schedule