## Rose-Hulman - Department of Mathematics - Course Syllabus

MA275 - **Discrete and Combinatorial Algebra I** -
2010-11

**Parts of the web page to be completed or determined
by the instructor are in green.**

### **Catalogue Description and Prerequisites**

**MA 275 Discrete and Combinatorial Algebra I 4R-0L-4C F**

An introduction to enumeration and discrete structures. Permutations, combinations
and the pigeonhole principle. Elementary mathematical logic and proof techniques,
including mathematical induction. Properties of the integers. Set theory. Introduction
to functions.
**Prerequisite:** None, though it is normal that a student has completed
part of the calculus sequence first.

### Course Goals

- Introduce students to discrete mathematics, covering especially the topics
noted below .
- Improve mathematical modeling and analytical problem solving skills, especially with discrete mathematics topics.
- Develop ability to communicate mathematically.
- Introduce applications of discrete mathematics, especially to science and engineering.

### **Textbook and other required materials**

**Textbook: **Discrete and Combinatorial Mathematics, an Applied Introduction
5'th edition. Ralph Grimaldi, Addison-Wesley
### **Course Topics**

- Logic
- Set Theory
- Proof Techniques
- Induction
- Proof by contradiction
- Proof by contrapositive

- Counting Techniques
- Permutations
- Combinations
- Pigeonhole principle

- Properties of integers
- Functions

### **Course Requirements and Policies**

The following policies and requirements will apply to all sections and classes:

#### Final Exam Policy

The final exam will contain a large common part (approx 80%) with individual instructors adding additional questions. Students shall be restricted to the use of calculators and note cards, in the same way in all sections.

#### Individual Instructor Policies

Your instructor will determine the following for your class:
- the grading scheme, based on the various course components.
- the number and format of hour exams, quizzes, homework
assignments, in class assignments, and projects,
- the policies governing the work items above, e.g.,
whether the computer will be used, what collaboration is allowed, and the
format of assignments.
- all policies for classroom procedure, including group
work, class participation, laptop use and attendance*.

*Note that most instructors will enforce some type of grade
penalty for students with more than four unexcused absences.
###

Go to