ROWAN UNIVERSITY
Department of Mathematics

SYLLABUS

Math 03.550 Topics in Discrete Mathematics

Catalog Description:

Math 03.550 Topics in Discrete Mathematics                                                                       3 s.h.

This course studies concepts and techniques that are fundamental to mathematics and computer science. Selected topics are explored in depth from areas of set theory, logic, Boolean algebra, number systems, combinatorics, graph theory, complexity of algorithms, and data structire and representation. The course may not be offered annually.

Objective:
This course is intended to provide useful mathematical ideas, concepts and techniques that sharpen one's problem solving skills, and at the same time enable one to acquire a deeper understanding and appreciation of mathematics as a whole.

Content:

• Sets Theory

·  Sets and Operations on Sets
·  Relations
·  Functions

• Logic
• Propositional Calculus
• Logic Gates
• Quantifiers
• Methods of Proof (including Mathematical Induction)

• Combinatorics
• Basic counting techniques
• Permutations and Combinations
• Binomial Theorem
• Distributions and Arrangements
• Recurrence Relations and Generating Functions
• Inclusion and Exclusion Principle

• Graph Theory
• Basic Concepts and Terminology
• Trees
• Applications to Computer Science

• Analysis of Algorithms
• Algorithms
• Complexity and Order

6.       Number Systems and Computer Codes

• Binary, Octal and Hexadecimal arithmetic.

TEXTS:

• Roman, Steven, AN INTRODUCTION TO DISCRETE MATHEMATICS, Saunders HBJ, NY
• Ross, Kenneth, DISCRETE MATHEMATICS, Prentice Hall, NJ
• Anderson, James, DISCRETE MATHEMATICS, WITH COMBINATORICS, Prentice Hall, NJ
• Johnsonbaugh, Richard, DISCRETE MATHEMATICS (5th edition), Prentice Hall, NJ
• Goodaire, Edgar and Parmenter, Michael, DISCRETE MATHEMATICS WITH GRAPH THEORY, Prentice Hall, NJ

Rev: 2-01/GI/EW
Grd.revise.syl./topdismath.grd.