MATH2433 : Discrete Mathematics (MATH4)  Instructor: PROF. M TAHIR HUSSAIN

      N/A

Discrete Mathematics is study of distinct, unrelated topics of mathematics. It embraces topics from early stages of
     
mathematical development and recent additions to the discipline as well.

After studying this course the students should be able to:

After studying this course, the students should be able to:

Use mathematically correct terminology and notation.
     
Construct correct direct and indirect proofs.
Use division into cases in a proof.
Use counterexamples.
Apply logical reasoning to solve a variety of problems

After studying this course, the student should be able to:

Appreciate the basic principles of Boolean algebra, Logic, Set theory,
Understand Permutations, combinations and Graph Theory.
      construct simple mathematical proofs
Understand logical arguments and logical constructs. Have a better understanding of sets, functions, and
relations.
Acquire the ability to describe computer programs in a formal mathematical manner

Lectures
Reading Material
Term Paper
     
Handouts
Assignment
Any other Teaching-Learning Tool

     
Discrete Mathematics, by K.A. Ross, C.R.B. Wright, Published by Prentice Hall, New Jersey (Year: 2003)

     
Graph Theory by B. Bollobas Published by Springer Verlag, New York (Year: 1979.)

     
Discrete Mathematics and its Application, by K.H. Rosen , 6th Edition, Published by McGraw-Hill, (Year: 2007)
     
 Discrete Mathematics by N.L. Brigs Published by Oxford University Press (Year: 2003.)

 Exam Type Percentage(%) Consideration

Quiz 25 Take Average of All

Assignments 25 Take Average of All
Final Term 40 Take Average of All
Class Participation 10 Take Average of All

Week   Contents  Tasks/Activities

Counting methods:
1
Basic methods: product, inclusion-exclusion formulae.
2 Permutations and combinations.
3 Recurrence relations and their solutions. Assignment 1
Generating functions.
4 Quiz 1
Applications.
Double counting.
5
Applications.
Pigeonhole principle
6 Assignment 2
Applications.
Relations:
Binary relations
7 Quiz 2
N-ary Relations.
Closures of relations.
Composition of relations
8
Inverse relation.
9 Mid-Term Mid term
Graphs:
10 Graph terminology.
Representation of graphs.
11 Graphs isomorphism. Assignment 3
Algebraic methods:
12 The incidence matrix. Quiz 3
Connectivity
Eulerian
13
Hamiltonian paths.
14 Shortest path problem. Assignment 4
Trees
15 Quiz 4
Spanning trees.
Complete graphs
16
Bivalent graphs.
17 Final term Final term

Plagiarism and Intellectual Property Policy:

Reproduction of the writing or literary work or concepts or inventions of another person as one's own product without writing proper
acknowledgment to the actual author, willfully or unintentionally, is termed as plagiarism. The actual author has a right to bring a lawsuit for
unauthorized use of his/her work against the plagiarist. University of Central Punjab discourages plagiarism and warns students to be careful
while using someone else's work in their written work to meet requirements of a course or a degree. It may be clarified that quotes which are brief
or are acknowledged as quotes do not constitute plagiarism.

Be watchful - Every written material/assignment shall come under the careful scrutiny of others. Do ensure that published work of others is
properly cited; source of unpublished material obtained from lectures, oral communication or interviews are duly acknowledged. UCP's statutes
2004 - Clause 22 at Chapter 15 and UCP regulations 2005 - Clause 8.18 and Clause 13 at Chapter 13 deal with plagiarism and intellectual property
rights, which may be consulted by the UCP students and employees.

A fellow student, a Faculty member or a member of the UCP Administration can report any instance of plagiarism to the Dean of the Faculty, who
after ascertaining extent of Plagiarized material will determine penalty against the student according to UCP Regulations, 2005.