ANNEXURE-I

Discrete Structures
Course Code CS-09202
Semester Fall 2024
Cr. Hrs. 3
Section (s) 3I

Instructor Contact Information

Instructor Mr. Hafiz Saifullah
Email [email protected]
Cell No. N/A
Zoom ID ---
Office CS-102

i) Teacher will be available during the office hours for student consultation as per following schedule:
Student Tuesday : 11:30 AM to 3:30 PM
Consultation Thursday: 10:00 AM to 3:30 PM
Hours
ii) Moreover, student can take online appointment with the teacher via Zoom for consultation.

Class Details (subject to change)

Class Class
Section Class Title Days & Times Class Dates
Type Room Location
Wednesday LB3-105, 1st Floor-CS Sep 23, 2024 -
Section BSCS-3I Lecture Discrete Structures
03:30 PM-04:45 PM Building Jan 10, 2025
Thursday Sep 23, 2024 -
Section BSCS-3I Lecture Discrete Structures CS-002-G Floor-CS Building
08:00 AM-09:15 AM Jan 10, 2025

i) Please use email rather than telephone/whatsapp for messages.

ii) Please keep emails short and focused, and use a clear subject line beginning with "
cs09202 Question".
Communicatio
iii) Instructor will generally respond within 24 hours (during the academic days).
n with
iv) Always include your name, course, and UOL email address in your messages to
Instructor
instructor. If you send an email from some address other than UOL email address
like [email protected]; instructor would not be able to recognize that you are a student of
university.
Prerequisites (Note: Instructor should define it in coordination with HOD/Faculty Committee)

Prerequisites None
:
Corequisite Basic Mathematics knowledge

Medium of Instruction

Instructor will deliver class lectures, conduct discussions and engage in all academic activities
Medium of exclusively in English. Moreover, the students are required to use English as mode of
Instruction communication for classroom discussions, group discussions, vivas /presentations, group projects
etc.

Course Material Availability on SLATE/LMS:

I will use LMS/Slate to keep in touch with my classes. In-class discussion problems, homework
solutions and supplemental materials, and scores for exams, attendance, and assignments will be
posted to LMS/SAP. You should be certain that you are able to log in to LMS/SAP, and that you
SLATE/LMS check the class page on LMS and your University email account regularly.

Course material is available on LMS: https://slate.uol.edu.pk/login/index.php

Grades will be posted on LMS/SAP: https://slate.uol.edu.pk/login/index.php

Required Text

Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th edition, 2009, McGraw Hill
Text Book 1
Book Co.
Text Book 2 Susanna S. Epp; Discrete Mathematics and applications
Text Book 3 Kolman Busby, Ross; Discrete Mathematical Structures
1. Discrete Mathematics, 7th edition by Richard Johnson Baugh
Other
2. Discrete and Combinatorial Mathematics: An Applied Introduction by Ralph P. Grimaldi
Material
3. Logic and Discrete Mathematics: A Computer Science Perspective by Winifred Grassman

Software/ Other Tools/Resources

NA

Goals: (Note: Instructor should define it in coordination with HOD/Faculty Committee)

Sr. No Goals
1 Introduce students to the mathematical aspects excessively needed by computer scientists.
2 Develop skills for mathematical reasoning and creative problem solving.
3 Develop skills for the analysis and verification of algorithms.
4 Introduce generating functions and recurrence relations.
5 Present various examples of discrete mathematics and their applications to computer science.
Course Objectives: (Note: Instructor should define it in coordination with HOD/Faculty Committee)

Sr. No Objectives
1 Apply mathematical logic to solve computational problems using truth tables and logical reasoning.

2 Understand and perform operations on sets, including combinations, permutations, and algebraic set theory.

3 Analyze relations, identify their properties (such as equivalence and partial order), and represent them using
matrices, directed graphs, and closures.
4 Identify and evaluate functions, including their properties like domain, codomain, range, one-to-one, onto,
composite, and inverse functions.
5 Define, describe, and analyze graphs, digraphs, and trees, focusing on their main properties and applications.
6 Use formal logic proofs, including mathematical induction, to prove theorems and reason rigorously in
problem-solving contexts.
7 Differentiate between various discrete structures and understand their relevance to computer science,
particularly in data structures and algorithms.
8 Integrate discrete structures into various computing fields such as formal specification, verification,
databases, artificial intelligence, and cryptography.
9 Utilize quantifiers, conditional propositions, and switching circuits as applications of logic.

