Mohammad Ali Jinnah University

Department of Computer Science

Spring- 2021

Course Name: Discrete Structures

Course Code: CS-2620
Section AW
Pre-requisites: None
Credit Hours: 3 + 0
Class timings: Sunday 11:45AM- 02:45PM

Description: A computer science course, seasoned with a soupçon of math. It Counts towards the mathematical
and computational reasoning requirement of the Mohammad Ali Jinnah University. The objective is to develop
the necessary abstract reasoning abilities while learning to succeed in a mathematical and computer
environment.

Learning Outcomes: After taking this course, students will (Hopefully☺):

 Be able to analyse and understand common math notation
 Be able to develop solutions to mathematical problems
 Be able to use a well-defined methodology to reason about math
 Be able to develop solution to multi-step reasoning problems
 Master the basics of discrete mathematics
 Develop mathematical and computational reasoning abilities
 Become more comfortable and confident with both mathematics and computation

Course Style:
 Conversational Classroom: We will follow a modified version of the Modified Moore Method (MMM)
o Students are assigned homework on regular basis.
o Write the solutions separately AND
o Present the solutions in class ☺
o Be ready for quizzes or case problem solving at any time in the class.

Instructor Contact Details:

Name: Muhammad Atif Idrees
Email: atif.idrees@jinnah.edu

Textbooks:
Primary:
o “Discrete Mathematics and its Applications”, 7th Edition, by Kenneth Rossen.
Reference:
o “Fundamentals of Discrete Structures”, by Damian Lyons, Christina Papadakis-Kanaris, Gary Weiss,
and Arthur G. Werschulz.
Grading Scheme:
Instrument % of grade
Quizzes (4) 15%
Assignments (03) 10%
Practice Sets(05) 0%
Programming Assignment 05%
Midterm Exam (0) 20%
Final exam (1) 50%

Attendance Policy: Really just short of mandatory. We are all busy people, but I need to have you here for all
32 sessions.

Cheating Policy:
Zero tolerance towards cheating!! A 0 assigned for the 1st attempt, 5 marks (out of semester’s 100 marks)
deducted for the 2nd attempt and an F assigned for the 3rd attempt... Simply☺

Lecture Plan:
The course is tentatively scheduled as follows:

S.No Topics # of Weeks

1 Course Administrivia, Introduction 1
2 Sets/Relations/Functions 5
3 Logic 3
4 Proof Methods 4
5 Graph 3

Session wise Course breakup

S.No Duration Topics Covered Evaluation

Instruments
used

1. 1:20 min Introduction to Discrete Structure

1:20 min Set Theory: Basics, specify a set by enumerating all Homework#01
elements, Notations, Cardinality, Relations on sets: subset,
2. Practice Set#01
proper subset, set builder notation, Power set, Set
operations, Empty set, disjoint set, Cartesian product

1:20 min
3. Set Operations, Venn Diagram

4. 1:20 min Set Theory: Venn Diagram Quiz#01

5. 1:20 min Application of Venn Diagram

1:20 min Practice Set#02

6. Set identities, Exercises
Programming
Assignment #01
1:20 min Relations on Sets: ordered pair, cartesian product of two
7. sets, cartesian product of more than two sets, binary
relation, domain of a relation

1:20 min Range of a relation, arrow diagram of a relation, directed Quiz#02

8.
graph of a relation, matrix representation of a relation

1:20 min Types of relations: reflexive relation, irreflexive, matrix

9.
representation of a reflexive relation & irreflexive

1:20 min Types of relations: symmetric, antisymmetric, a symmetric

10. relation, directed graph matrix representation of a
symmetric, antisymmetric, a symmetric relation

11. 1:20 min TYPES OF RELATIONS: Transitive Relation Homework#03,

Practice Set#03
12. 1:20 min Combining relation, Composition relation

13. 1:20 min Closures of Relations

1:20 min Quiz#03

14. Equivalence classes, Partial Orderings
Programming
Assignment #02
1:20 min Practice Set#04
15. Sequence and summations

1:30 Min MID TERM

16. 1:20 min The Foundations: Logic, Propositional Logic

17. 1:20 min Applications of propositional logic Practice Set#05

18. 1:20 min Propositional equivalences

19. 1:20 min Predicates and Quantifiers Practice Set#06

20. 1:20 min Predicates and Quantifiers exercise Quiz#04

1:20 min Rules of Inferences: Rules of Inference for Propositional

21.
Logic

22. 1:20 min Using rules of inference to build arguments Quiz#05,

23. 1:20 min Using rules of inference to build arguments

24. 1:20 min Introduction to proof Practice Set#07

 25. 1:20 min Methods of proving Quiz#06

26. 1:20 min Proof Methods

27. 1:20 min Proof Methods practice Practice Set#08

28. 1:20 min Review all topics

3 hours FINAL EXAMS

Counseling Hours(Teacher’s Availability in Office):

Timing Monday Tuesday Wednesday Thursday Friday Saturday Sunday

From 10:00AM 10:00AM/01:2 10:00AM/01:2 03:00PM

10:00AM/01:20PM OFF OFF
/01:20PM 0PM 0PM

To 11:20AM 11:20AM/02:2 11:20AM/02:2 05:00PM

11:20AM/02:20PM OFF OFF
/02:20PM 0PM 0PM

Class schedule Spring 2021

02:30 PM
Muhammad A. I
08:30 AM 10:00 AM 11:30 AM 01:00 PM 03:50 PM
09:50 AM 11:20 AM 12:50 AM 02:20 PM
Days/Time
Probability ad
Probability ad
Counseling Hours Counseling Hours Statistics (AM)
Monday Statistics (DM)
(BS- CS) MT-
(BS- BS) MT-2300
2300
Probability ad
Differential
Counseling Hours Counseling Hours Statistics (BM)
Tuesday Equations (BM)
(BS- CS) MT-2200 (BS- CS) MT-
2300
Probability ad
Probability ad
Counseling Hours Counseling Hours Statistics (AM)
Wednesday Statistics (DM)
(BS- CS) MT-
(BS- BS) MT-2300
2300
Probability ad
Differential
Counseling Hours Statistics (BM)
Thursday Counseling Hours Equations (BM)
(BS- CS) MT-2200 (BS- CS) MT-
2300

Friday/Saturday OFF

11:45 AM - 01:00 PM 03:30 PM – 05:00

01:30 PM - 02:45 PM PM
Discrete Structures
Counseling Hours Discrete Structures Counseling
Sunday (AW)
(AW) Hours
(BS-CS) -2620
(BS-CS) -2620
Course web link:

https://classroom.google.com/c/Mjg3ODY2NDQ0MDgy

Class code: Given in class

Course Instructor: Muhammad Atif Idrees

Email: atif.idrees@jinnah.edu