Scribd
Upload
39 views

Discrete Math

This 3-unit discrete math course covers logic, sets, proofs, number theory, counting, graphs, and trees over 3 contact hours per week, with the goal of teaching students to prove theorems using logic, demonstrate discrete math concepts, apply counting techniques, and use graphs and trees to solve problems in computer engineering applications. The course outline includes logic, sets, proofs, functions, algorithms, integers, matrices, counting techniques, relations, graph theory, trees, and an introduction to modeling computation.

Uploaded by

Jeff Layco
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
39 views

Discrete Math

This 3-unit discrete math course covers logic, sets, proofs, number theory, counting, graphs, and trees over 3 contact hours per week, with the goal of teaching students to prove theorems using logic, demonstrate discrete math concepts, apply counting techniques, and use graphs and trees to solve problems in computer engineering applications. The course outline includes logic, sets, proofs, functions, algorithms, integers, matrices, counting techniques, relations, graph theory, trees, and an introduction to modeling computation.

Uploaded by

Jeff Layco
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Course Name DISCRETE MATH

This course deals with logic, sets, proofs, growth of functions, theory of numbers,
Course Description counting techniques, trees and graph theory.
Number of Units for 3 units lecture
Lecture and Laboratory
Number of Contact Hours 3 hours lecture
per week
Prerequisite College Algebra
Course Objectives After completing this course, the student must be able to:
1. Prove theorems and using logic
2. Demonstrate knowledge of the basic concepts of discrete mathematics.
3. Apply counting techniques in calculation of discrete probabilities.
4. Use trees and graph theory in dealing with discrete mathematics problems.
5. Exhibit awareness of issues related to the computer engineering applications of
discrete mathematics.
1. Logic, Sets, Proofs, and Functions
2. Algorithms, Integers and Matrices
2.1 Growth of Functions
Course Outline 2.2 Complexity of Algorithms
2.3 Number of Theory
2.4 Matrices
3. Counting Techniques
4. Relations
5. Graph Theory
6. Trees
7. Introduction to Modeling Computation
Laboratory Equipment None

You might also like