UNIVERSITY OF GUJRAT

A WORLD CLASS UNIVERSITY

Teacher Description
Course Dr. Muhammad Haleem Khan
Coordinator
Teacher name Rabia Ashraf
E-mail addres [email protected]
Phone number 03063168080
Course Description
Course Code GESE-204
Course Title Discrete Structures
Credit Hours 03
Category Computing Core Course
Prerequisite None
Amis and Introduces the foundations of discrete mathematics as they apply to Computer Science, focusing on providing a solid
Objectives theoretical foundation for further work. Further, this course aims to develop understanding and appreciation of the finite
nature inherent in most Computer Science problems and structures through study of combinatorial reasoning, abstract
algebra, iterative procedures, predicate calculus, tree and graph structures. In this course more emphasis shall be given to
statistical and probabilistic formulation with respect to computing aspects.
Learning One can apply the rules of Discrete Mathematics to Computer Science.
Outcomes
Course Outline Mathematical reasoning, propositional and predicate logic, rules of inference, proof by induction; proof by contraposition
/ Syllabus proof by contradiction, proof by implication, Set theory, Relations, equivalence relations and partitions, partial orderings,
recurrence relations, functions, mappings, function composition, inverse functions, recursive functions, Number theory,
Sequences, series, counting, inclusion and exclusion principle, Pigeonhole principle, Permutations and combinations.
Algorithms, Searching and sorting Algorithms, Elements of graph theory, planar graphs, graph coloring, graph algorithms,
Euler graph, Hamiltonian path. Rooted trees. Traversals.

1
Text Book Kenneth H, Discrete Mathematics and Its Applications, 7TH edition.
Reference 1. Richard Johnson Baugh, Discrete Mathematics, 7TH edition, 2008, Prentice Hall Publishers.
Material 2. Kolman, Busby & Ross, Discrete Mathematical Structures, 4th edition, 2000, Prentice-Hall Publishers.
3. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, Addison-Wesley Pub. Co.,
1985.
Assessment 10% weightage of Quiz, 5% weightage of Assignments and 10% weightage of Presentation.
Criteria 25 % weightage of Mid Term Exam and 50 % weightage of Final Exam.

2
Grading System

Numeric value of
Marks in Percentage Letter Grade Description
Grade

85+ A+ 4.00 Exceptional

80-84 A 3.70 Outstanding

75-79 B+ 3.40 Excellent

70-74 B 3.00 Very Good

65-69 B- 2.50 Good

60-64 C+ 2.00 Average

55-59 C 1.50 Satisfactory

50-54 D 1.00 Pass

49 and below F 0.0 Fail

W Withdrawal

I Incomplete

3
 Recommendations for
Learning Activities
(Mention Assignments,
Source
Test, Quizzes,
Week Lecture Topic (Book-Chapter
Practical, Case Study,
No. Section No.)
Projects, Lab Work
or Reading
Assignments)
1 1 • Propositional and predicate logic, Contraposition, Contradiction, Kenneth H,
implication, Discrete
Mathematics and
Its Applications,
7TH edition,
Chapter # 01, Sec
1.1, Exercise 1.1
2 • Propositional equivalence. Chapter # 01, Sec Assignment will be given
1.3, Exercise 1.3. to students
2 3 • Rules of inference Chapter # 01, Sec
1.6, Exercise 1.6
4 • Proof by induction, proof by Contraposition, proof by Contradiction Chapter # 01, Sec
1.7, Exercise 1.7
3 5 • Sets Chapter # 02, Sec
2.1, Exercise 2.1
6 • Operations on sets Chapter # 02, Sec Assignment will be given
2.2, Exercise 2.2 to students
4 7 • Functions and types of functions Chapter # 02, Sec
2.3, Exercise 2.3
8 • Quiz Quiz
5 9 • Sequences and series, recurrence relations Chapter # 02, Sec
2.4, Exercise 2.4
10 • Number theory: Divisibility, Modular Arithmetic Chapter # 04, Sec
4.1, Exercise 4.1
6 11 • Number theory: Least common divisors, Greatest common divisors Chapter # 04, Sec
and Primes. 4.3, Exercise 4.3

4
 12 • Basics of counting Chapter # 06, Sec
6.1, Exercise 6.1
7 13 • Quiz Quiz
14 • Pigeonhole Principle Chapter # 06, Sec
6.2, Exercise 6.2
8 15 • Permutations and Combinations Chapter # 06, Sec
6.3, Exercise 6.3
16 • Mid Term exam Objective or Subjective
9 17 • Relations Chapter # 09, Sec
9.1, Exercise 9.1
18 • Equivalence relations, equivalence classes and partition. Chapter # 09, Sec
9.5, Exercise 9.5
10 19 • Partial ordering Chapter # 09, Sec
9.6, Exercise 9.6
20 Inclusion and exclusion principle. Chapter # 08, Sec
8.5, Exercise 8.5
11 21 • Quiz Quiz
22 • Graphs and graph models Chapter # 10, Sec
10.1, Exercise 10.1
12 23 • Euler and Hamilton Paths Chapter # 10, Sec Assignment will be given
10.5, Exercise 10.5 to students
24 • Planner graphs Chapter # 10, Sec Quiz
10.7, Exercise 10.7
13 25 • Graph coloring Chapter # 10, Sec
10.8
26 • Introduction to trees Chapter # 11, Sec
11.1 Exercise 11.1
14 27 • Quiz Quiz
28 • Tree traversal Chapter#11, Sec
11.3, Exercise 11.3
15 29 • Algorithms Chapter # 03, Sec
3.1.
30 • Searching and sorting Algorithms Assignment will Assignment will be given
be given to students

5
16 31 • Problems Solving
32 • Revision of Course before Final term exam