Course Outline

Discrete Mathematics
PROGRAM: BSCS, Credits Hrs: 3

Schedule Tuesday and Thursday Website http://www.usa.edu.pk

11:20 am 12:50 pm
Instructor Syed Ali Nauman Gilani Contact ali.nauman@usa.edu.pk

Office CS Faculty room Office

Hours
Teaching ------ Contact ------
Assistant
Course It is aimed at general introduction to the subject of discrete mathematics and its relevance to
Description computer science. We start with elements of logic with emphasis on propositional logic and
predicate calculus. Next we discuss sets and functions and develop the concepts of floor and
ceiling functions and their use in computer science. The important topic of growth of
functions and the methods of estimating the order of growth with the big-O, big-Omega, and
big-Theta are discussed. After introducing algorithms, we pass on to principle of
mathematical induction which is an important tool for proving general results. Counting
techniques, relations, graphs and trees are also discussed at some length.
Expected Participants have begun to appreciate the role of reasoning in mathematics and computer
Outcomes programming.
They have become familiar with the tools used in counting.
They have started understanding the difference between a general proof and verification in
particular cases.
Textbook Discrete Mathematics and Its Applications, By Kenneth H. Rosen, 7th edition, McGraw-
Hill.

Midterm 1 midterm exams , Final exam Will cover the whole course and will
exam 1.5 our duration after 15th lecture be of 2 hour duration

Attendance Students missing more than 20% of the lectures will receive an F grade in the course.
Policy
Evaluation Attendance and Viva 10 %
criterion Tests : 10%
Midterm: 30%
Final: 50%
 Tentative Schedule
Lectures, Reading Assignments, Homework Assignments

Reading
Material/HW Assignment And
Wk 1st Lecture 2nd Lecture 3rd Lecture
Quiz
Reading Exercises
conjunction, Examples and
Introduction,
disjunction, negation, exercises on Section Section
1 Propositions, logical
conditional statement, propositional 1.1 1.1 Home Assignment # 1
connectives
truth tables calculus

logical equivalence, Predicate calculus,

Tautologies and Propositional Examples and Section Sections
2 Home Assignment # 2
contradictions functions. exercises on 1.2, 1.3 1.2, 1.3
predicate calculus

Sets, set operations, Set identities. Section Section

Venn diagrams. Home Assignment # 3
3 Quantification Review & 1.4, 1.6, 1.4, 1.6,
Quiz # 1
Quiz # 1 1.7 1.7

Functions, Ceiling and floor Examples and

Section Section
4 surjective and functions, graphs of exercises on Home Assignment # 4
1.8 1.8
bijective functions functions functions

Examples and
Summations exercises on Section Section
5 Sequences Home Assignment # 5
sequences and 3.2 3.2
summations
Algorithms , pseudo- Linear and
Algorithms , Section Section
6 codes sequential search Home Assignment # 6
pseudo-codes 2.1 2.1
algorithms
growth of functions, Section Section
7 Sorting algorithm Greedy algorithms Big O, big Omega 2.1, 2.2 2.1, 2.2 Mid-Term

Mathematical Mathematical
Reasoning, methods induction Section Section Home Assignment # 7
8 Big Theta estimates
of proof. Review & 2.2, 3.3 2.2, 3.3 Quiz # 2
Quiz # 2

Further discussion Examples and Section

Recursive Section
9 on mathematical exercises on 3.3, Home Assignment # 8
definitions 3.3, 3.4
Induction mathematical 3.4
induction
The pigeonhole Section Section
Recursive
10 Sum and product principle and its 3.5, 4.1, 3.5, 4.1, Home Assignment # 9
algorithms
rules of counting applications 4.2 4.2
Exercises on
Permutations and Section Section
11 pigeonhole principle Permutations and Home Assignment # 10
combinations 4.2, 4.3 4.2, 4.3
combinations
Review &
Relations and their Section Section7.1 Home Assignment # 11
12 Representing Quiz # 3
properties 7.1, 7.3 , 7.3 Quiz # 3
relations
 Trees, Equivalence Section Section
13 relations, partial Introduction to graphs Terminology 7.5, 8.1, 7.5, 8.1, Home Assignment # 12
ordering 8.2 8.2
Section Section
Euler and
14 Isomorphism Connectivity 8.3, 8.4, 8.3, 8.4, Home Assignment # 13
Hamiltonian paths
8.5 8.5
Shortest Path Section Section
15 Planer graphs Review Home Assignment # 14
problem 8.6, 8.7 8.6, 8.7