COURSE REQUIREMENTS (Subject to Change)

(Note: Instructor should define it in coordination with HOD/Faculty Committee)

A. Class Attendance:
You are expected to attend class and participate by asking questions, answering questions and contributing to topical
discussions. You are expected to arrive prior to the beginning of class. Class members will be randomly selected to
answer questions and/or help with the solution of exercises.
If you do miss a class, it is your responsibility to ensure that you understand the material covered and the
announcements made in the class you missed. You may not use office hours to have the professor explain the material if
you missed the class when it was discussed.
B. Class Participation:
The following factors will be considered in evaluating class participation:
(1) Attend class sessions and contribute to a positive learning environment,
(2) Ask thoughtful questions,
(3) Participate in discussion,
(4) Prepare for reading and assignments conscientiously.

A positive learning environment results when you demonstrate respect for other students and the instructor, are
courteous and attentive, assist others in learning, attend class regularly, and arrive in class on time.

C. Homework/Assignment:
Doing the homework is essential for success in this course. Throughout the semester, at least 4
Homework/Assignments (5 marks/points each), 2 before Mid-Term and 2 after Mid-Term will be given.
Homework/Assignment assigned will be discussed in class when time permits; but you may not understand it
completely unless you have already attempted the work. Programming is a discipline that cannot be learned merely by
watching; it is learned only by doing. By attempting each homework problem prior to the class discussion, you can
maximize your learning experience and will be in a position to ask appropriate questions and identify areas where you
need help. Accordingly, homework should be done as instructed before coming to each class.
Incomplete work (or cheating on an assignment) cannot be accepted. Late homework cannot be accepted (as the
solution will be posted right after the collection of the assigned homework).
D. Quizzes
Throughout the semester, at least 4 quizzes (5 marks/points each), 2 before Mid-Term and 2 after Mid-Term will be
given in class on material covered in the previous week(s) to ensure that you are keeping current. There are no make-
up quizzes. If you are not in class on the day of a quiz, you will receive a zero.
E. Exams:
There will be two (2) exams for the semester. All exams are “closed book.” Students will not be given any extended
time if arriving late on that day.

Exams will be a combination of objective questions (e.g., multiple choices, short answer) and numerical problems. To
receive credit for numerical answers, adequate supporting computations (and also explanations if necessary) must be
provided.
No makeup exam will be given and the exam will not be administered on any other day!

EVALUATION & GRADING :

(Note: Teacher should modify it as per University/Department Policy in Consultation with HOD/Faculty Committee)

The course grades will be determined by the following:

Components Marks Weight

Mid-Term 30 30%
Lab NA NA
Final-Exam 50 50 %
Quizzes (4*5 points) 20 10%
Home Work/Assignment (4*5 points) 20 10%
Total 120 100%

Your Responsibilities
Sr.
Major Responsibilities
No.
1 Arrive on time and do not leave before the end of the class period.
Refrain from causing other distractions (ringing cell phones, talking while others have the floor, etc.).
2
Disruptive students will be asked to leave the class
3 Treat everyone with respect
Be responsible for all assigned materials plus everything covered in class. If you missed classes, make
4
arrangements with another student to collect handouts and to update you on classes you missed
5 Xxxx

ACADEMIC HONESTY STATEMENT

Academic dishonesty, which includes cheating, fabrication, facilitation of academic dishonesty, and plagiarism, is a
serious academic offense. A grade of "F" shall be assigned to any student who engages in academic dishonesty in this
class, and formal disciplinary action shall be taken. (Plagiarism in any assignment or cheating in the examinations will
result in a grade of F in the entire course).
THIS SYLLABUS CONSTITUTES A CONTRACT BETWEEN THE STUDENT AND THE FACULTY OF IT (FIT). THE TERMS
AND CONDITIONS CONTAINED IN THIS CONTRACT ARE DEEMED TO BE ACCEPTED BY EACH STUDENT WHO
REMAINS IN THIS COURSE AFTER THE OFFICIAL DROP DATE.

Homework/Assignment and Quiz Details (subject to change)

Homework (HW)/Assignment Quiz

Solution
Solution Posting of Submission
Homework/ HW/Assignment Result Quiz Posting of Result
Week HW/Assignment Week of Quiz by
Assignment Submission by Submission (on Quiz by Declaration
No By Teacher on No Student on
(on LMS) Student on LMS Date LMS) Teacher on date
LMS LMS
LMS
Assignment 1 Immediately after Within the Immediately
Within the Time
Week the assignment Within Week Time Frame after the quiz Within
Frame Assigned Quiz 1
4-5 submission dead 7days 3-4 Assigned by submission, 7days
by Teacher
line ends. Teacher Closing time
Assignment 2 Week Within Week Same as Same as Within
Same as Above Same as Above Quiz 2
6-7 7days 6-7 Above Above 7days
Assignment 3 Week Within Week Same as Same as Within
Same as Above Same as Above Quiz 3
12-13 7days 11-12 Above Above 7days
Assignment 4 Week Within Week Same as Same as Within
Same as Above Same as Above Quiz 4
14-15 7days 13-14 Above Above 7days
Reading
Every Week
Assignments

Note: This is the minimum number of Home Work/Assignments and Quizzes. The instructor should encourage to add more Home Work/Assignments and
Quizzes.

Submitting Work:
1. Most assignments will be submitted electronically via Slate/LMS.
2. Please do not email submissions until and unless necessary due some justified reason.

Course Contents and Tentative Class Schedule Table-I (subject to change)

Week Chapter Exam/Quiz/Assignment

No Dates Topics Book Name
No Category
Result
Declaration
Kenneth Rosen, Discrete
Mathematics and Its
Logic and Proofs Applications, 7th 1 NA NA
edition, 2009, McGraw
25-09-2024 Hill Book Co.
1 Propositional Logic Same as Above 1 NA NA
Propositions
Same as Above 1 NA NA
Conditional Statements
Converse, Contrapositive, and Inverse
26-09-2024 Biconditionals 1 NA NA
Applications of Propositional Logic
Propositional Equivalences Same as Above 1 NA NA
2-10-2024 Logical Equivalences Involving
Same as Above 1 NA NA
Conjunction and Disjunction
2 Logical Equivalences Involving
Conditional and Biconditional Statements Assignment 1
3-10-2024 Same as Above 1 (Week 2/Week3)
Within 7 Days
Converse, Contrapositive, and Inverse
Constructing New Logical Equivalences
 Exam/Quiz/Assignment
Week Chapter
No Dates Rules of InferenceTopics
for Propositional Book Name
No
Same as Above 1 NA NA
Logic
09-10-2024
Valid Arguments in Propositional Logic Quiz 1
Same as Above 1 (Week 3/Week4)
Within 7 Days
3 Rules of Inference for Propositional Logic
Using rules to build Arguments
10-10-2024 Resolution Same as Above 1 NA NA
Fallacies
Predicates and Quantifiers Same as Above 1 NA NA
Predicates
16-10-2024 Quantifiers
Same as Above 1
Quantifiers with Restricted Domains
Precedence of Quantifiers
4
Binding Variables
Logical Equivalences Involving Quantifiers
17-10-2024 Negating Quantified Expressions Same as Above 1 NA NA
Translating from English into Logical
Expressions
Nested Quantifiers
Understanding Statements Involving Nested
Quantifiers
23-10-2024 The Order of Quantifiers Translating from Same as Above 1 NA NA
Nested Quantifiers into English
5
Translating English Sentences into Logical
Expressions
Rules of Inference for Quantified Statements
24-10-2024 Combining Rules of Inference for Same as Above 1 Assignment 2 Within 7 Days
Propositions and Quantified Statements (Week 5/Week6)

Introduction to Proofs Same as Above 1 NA NA

