TEXAS A&M UNIVERSITY-Corpus Christi

Division of Computing and Mathematical Sciences

MATH 2305.001

Discrete Mathematics

Fall 2005

I. COURSE INFORMATION

Instructor: Dr. Alex Sadovski, Professor of Mathematics, CI #338

Phone: 825-2477 (office)

E-mail: sadovski@tamucc.edu

Classes meet

MATH 2305.001 T TH 11:00-12:15 p.m. CS-112

Office hours: T TH.12:30 – 2:00 p.m.

Also by request at any other time suitable for all parties involved.

Students are strongly encouraged to see professor, if there are any questions and/or confusion. If you think to drop this course, please, have a talk with me before taking any actions.

II. COURSE DESCRIPTION

An introductory course covering sets, relations, functions (including Big-O), Boolean algebra, counting techniques, elementary graph theory, induction, recursive relations and elementary propositional and predicate logic. There will be an emphasis on mathematical and computer science applications for these concepts.

III.PREREQUISITES

MATH 1314 (College Algebra) and MATH 1316 (Trigonometry), or MATH 2312, or placement beyond MATH 2312.

IV.TEXT AND OTHER SUPPLIES REQUIRED

Mathematical Structures for Computer Science by Gersting, 5th edition, Computer Science Press.

V.COURSE OBJECTIVES

There are general and content objectives.

GENERAL OBJECTIVES

By the end of the course

· The student will link mathematical concepts to real world situations.

· The student will strengthen his general academic skills in critical thinking and writing.

· The student will improve his ability to translate a word problem into a math statement, and back again to words.

· The student will improve the ability to form reasonable descriptions and judgments based on quantitative information

· The student will develop a broad-base of discrete mathematics concepts knowledge including concepts, basic skills, mathematical senses (quantitative, symbolic), and thinking process (problem-solving, predicting, generalizing)

CONTENT GOALS

At the end of the course the student should be able to:

· Use the basic rules of logic to justify arguments. These include arguments by negation, contrapositive, direct, contradiction, and counter examples.

· Use graph theoretical arguments in the solutions of problems.

· Distinguish and use properly the different counting techniques learned in class.

· Define sequences recursively and determine their closed form.

· Solve problems using the concept of relations and functions combined with counting techniques.

· Interpret situations using strings together with the counting techniques.

VI. INSTRUCTIONAL METHODS AND ACTIVITIES
The class uses lecture format encouraging class discussion. Students are expected to read the text before class as directed and be prepared to participate in the class. Tests, quizzes, and paper are part of student activities. Other work includes completing homework and general study of the material.

VII. EVALUATION AND GRADE ASSIGNMENT

Grade policy (see also II.3.):

Mid-termTest 30%

Final test (comprehensive) 30%

Quizzes (5-6 per semester) 35%

Course paper (project) 15%

Grade scale: A: 90-100, B: 80-89, C: 70-79, D: 60-69, F less than 60.

To prepare for class, students must read the section ahead of time. Study questions are available for each section or portion of a section to be covered. They are due at the start of class on the day they are to be covered. We may experiment with an online version of study questions as the semester progresses.

Project: The project will require you to apply the techniques you have learned in class to problems from the book not covered in class. A detailed description with grading criteria will be available later in the semester.

Final Exam: The final exam will be comprehensive

Tests: There will be 3 tests over the course of the semester. Questions in the tests will be similar to those in the homework. You will be allowed to use a single sheet of handwritten notes for a portion of each test.

VIII. TENTATIVE COURSE SCHEDULE

The sequence of the course is the following: Introduction to Logic® Chapter3 ® Chapter4 ® Chapter5 ® Chapter1 ® Chapter2

IX. CLASS POLICIES

I. Official Part

1 Attendance required, exceptions are sickness, job and family emergencies, but I will not use class roll at any time, because it is your responsibility to be in class and attend to the process of learning (see also II.2.).

2 Please, print your name on all assignments and tests: your professor is not a decoding device.

3 If you have questions you MUST ask, you have the right to interrupt lecture or discussion at any time (see also II.1).

4 No checking regular homework. Each class we begin with a discussion of home problems and home reading.

5 I am always open for all questions and discussions during the class and office hours. You can always arrange meeting with me at any other time suitable for both sides.

6 No multi choice tests, all tests will consist of problems you have to solve from the

beginning to the end. Partial credit will be given for any parts of problems solved. The policy is open books and notes, no talking, no cheating for tests. Close books and notes for quizzes.

7 There is no social promotion in my classes. Grades are given only for knowledge acquired (see also II.9.).

II. Unofficial part.

II.1. There are no "stupid" questions, there are only bad teachers.

II.2. All you do, you do it for yourself, not for the professor.

II.3. Do not be concern about grades, be concern of knowledge, because grades are the steepest increasing function of knowledge (here is an example of math language).

II.4. Do not be afraid of problems, let them be afraid of you.

II.5. Only doing nothing may be without mistakes. If you don’t make errors, you don’t learn anything.

II.6. Do not be nervous - it may be only worse.

II.7. Common sense is the base of all decisions, together with knowledge they can do almost everything (even pass this course!).

II.8. Keep your particles together.

II.9. The only valid excuse for not knowing the subject is a sudden death.