Course ID:
Course Code & Number
MATH 250
Course Title
Discrete Mathematics for Engineering
Level
BS
Credit Hours/ ECTS Credits
(3+0+0) 3 TEDU Credits, 5 ECTS Credits
Year of Study:
Semester:
Type of Course:
Mode of Delivery:
Language of Instruction:
Pre-requisite / Co-requisite::
Pre-requisites: NONE
Co-requisites: NONE
Catalog Description
Logic. Logic gates. Proofs. Sets. Functions. Sequences. Algorithms. Searching and sorting algorithms. Complexity. Integers and congruences. Mathematical induction. Basic principles of counting. Permutations. Combinations. The Pigeonhole principle. Recurrence relations. Graphs. Trees. Automata and Turing machines.
Course Objectives
Software Usage
Course Learning Outcomes
Learning Activities and Teaching Methods:
Assessment Methods and Criteria:
Assessment Methods and Criteria Others:
Design Content
Recommended Reading
Required Reading
Grading
Learning Activities and Teaching Methods Others:
Course Coordinator:
Student Workload:
| Workload | Hrs |
|---|
Course & Program Learning Outcome Matching: