The University of Faisalabad

School of Computational Sciences

Contact Total Lectures

Course Code Course Title Credit Hours
Hrs/Week Allocated
CS-121 Discrete Structures 3(3-0) 3 48

Commencement of Mid Semester Semester

Discipline Semester no
Semester Examination Termination Date
BSCS/BSSE 3rd 13-09-2021 08-11-2021 15-01-2022

PREREQUISITES
None

Instructor Name : Mubeen Alam Email : [email protected] What’sapp/ Contact # :

03002641192

COURSE DESCRIPTION:
The purpose of this course is to understand and use (abstract) discrete structures that are backbones of computer
science. In particular, this class is meant to introduce logic, proofs, sets, relations, functions, counting, and probability,
with an emphasis on applications in computer science.

COURSE LEARNING OUTCOMES/OBJECTIVES (CLOS)

Apply mathematical logic to prove properties of software
Predicate calculus and natural deduction
Boolean algebra and equation reasoning
Mathematical induction
Understand fundamental data structures
Sets
Trees
Functions and relations
Additional topics
Graphs
Counting
Logic Complexity

LEARNING ACTIVITIES SUMMARY

Discrete Structure is a 3 credit hours course. The expectation is that students will be spending 5 hours per
Workload week working on the course. Three of those hours are theory contact hours; the remainder of the time
should be spent working on practical work, research and assessment tasks.
A selection of these following topics will be covered in this course base:
-Overview of basic Discrete Structures and mathematical logics. [CLO 1]
-Implementing and Analyzing Simple mathematical logics along with their Complexities [CLO2].
Learning
-Analyzing and Implementing linear and non-linear solutions by mathematical logics. [CLO3].
Activities
-Formulating Solutions for Linear and Non-Linear Data by logic or truth table. [CLO4].
-Improving Performance by Implementing New Techniques and Tools and Implementing New mathematical
Techniques {CLO4].

TEACHING AND LEARNING METHODS

-Live lecture sessions, preferably on Google Meet or any other tool that serves the purpose
-Recorded sessions to be provided after every lecture, in some cases pre-recorded session
-Question Answer Session
-Discussions and Examples
Page 1 of 4
-Case Studies
-Video links of related topics, when needed

FACILITIES REQUIRED FOR TEACHING AND LEARNING

-Learning Management System
- Internet Facility
- Digital Library Access
- Social Media Platforms like Facebook
- Applications like WhatsApp for better and fast communication with students

REQUIRED LEARNING RESOURCES

Discrete Mathematics And its Applications by Kenneth H. Rosen, 6th edition, McGraw-Hill
Text Book(s):
Publishers
Reference Book(s):
Theory and problems of Discrete structures Outline
Journals/Periodicals:
None
(Title, Publisher)
Websites:

Weekly Plane

Lecture
Weeks Title of Chapter Contents
Numbers
1 Introduction to logic
Week 1 2 Propositional calculus
3 Predicate calculus
Week 2 4 Negation
5 Disjunction Connector
6 Conjunction Connector
7 Mathematical Reasoning Implication Connector
Week 3 8 Equivalence Connector
Construction of Truth Tables for Compound/Complex
9
Expressions
10 Methods of proofs
Week 4 11 Direct proof
12 Indirect proof
13 Method of Contradiction, Pigeon Hole Principle
Week 5 14 Mathematical Induction, Examples, Odd Pie Fights
15 Definition of sets
16 Proof by Induction
Week 6 17 Set Theory Union, Intersection
18 Mathematical Functions
19 Representation of Functions by Graph
Difference concepts and Functions among Union and
Week 7 20
Intersection
21 Universal set, Compliment of set
Week 8 Mid Examination
22 Properties of relations
23 Partial ordering
Week 9
Cartesian Product, Producing Cartesian Product from Set
24 Set Theory (cont.)
Builder Notation, Ordered Pairs
25 Set Partitions, Venn Diagrams
Week 10
26 Mappings
Page 2 of 4
 27 Injection and surjection
28 Introduction to functions
Week 11 29 Composition of functions
30 Inverse function
Functions
31 Recursive function theory: Odd positive, Sum
Week 12 32 Recursive function theory: Factorial, Fibonacci Sequence
33 Tower of Hanoi
34 Introduction to Graph Theory
Week 13 35 Applications and Benefits of Graph Theory
36 Graph Theory Basic Elements of Graph Theory
37 Planar graphs, Euler Formula
Week 14 38 Graph Coloring
39 Shortest-Path Problems
40 Introduction and Importance of Trees, Application of Trees
Tree, Forest, Rooted Tree, Balanced Tree, Tree Traversal,
Week 15 41 Trees
Universal Addressing Method
42 Spanning Trees, Minimum Spanning Trees
Week 16 Final Examination

Devices/Tools/Software Required for Practical

Sr. # Tool
1. Desktop Computer/Laptop

ASSESSMENT SCHEME
Internal Assessment: 20%
Mid Semester Examination: 30%
Final Semester Examination: 50%

Schedule of Assignments and Quizzes

Assignment/Quiz Tentative Date/Week
Assignment # 1 Week 4
Assignment # 2 Week 12
Quiz # 1 Week 3
Quiz # 2 Week 7
Quiz # 3 Week 12
Quiz # 4 Week 16

GUIDELINES FOR SUBMISSION OF ASSIGNMENTS

Read the assignment requirements carefully, including any specific instructions on length, formatting, style, etc., provided
for every assignment. If no specific instructions are given, here are some general suggestions for you to follow:
-Include sufficient identification on every assignment submitted (e.g., your name; the course name, course code, and the
assignment number or title).
-For assignments with multiple questions, identify the question number and restate each assignment question before
providing your answer.
-Review your assignment before submitting it to make sure you have completed the assignment in full. Also, carefully
proofread your work for spelling and grammatical errors that could affect your grade.
-Submit assignment on LMS till due date.
-Also, unless you have registered for an extension, assignments submitted after the due date, will be returned to you
ungraded.

MARKS DISTRIBUTION AND GRADING MODEL

Page 3 of 4
Grade Grade Points Equivalent Percentage
A 4 85 – 100
A- 3.7 80 – 84
B+ 3.3 75 – 79
B 3 70 – 74
B- 2.7 65 – 69
C+ 2.3 60 – 64
C 2 58 – 59
C- 1.7 55 – 57
D 1 50 – 54
F 0 Bellow 49

ACADEMIC HONESTY
Students are expected to conduct themselves in accordance with the highest ethical standards of the Profession of
Engineering and Technology and evince academic integrity in all their pursuits and activities at the university. As such, in
accordance with the general academic regulations and requirements of the University of Faisalabad, students are reminded
that plagiarism or any other form of cheating in examinations, assignments, laboratory reports or term tests is subject to
serious academic penalty (e.g. cancellation of exam/assignment/quiz). A student found guilty of contributing to cheating in
examinations or term assignments is also subject to serious academic penalty.

Note:-The above course outline covers all contents of the subject as prescribed by HEC and respective accreditation
Council.

Name Designation Signature Date

Instructor Mubeen Alam Lecturer 11-05-2020
Head of School Dr. Usman Rauf Assist Prof 11-05-2020

Page 4 of 4