Understanding How Theorems Are Stated
30-10-2024
Methods of Proving Theorems Same as Above 1 NA NA
6
Direct Proofs
Proof by Contraposition Quiz 2
31-10-2024 Same as Above 1 (Week 6/Week7)
Within 7 Days
Proofs by Contradiction
Functions Same as Above 2 NA NA
Functions
6-11-2024
Range and Domain of a function Same as Above 2 NA NA
The Graphs of Functions
7
Types of Function
One to one Function
7-11-2024 Same as Above 2 NA NA
Onto Function
Bijective Function
Inverse & Composition of Function Same as Above 2 NA NA
Inverse of One-to-One Function
13-11-2024 Inverse of ONTO Function
Same as Above 2 NA NA
Inverse of Bijective Function
Composition of Function
8 Number Theory Same as Above 4 NA NA
Primes and Greatest Common Divisors
Primes
14-11-2024 Greatest Common Divisors and Least
Same as Above 4 NA NA
Common Multiples
The Euclidean Algorithm

9 18-11-2024 Midterm Within 5

To Days
Week Chapter Exam/Quiz/Assignment
No Dates Topics Book Name
No
24-11-2024
Sets Same as Above 2 NA NA
Venn Diagrams
27-11-2024 Subsets
The Size of a Set Same as Above 2 Assignment 3 Within 7 Days
(Week10/Week11)
10 Power Sets
Cartesian Products
Set Operations
Set Identities
28-11-2024 Same as Above 2 NA NA
Generalized Unions and Intersections
Computer Representation of Sets
Relations Same as Above 9 NA NA
Relations and Their Properties
04-12-2024 Functions as Relations
Same as Above 9 NA NA
Relations on a Set
Properties of Relations
11 Quiz 3
Representing Relations Same as Above 9 (Week 11/ Within 7 Days
Week12)
05-12-2024 Representing Relations Using Matrices
Representing Relations Using Digraphs Same as Above 9 NA NA
Equivalence Relations
Trees Same as Above 11 NA NA
Introduction to Trees, Applications of
11-12-2024 Trees and Tree Traversal
Properties of Trees Same as Above 11 NA NA
Binary Search Trees
12
Traversal Algorithms
Graphs Same as Above 10 NA NA
12-12-2024 Graph Models
Graph Terminology Same as Above 10 Assignment 4 Within 7 Days
(Week12/Week13)
Special Types of Graphs
Complete Graph 10
Regular Graph
Same as Above NA NA
Matrix representation of graph
Directed Graph
18-12-2024
planer Graphs 10
graph coloring
13 Same as Above NA NA
Euler graphs
Hamiltonian paths
The Basics of Counting 6
Basic Counting Principles Quiz 4
19-12-2024 Same as Above (Week Within 7 Days
Sum rule, Product rule 13/Week14)
Inclusion exclusion principle
14 Permutations & Combinations & 6
Same as Above
Pigeonhole Principle
Permutations & Combinations Same as Above 6
25-12-2024
The Generalized Pigeonhole Principle Same as Above 6
Some Elegant Applications of the
Pigeonhole Principle

26-12-2024 Induction and Recursion Same as Above 5

Mathematical Induction Same as Above 5
Mathematical Induction
 Exam/Quiz/Assignment
Week Chapter
No Dates Examples of ProofsTopics
by Mathematical Book Name
No
Induction
Guidelines for Proofs by Mathematical
Induction
Sequences Same as Above 2
Formal Definition of Sequence Same as Above 2
01-01-2025
Arithmetic Sequence
Geometric Sequence
15 Summations Same as Above 2
Introduction Same as Above 2
02-01-2025 Properties of Summations
Arithmetic & Geometric series in
Summation
Susanna S. Epp;
8-1-2025 Algorithm Discrete Mathematics 3 NA NA
and applications
16
Complexity of Algorithms Same as Above 3 NA NA
Growth of Functions Same as Above 3 NA NA
9-1-2025
Recursion Same as Above 3 NA NA
06-01-2025
17 To Final Exam Week
12-01-2025 Within 3
Final Term
13-01-2025 Days
18 To Final Exam Week
18-01-2025