COMSATS University Islamabad

Department of Computer Science

Course Syllabus
Course Information
Course Code: CSC102 Course Title: Discrete Structures
Credit Hours: 3(3,0) Lecture Hours/Week: 3
Lab Hours/Week: 0 Pre-Requisites: None
Catalogue Description:
This course introduces mathematical structures necessary for the development of program logic. It
covers the following topics: Propositional & Predicate Logic; Arguments and Proof; Sets, Relations,
Functions; Recursion; Combinatorics; and Graphs & Tree Structures.
Text and Reference Books
Textbook:
1. Discrete Mathematics and Its Applications, Rosen, K. H., McGraw Hill, 2019.
Reference Books:
1. Discrete Mathematics with Applications, Susanna S.E., Cengage Learning, 2019.
2. Discrete Mathematics, Richard Johnsonbaugh, Pearson, 2018.
Week wise Plan:
CDF
Lecture Reading
Unit Topics Covered
# Material
#
1. 1 Introduction to Discrete Structure, Logic Definition, Proposition. Rosen: Ch1
Compound Statements and their Truth Tables: Disjunction,
2. 1 Conjunction, and Negation; Translating English Sentences into Rosen: Ch1
Symbolic logic and vice versa.
1 Conditional & Biconditional Statements, Tautologies &
3. Rosen: Ch1
Contradiction
4. 1 De Morgan’s Law, and Useful Logical Equivalences. Rosen: Ch1
Predicate Statements, Finding Truth Values of a Predicate, Universal Susanna S.E,
2 Quantifier, Truth and Falsity of Universal Statements, Existential Ch3
5.
Quantifier, Truth and Falsity of Existential Statements, Equivalent
Forms of Universal and Existential Statements.
Universal Conditional Statements, Implicit Quantification, Susanna S.E,
2 Negations of Quantified Statements, Negations of Universal Ch3
6.
Conditional Statements, The Relation among ∀, ∃,∧, and ∨,
Translating English Sentences into Predicate logic and vice versa.
2 Variants of Universal Conditional Statements: contrapositive, Susanna S.E,
7.
converse, & inverse; Nested Quantifiers. Ch3
8. 3 Valid & Invalid Arguments, Testing validity of Arguments using Susanna S.E,
Critical row method. Ch3
3 Rule of Inferences, Deducing using Inference Rules, Building
9. Rosen: Ch1
Arguments using Inference Rules.
Rosen: Ch1,
3 Proofs: Structure, Direct Proofs, Proof by Counter Example, and
10.
Proof by Contradiction.
Susanna S.E,
Ch4
11. 3 Proof by Mathematical Induction: Weak & Strong Induction Rosen: Ch5

