Assessment Activities &

Course Course Course Learning Outcomes Taxonomy PLOs Addressed by Course

Weight Percentage
Code Title (CLOs) Domain (PLO No.)
Assessment Weight

Define the fundamentals Quiz 1 & 2 25

concepts of discrete structures,
Assignment 1 & 2 25
sets, function, types of C1 (Knowledge) PLO 1 (Computing Knowledge)
functions, propositional calculus Mid Term 50
and formal logic
Final Term 0

Quiz 3 & 4 10
Explain methods of proofs, C2 & C3
Discrete Assignment 3 & 4 15 PLO 2
CS-103 counting, relations, Boolean (Comprehension
Structures (Problem Analysis)
algebra and solve the problems Mid Term 25 & Application)

Final Term 50

Quiz 5 & 6 10
Construct and Design problems PLO 3
Assignment 5 & 6 10
related to Graph theory, Trees, C5(Synthesis) (Design/
and Algorithms Mid Term 5 Development of solution)

Final Term 75
CLO’s and PLO’s of Discrete Structure

1
 Instructor Information
Instructor: Imran Khalil
Email : [email protected]
Office Location: Hayatabad Campus
Office Hours
 Monday (12:00 noon to 2:00pm)
 Tuesday (12:00 noon to 2:00pm)

Course Information
Course Pre-Requisite:
 None

Courses Books:
1. Discrete Mathematics & its Application 5th Edition by Kenneth H. Rosen
2. Discrete Mathematics by Anjana Gupta
3. Discrete Mathematics by Schaum’s Outlines 3rd Edition
4. Discrete Mathematics for computer scientists by Joe L. Mott

Reference Book’s: Any latest book’s/online resources

Grading Policy
 Sessional : 25%
 Mid Term : 25%
 Final Term : 50%

Class Information
Class Timings:
 Sections A
o Thursday (08:00 am to 09:30 am) Main Campus
o Friday (08:00 am to 09:30 am) Main Campus

 Section B
o Thursday (08:00 am to 09:30 am) Main Campus
o Friday (08:00 am to 09:30 am) Main Campus
Class Policy:
 Students failing to secure 75% attendance shall not be allowed to sit in the Final
Examination.
 Students, who are absent on the announcement date of assignment / test, must get
the topic / chapter of the test / assignment confirmed through their peers.
 Assignment submission dead-line must be observed. In case of late submission, 10%

2
 marks per day may be deducted after due date.
 Mobile phones must be switched-off in the class-room.
 Course-books and relevant course-material is available in the library for reference and
photo-copying. Assignments must be submitted in time, late submission will not be
accepted, however there is a grace period of 2 days (counted towards the whole
semester) for each student.

Week Topics to be Covered (Weekly) Assignments/Quiz

Discrete Mathematics
Continuous vs. Discrete mathematics
1 Applications of discrete mathematics Assignment #01
Sets Published
Subset, symbols and notations
Venn Diagram
Set operations
Functions
Definition and Applications of Functions
2 Types of functions
1. One to one function (injective function)
2. Onto (surjective) function
3. Bijection or one to one correspondence
4. Inverse function
5. Floor and ceiling functions
Propositional Calculus and Formal Logic
Propositions
Logical Connectives
 Disjunction, Exclusive OR Assignment # 01
 Conjunction due
3  Negation
 Conditional Operator Assignment # 02
 Biconditional Operator Published,
 Tautology
 Contradictions
 Equivalence
Precedence Rules
Methods of Proof
Definition & Applications
4&5 Several ways of proving theorem
 Law of detachment (Modus Pones) Quiz # 01
 Law of Contra position (Modus tollens)

3
  Disjunctive Syllogism Assignment # 02
 Hypothetical Syllogism due
 Direct proof
 Indirect Proof Assignment # 03
o Proof by contrapositive Published
o Proof by contradiction
Counting (Combinatorics)
Definition & Application
6 Basic Counting Principles Assignment # 03
 Sum Rule Due
 Product Rule Quiz # 02
 Rule of permutations
 Rule of Combinations
Relations
Definition and Application
Binary Relation
Properties of relations
 Reflexive relation
 Symmetric relation
 Asymmetric relation
 Anti-symmetric relation
7&8  Transitive relation Quiz # 03
 Equivalence relation
Pictorial Representation of relations
 Representation of relations on Finite sets
 Directed graph of relations on sets
Composition of relation
Closures of relations
 Reflexive closure
 Symmetric closure
 Transitive closure
Mid Term Examination
Boolean Algebra Assignment # 04
Boolean Identities Published
Logic Gates and circuits
 OR, AND, NOT, Exclusive OR, NAND, NOR Assignment # 04
Truth table and Boolean functions Due
9&10 Karnaugh Map (K-Map) Assignment # 05
 One variable maps
Published
 Two variable maps
 Three variable maps Quiz # 04
 Four variable maps

4
 Graph Theory
 Graph
 Vertices and Edges
 Degree of a vertex in a linear graph
 Multi graph
 Directed graph
 Directed multi graph
 Konigsberg Bridge problem
11&12  Three utility problem
 Isolated vertex
 Pendent vertex
 Null Graph Assignment # 04
 Open edge train or Open Walk Due
 A closed walk or a circuit
 Operations on Graph Assignment # 05
o Union of two graph Published
o Intersection of two graph Quiz # 04
o Difference of two graph
o Addition of two graph
o Bipartite graph
o Complete graph
o Regular graph
Trees
Binary Trees
Complete binary tree
Extended binary tree Assignment # 05
Representation of binary trees in memory Due
 Linked representation of binary tree
 Sequential representation of binary tree Assignment # 06
Traversing binary tree Published
13&14  Pre-order traversing
Quiz # 05
 In-order traversing
 Post-order traversing
Binary Search Tree (BST)
 Searching and inserting in a binary tree
 Deletion in a binary tree
Algorithms
Properties of algorithm
 Input, output, definiteness, correctness, Finiteness,
Effectiveness, Generality Assignment # 06
Complexity of algorithms Due
 Efficiency  Time and Space
Linear Search algorithm

5
 Worst case and Average case Quiz # 06
Binary search algorithms
15&16

Final Term Examination