Texas College

Division of Natural & Computational Sciences

Area of Mathematics

 

Discrete & Combinatorial Mathematics

 

Course Number

MATH 23750

Course Description

Bit strings, basic concepts of set theory, algebraic structures, Cartesian products, relations, mappings, Boolean algebra, Boolean functions, applications to circuits, lattices, combinatorial principles, groups, generating functions, and recursion.

Textbook

Epp, Susanna S., Discrete Mathematics with Applications (3/E), Thomson*Brooks/Cole, 2007. {0-534-35945-0}

Semester

Fall

Semester Hours

3

Prerequisite

None

Attendance

 

The full attendance policy, stated in the Texas College Catalog, applies to this course. Specifically, more than three unexcused absences may result in a grade penalty.

Instructor

Dr. William Stenger

Office Hours

9–10:Monday,Wednesday, and Friday

8:30–9:30: Tuesday and Thursday

11–noon: Monday and Friday

3–4: Monday, Tuesday, and Wednesday

Other times by appointment

Office

113 MSBC

Phone

(903) 593-8311, ext.2283

 

 

Prepared by:

William Stenger

 

Instructor

Date

Approved by:

M.S.T. Namboodiri

 

Division Chair

Date

 

 

 

 

Course Goals

1. To establish a foundation for further study in mathematics and computer science.

2. To provide a (possibly) first encounter with abstract mathematics.

Just what do we mean¾ Discrete Mathematics?

Discrete mathematics deals with structures that consist of distinct or unconnected elements. One applies discrete mathematics to count objects, to study relationships between finite sets, and to analyze processes involving a finite number of steps.

Why Study Discrete Mathematics?

1. You can develop your mathematical maturity, your ability to understand and create mathematical arguments, and your capacity to think clearly.

2. Discrete mathematics provides a gateway to more advanced courses in all parts of the mathematical sciences.

3. Discrete mathematics establishes the mathematical foundations for many computer science courses including data structures, algorithms, data base theory, automata theory, formal languages, compiler theory, and operating systems.

Methods of Instruction

Learning higher mathematics requires effort by the learner working on practice problems and homework problems. The faculty member will support this effort with motivation, examples and discussion.

Methods of Evaluation

We will use practice problems in class, homework assignments, quizzes, tests, and a final examination to evaluate student performance.

Attendance Policy

The full attendance policy, stated in the Texas College Catalog, applies to this course. Specifically, more than three unexcused absences may result in a grade penalty.

Practice Problems

Students should come to class prepared to work practice problems. Students do not have to turn in practice problems done in class.

Notes

Since taking extensive notes provides dubious benefit, we do not encourage this practice. Instead we recommend that students concentrate on understanding the explanations given, doing the practice problems and homework problems, and asking lots of questions.

Homework Problems

At the end of each lesson students should do the assigned exercises. Write your name at the upper right corner of each page and write the chapter number and lesson number at the upper left corner of each page. For instance, you would write 1.2 to identify Chapter 1, Lesson 2. Turn in homework two class periods after the completion of a lesson. After you complete a set of exercises check your work against the answers in the back of the book.

Quizzes

A pop quiz will suddenly appear from time to time without warning. An absent student may not make up a quiz later. Depending on the nature of the absence, the faculty member may allow an alternative assignment. Otherwise, the student will receive a grade of zero. The total combined quiz grade will count as one test.

Tentative Test Plan

Chapter 1: Test
Chapter 2: Test
Chapters 3,4§: Test
Chapters 6,7§: Test

§ Selected lessons from the chapters listed.

Learning Outcomes

Sets

  • To understand set notation
  • To recognize finite and infinite sets
  • To apply set-builder notation
  • To manipulate relations between sets, applying such terms as:
  • subsets

    proper subsets

    supersets

    equality

    universe and empty set

    intersection (finite and countable collections)

    union (finite and countable collections)

    difference

    symmetric difference

    complement

    Venn diagrams

  • To employ:
  • commutative laws

    associative laws

    distributive laws

    DeMorgan's laws

    Cartesian products of sets

    power sets

    The Number System

  • To define
  • positive integers

    natural numbers

    integers

    rational numbers

    irrational numbers

    real numbers

     

  • To apply the division algorithm and divisibility
  • To find greatest common divisors and least common multiples
  • To find the prime factorization of a number
  • To write integers in base 10, in base 2, octal, and hexadecimal forms
  • The Nature of Proof

  • To identify the hypothesis and the conclusion in sentences of various English constructions
  • To find the converse, inverse, and contrapositive
  • To recognize the use and the misuse of examples
  • To recognize the use of counterexamples
  • To perfom direct proofs, including proof by cases
  • To perform indirect proofs
  • Formal Logic

  • To write English sentences for logical expressions and vice versa
  • To complete the truth tables for the standard logical connectives
  • To give the truth values of simple propositions given in plain English
  • To state the definitions of tautology and contradiction
  • To prove and apply the standard logical equivalences, including
  • commutative, associative, distributive, and idempotent properties; double negation; DeMorgan laws

     

  • To apply rules of inference, including modus ponens, modus tolens, modus tolendo polens, simplification, addition, and reductio ad absurdum
  • To negate logical statements
  • To identify the basic quantifiers, free and bound variables, negations and the generalized DeMorgan laws for quantified statements
  • Final Examination

    The comprehensive final examination will count as two regular examinations.

    Grade Determination

    Let X represent the sum of the three test scores plus quiz scores. Let Y represent twice the score on the final. Then the semester grade G = (X + Y)/6. A grade G ³ 90 will yield an A, G ³ 80, will yield at least a B, G ³ 70, at least a C, and G ³ 60, at least a D. Homework and practice problems will serve as "tie-breakers" for borderline grades and for purposes of mercy.

    Important Dates

    Mid-term examination: Thursday, October11.
    Last day to drop with a W: Tuesday, November 20.

    Bibliography

    Johnsonbaugh, Richard, Discrete Mathematics, Prentice Hall, 1997.

    Polimeni, A.D., & Straight, H.J.,

    Foundations of Discrete Mathematics, Brooks/Cole Publishing, 1990.

    Rosen, Kenneth H., Discrete Mathematics and Its Applications, Random House, 1988.

    Texas College
    Online Databases
    http://drglass.texascollege.edu/opac/index.htm

    http://www.jstor.org/search

    http://www.libraryoftexas.org

    http://www.texshare.edu/drglasslibrary/index.php3
     

    Web Resources

    http://www.ams.org/

    http://www.goshen.edu/compsci/cs205/resources.htm

    http://www.maa.org/

    http://www.nasa.gov/

    http://www.nctm.org/

    http://www.schoolnet.ca/vp-pv/ECOS/

    http://www.siam.org/

     

    Teacher Certification Websites http://www.tea.state.tx.us/

    http://www.sbec.state.tx.us/SBECOnline/default.asp

     

     

    Texas Essential Knowledge and Skills

    Discrete & Combinatorial Mathematics

    Not applicable.