1
 Concepts of Set: Representation of a Set (Descriptive, Tabular & Set
12. 4 builder Notation), Operations on Set, Membership table of Set Rosen: Ch2
Operation, Venn Diagram.
13. 4 Proving Set identities using Membership table and Venn Diagrams Rosen: Ch2
Relations: Relations on a Set, Representation of Relations using
14. 4 Matrix and Digraphs; Properties of a Relation (Reflexive, Rosen: Ch9
Symmetric, Anti-Symmetric & Transitive Relation).
Equivalence Relation., Partial order relation, Operations on
15. 4 Rosen: Ch9
Relations, Composition of Relations.
16. 5 Concept of Function, Special Function, Properties of Functions, Rosen: Ch9
17. 5 Pigeonhole Principle, Composition of Functions Rosen: Ch2
18. 5 Sequence and its various types, Summation Notations Rosen: Ch2
Rosen: Ch2,
19. 5 Matrices: Concepts, determinate, Matrix Operations.
Ref. Material
20.
Mid Term Exam
21.
22. 6 Recursion: Recursively defined Functions and Series, Rosen: Ch5
23. 6 Solving Recurrence Relations. Rosen: Ch5
24. 6 Generating Functions with examples. Rosen: Ch5
Counting Arguments, Sum & Product Rule, and Inclusion-Exclusion
25. 7 Rosen: Ch6
Principle.
26. 7 Permutations & Combinations. Rosen: Ch6
27. 8 Graphs: Concept, Terminologies, Representation, and Types. Rosen: Ch10
28. 8 Graph Isomorphism Rosen: Ch10
29. 8 Euler & Hamilton Circuits and Paths. Rosen: Ch10
30. 8 Graph Coloring, and Bipartite Graph. Rosen: Ch10
Trees: Rooted Tree, Binary Tree, Terminologies, Difference
31. 8 Rosen: Ch11
between Tree and Graph.
32. 8 Isomorphism of Tree and Applications Rosen: Ch11
Final Term Exam
Student Outcomes (SOs)
S.# Description
Apply knowledge of computing fundamentals, knowledge of a computing specialization, and
1 mathematics, science, and domain knowledge appropriate for the computing specialization to the
abstraction and conceptualization of computing models from defined problems and requirements
Identify, formulate, research literature, and solve complex computing problems reaching
2 substantiated conclusions using fundamental principles of mathematics, computing sciences, and
relevant domain disciplines
Design and evaluate solutions for complex computing problems, and design and evaluate systems,
3 components, or processes that meet specified needs with appropriate consideration for public health
and safety, cultural, societal, and environmental considerations
Course Learning Outcomes (CLOs)
Blooms
Sr.# Unit # Course Learning Outcomes Taxonomy GA
Learning Level
Apply symbolic propositional and predicate logic to
CLO-1 1,2 determine the most effective solutions of a given Applying 2,3
problem.

2
 Apply formal logic proofs and reasoning to construct a
CLO-2 3 Applying 2,3
sound argument.
Solve a computing problem using a specific set, function,
CLO-3 4,5 Applying 2,3
relation model.
Use recurrence relation and counting formalisms to solve
CLO-4 6,7 Applying 2,3
real-world problems.
Solve real-world problems in computer science using
CLO-5 8 Applying 2,3
appropriate forms of graphs and trees.
CLO Assessment Mechanism
Assessment
CLO-1 CLO-2 CLO-3 CLO-4 CLO-5
Tools

Quizzes Quiz 1 Quiz 2 Quiz 3 Quiz 4 -

Assignment Assignment
Assignments Assignment 1 Assignment 2 Assignment 3
3 4
Mid Term Mid Term Mid Term
Midterm Exam - -
Exam Exam Exam
Final Term
Final Term Exam
Exam
Policy & Procedures
• Attendance Policy: Every student must attend 80% of the lectures as well as laboratory in this course.
The students falling short of required percentage of attendance of lectures/laboratory work, is not allowed
to appear in the terminal examination.

• Course Assessment:
Mid Term Terminal
Quizzes Assignments Final Marks
Exam Exam
Theory (T) 15 10 25 50 100

• Grading Policy: The minimum passing marks for each course is 50% (In case of LAB; in addition to
theory, student is also required to obtain 50% marks in the lab to pass the course). The correspondence
between letter grades, credit points, and percentage marks at CUI is as follows:
Grade A A- B+ B B- C+ C C- D+ D F
Marks >= 85 80 - 84 75 - 79 71 - 74 68 - 70 64 - 67 61 - 63 58 - 60 54 - 57 50-53 < 50
Cr. 3.67- 3.34- 3.01- 2.67- 2.34- 2.01- 1.67- 1.31- 1.01- 0.10-
0.00
Point 4.00 3.66 3.33 3.00 2.66 2.33 2.00 1.66 1.30 1.00

• Missing Exam: No makeup exam will be given for final exam under any circumstance. When a student
misses the mid-term exam for a legitimate reason (such as medical emergencies), his grade for this exam
will be determined based on the Department policy. Further, the student must provide an official excuse
within one week of the missed exam.

• Academic Integrity: All CUI policies regarding ethics apply to this course. The students are advised to
discuss their grievances/problems with their counsellors or course instructor in a respectful manner.

• Plagiarism Policy: Plagiarism, copying and any other dishonest behaviour is prohibited by the rules and
regulations of CUI. Violators will face serious consequences.