Scribd
Upload
93 views2 pages

Discrete Structures Course Guide

This document provides information about a 3 credit hour course on discrete structures. The course aims to help students understand basic concepts related to discrete structures and solve problems using techniques like set theory, logic, relations, functions, trees, graphs, and counting. Topics covered include logic and proofs, sets, sequences, formal logic, induction, recursion, relations, functions, trees, graphs, number theory, and combinatorics. The course supports program learning outcomes related to problem analysis and engineering knowledge.

Uploaded by

Ashraf Muhammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
93 views2 pages

Discrete Structures Course Guide

This document provides information about a 3 credit hour course on discrete structures. The course aims to help students understand basic concepts related to discrete structures and solve problems using techniques like set theory, logic, relations, functions, trees, graphs, and counting. Topics covered include logic and proofs, sets, sequences, formal logic, induction, recursion, relations, functions, trees, graphs, number theory, and combinatorics. The course supports program learning outcomes related to problem analysis and engineering knowledge.

Uploaded by

Ashraf Muhammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Discrete Structures

Course Code MATHA-234


Credit Hours 3+0
Contact Hours 48
Prerequisite None

Course Learning Outcomes


S# Domain Taxonomy level PLO
CLO
1 Understand the basic concepts related to Discrete Cognitive 1 1
Structures as taught throughout the course
2 Solve problems using elementary set theory, Venn Cognitive 1,3 1,2
diagrams and logic.
3 Distinguish relations, functions and to solve Cognitive 1,3 2,4
counting problems
4 Solve problems using tree and graph theory. Cognitive 1,3 1,2

Relevant Program Learning Outcomes (PLOs)


1 Engineering Knowledge: 7 Environment and Sustainability: ☐
2 Problem Analysis: 8 Ethics: ☐
3 Design/Development of Solutions: ☐ 9 Individual and Team Work: ☐
4 Investigation: 10 Communication: ☐
5 Modern Tool Usage: ☐ 11 Project Management: ☐
6 The Engineer and Society ☐ 12 Lifelong Learning: ☐

Course Outline
Introduction to logic and proofs: Direct proofs; proof by contradiction, Sets, Sequences and series, Formal
logic, Prepositional and predicate calculus, Mathematical Induction and Recursion, loop invariants,
Relations and functions, Trees and Graphs, Elementary number theory, Combinatorics: K-Permutation and
K-Combination, K-Selection and K-Sampling, Inclusion Exclusion Principle, Optimization and matching.
Fundamental structures: Functions; relations (more specifically recursions); pigeonhole principle;
cardinality and count ability, probabilistic methods

Recommended Books
1 Discrete Mathematics with Applications, By: Susanna S. Epp, Edition: 4th, Publisher: Cengage
Learning,ISBN: 0495391328, Year of Publication: 2010.
2 Discrete Mathematics and Its Applications, By: Kenneth H. Rosen, Edition: 7th, Publisher: McGraw-
HillScience/Engineering/Math, ISBN: 0073383090, Year of Publication: 2011.

3 Discrete Mathematics, By: Richard Johnsonbaugh, Edition: 7th, Publisher: Pearson, ISBN: 0131593188,
Year of
Publication: 2007
4 Discrete Mathematical Structures, By: Kolman, Busby & Ross, Edition: 6th, Publisher: Pearson,
ISBN:0132297515, Year of Publication: 2008

You might also like