CSC 133 Discrete Mathematical Structures Syllabus - Spring 2009

Section 001: MW 08:00 - 09:40 CI 1006
 Course Schedule and Homework:

INSTRUCTOR

Mr. Jack Tompkins
E-mail: tompkinsj@uncw.edu
Phone: (910) 962-7013
Office hours (CI 2034)
 

Introduction: Welcome to CSC 133, a course in discrete structures with an emphasis on applications to computer science. Prerequisite: MAT 111 or MAT 115 or equivalent. A basic understanding of discrete mathematical topics is fundamental for academic work in computer science. Many students of this course will find they have familiarity with some of the topics: for instance, truth tables, logical propositions, elements of set theory, as well as basic notions of functions and mathematical induction. Prior work in these areas is not assumed. In this course we will discover that logical propositions are the underlying model of discrete systems. From this modest beginning we develop algorithms and prove their efficacy. Topics include propositional and predicate logic, basic proof techniques, set algebra and Boolean algebra, recursion and induction, trees and graphs, introductory combinatorics, and matrix algebra. The knowledge gained will be particularly useful in UNCW classes that have CSC 133 as a prerequisite.

Text: Discrete Mathematics, 1st Edition, Kevin Ferland - Bloomsburg University, ISBN-10: 0618415386  ISBN-13: 9780618415380, 720 Pages, © 2009

Material to be Covered: 

Course Objectives: We will be studying a body of mathematical concepts essential for the mastery of some of the higher-level computer science courses. Our goal is to obtain a useful mastery of discrete structures and methods basic to further work in computer science. To enhance your ability to formulate and solve applied problems, to analyze and interpret algorithms and functions and to use them effectively so you may enjoy the triumph of discovery that comes from solving a problem by your own means. My goal is to help you learn how to think about discrete mathematical models so you can do well in this course and in your subsequent studies.

Policies:

1. Attendance is expected unless extreme circumstances warrant otherwise. There are no make-up tests.

   Grade Sought	Minimum Attendance
   A	90% of the lecture classes
   B	80% of the lecture classes
   C	70% of the lecture classes
   D	60% of the lecture classes

2. Calculators may not be shared during tests.
3. Academic dishonesty is not tolerated. According to the UNCW Academic Honor Code (See Section V of you Student Handbook), anyone who knows of a violation of the Code, including giving or receiving information, is expected to report the violation to the course instructor. Please note that in this course, working together on homework is not a violation of the Honor Code. You are encouraged to discuss and compare work but not to copy someone else’s work.

Graded Work: There will be two tests each counting 25%. There will be several quizzes and/or assigned homework taken up and graded. Homework/quiz grades will be averaged and count 25%. The final examination (a comprehensive exam) counts 25%. The final exam is scheduled for Friday, May 1^st, from 8:00 AM to 11:00 AM. The final may also be used to replace your lowest test grade if the final is higher than your lowest test grade.

Grading Scale:

When the distribution of course grades suggests that a borderline grade might be raised to the next higher level, we consider such factors as attendance and improvement.

Students with Disabilities: If you have a disability and need reasonable accommodation in this course, you should inform the instructor of this fact in writing within the first week of class or as soon as possible. If you have not already done so, you must register with the Office of Disability Services in Westside Hall (extension 3746) and obtain a copy of your Accommodation Letter. You should then meet with your instructor to make mutually agreeable arrangements based on the recommendations of the Accommodation Letter.

Study Strategies: We will be learning how to think about a problem and how to apply new concepts. This process takes time and works best if spaced out over short periods. To afford yourself the best opportunity for this process to be successful you have to keep up on a daily basis. Cramming does not work. We are not merely memorizing facts that can be easily applied the next morning during an exam. Each concept must be handled in your mind, manipulated, and finally placed in proper context with the many other concepts. You will discover that many of these concepts are in fact identical or nearly so. Tools we master for one application will serve us well in the next.

1. Work together, form groups. Studies have shown that group study results in a full grade higher average. The library reserves study rooms for groups. I will post your group study times and locations on the web if a group representative so requests.
2. Make class. Don't miss any assignments or quizzes so as to take full advantage of the "drop your lowest homework/quiz grade" policy. The final replaces your lowest test grade, not your homework/quiz grade.
3. Do some discrete structures work almost every day. You should plan on at least 6 hours of study time outside class per week. Read over your course notes and fill in gaps soon after class so your notes will be useful in later study.
4. Read the text with pencil and paper beside you, and use them. Just watching a lecture or skimming the book will not get you to understand discrete structures.
5. It’s not enough to just do the homework. Ask yourself whether you could do other problems. Test yourself by recalling definitions and by doing additional problems.
6. In class, if you have a question, ask. It is likely that others have the same question. As you study make notes of concepts you don’t understand so you can ask in class or see me. For short questions, e-mail is a good choice.
7. If you need help, see me. Don’t let yourself fall behind.
8. Look back: how did I solve this problem, what can be learned from the mistake, or what other strategy could also have been effective in solving this problem?