Course Description:

We will attempt to cover as many of the following topics as possible.
Logic, propositions, logical quantifiers, proofs, boolean functions;
Sets, basic definitions, ordered pairs and tuples, sequences and strings, operations on sets;
Functions and relations;
Algorithms and pseudocode;
Induction and recursion, recursive definitions, recursive algorithms, proofs by mathematical induction.
Elementary counting techniques, permutations and combinations;
Graphs, shortest paths, minimum spanning trees, maximum flows.

The students will develop mathematical maturity and analytic skills which will help them in the solution of scientific problems and the study of computer science courses.

There will be a mid-term, a final examination, and several homework assignments.  All the assignments will be discussed in class.  The final grade will be based on the two examinations and the assignments. The grading will be relative or “on the curve”, i.e., the performance of a student relative to the class will be important.  The examinations will count towards 92% the grade and the assignments 8%.

The material upto and including the topic “sets” will be covered before the mid-term.  The final examination will be based on the entire course material, however greater emphasis will be laid on the material covered after the mid-term. (The calendar of events will be included at the beginning of the relevant semester).

Text- Discrete Mathematics, an introduction to concepts, methods and applications, Jerrold W. Grossman, Macmillan Publishing Company.  Student Solutions Manual (Optional). A calculator will be helpful.

Any students with disabilities, or other special needs, who need special accommodations in this course are invited to share these concerns or requests with the instructor as soon as possible.

All work in this course must be completed in a manner consistent with NDSU University Senate Policy, Section 335: Code of Academic Responsibility and Conduct (http://www.ndsu.nodak.edu/policy/335.htm).