Sie sind auf Seite 1von 2

Course Title: Discrete Structure

Credit Hours: 3
Instructor : Daud Khan Khalil (

The Objectives of this course are to:
I. Students will be able to simplify and evaluate basic logic statements including compound
statements, Implications, Inverses, converses, and contrapositives using truth tables and the
properties of logic.
II. Write an argument using logical notation and determine if the argument is or is not valid.
Demonstrate the ability to write and evaluate a proof or outline the basic structure of and
give examples of each proof technique described.
III. Understand the basic principles of sets and operations in sets. prove basic set equalities.
Apply counting principles to determine probabilities.
IV. Demonstrate an understanding of relations and functions and be able to determine their
properties, determine when a function is 1-1 and “onto”.
V. Demonstrate different traversal methods for trees and graphics. Model problems in
computer science using graphs and trees.
Learning Outcomes:
After completing this course, the students must demonstrate the knowledge and ability to:
 Apply Mathematical induction and other techniques to prove mathematical results.
 Examine the logical validity of arguments and proofs as they apply to Boolean expressions.
Illustrate the basic terminology and properties of graphs and trees.
 Perform computations using recursively defined functions, and congruences.
 Use graphs and trees to solve problems algorithmically.
 Use methods of combinatorics to solve counting problems
Text book:
“Discrete Mathematics and its Applications” latest edition by Kenneth H. Rosen

Reference Book:
Discrete Mathematics by Ross and Wright
Grading Policy:
Mid-Term Exam 30 Marks
Assignments 10 Marks
Quizzes/ Tests/ Presentations 10 Marks
Final Term Exam 50 Marks
Assignments quizzes and presentations marks are marked in sessional

Syllabus and Schedule:
Week Topics Activities
Week 01 Introduction, Propositional Logic, types of Course outlines, semester plan,
propositions, connectives, Logical Connectives, & model papers of mid-term
Truth tables. & final semester exams were
given to students
Week 02 Truth tables; Propositional calculus; Boolean
algebra and Boolean circuits

Week 03-04 Laws, Logic, Laws of logic, sets, functions, Venn

diagrams, types of sets

Week 05-06 Applications of logic, Gates, Types of gates, Assignment No 1

Truth tables, Circuit construction from Quiz No 1
Week 07 Relation and functions, types of relations and
functions with examples

Week 08 Sequence and series, its types, examples

Week 09 Mathematical induction, solving different

equations using MI

Week 10-11 Combinatorics, The Sum rule, The Product rule


Week 12 Combinations, Trees, Pigeonhole principle

Week 13 Countable and uncountable sets, Matrices

integers and division

Week 14 Probabilities: Bayes theorem, Bernoulli trail, Assignment No 2

Random variables, Expected value. Quiz No 2

Week 15 Relations, Graphs, types of graphs

Week 16 Revision
Detail of Technology Involved:
Not applicable