Description:
Counts as a Natural and Mathematical Sciences course. Induction and recursive programs, running time, asymptotic notations, combinatorics and discrete probability, trees and lists, the relational data model, graph algorithms, propositional and predicate logic. Credit given for only one of CSCIC 241 or H 241.
Prerequisite: CSCIC 211. MATHM 211 recommended.
Syllabus:
 Propositional Logic
 Truth tables
 Checking tautologies
 Logical equivalences
 Consistent sets of formulas
 Arguments and validity
 Proofs in mathematics
 CNF and DNF
 Predicate Logic
 Formulas
 Meaning
 Validity
 Translation
 Proofs in mathematics
 Sets
 Cartesian Product
 Power set
 Set operations
 Set identities
 Algorithms, and Functions
 Induction and Recursion
 Weak Induction
 Strong Induction
 Structural Induction
 Recursive Algorithms
 Counting
 Relations
 Graphs
Required Textbook:
 Discrete Mathematics and Its Applications, seventh edition, Kenneth H. Rosen,
McGraw Hill Higher Education, 2012. ISBN 9780073383095.
Recommended Textbook:
 Invitation to Discrete Mathematics, second edition , J. Matousek, and J. Nesetril, Oxford University Press, 2008.
Handouts and Homework:
All handouts and homework assignments will be posted on Oncourse.
Associate Instructors:
Roberto Hoyle, lab session on Thursday, 4:00 pm  6:00 pm, SW 103.
Office hours: Tuesday 34 pm in LH 415.
Paul Grubbs, lab sessions on Thursday, 6:15pm  8:15 pm, SW 103.
Office hours: Thursday 45 pm in LH 112.
Mark Jenne, lab sessions on Friday, 10:10 am  12:10 pm, BU 325.
Office hours: Tuesday 12 pm in LH 406.
Grading:
 Homework assignments: 20%
 There will be weekly homework.
 Each homework will consist of the following parts:
 Regular problems: A set of problems chosen from several sources including the textbooks above.
 Computations and Explorations problems: A set of problems chosen from the textbook that require
using existing software or programs of your own writing.
 Writing projects: You will have to respond to these questions by writing essays from outside textbook sources.
 Each homework will be assigned on a Thursday and will be due the Thursday after, in class.
 Solutions must be written LEGIBLY.
 It is encouraged to discuss the problem sets with
others, but everyone needs to turn in a unique personal
writeup.
 Quizzes: 20%
 During each lab except for those during exam weeks there
will be a 10minute quiz,
based on the homework assignment due that same week.
 The quizzes combined count more than a midterm.
 There will be NO make up quizzes.
However, the lowest quiz grade will be dropped.
 Each lab session will include a discussion of the homework problems due that same week.
In addition, you are welcome to discuss any other problems you need to with your AI.
 Midterm I: 15%
 Midterm I is scheduled on 02/21/2012.
 Midterm II: 15%
 Midterm II is scheduled on 04/05/2012.
 Final exam: 30%.
 Final exam is scheduled for 2:454:45 p.m., Thurs., May 3.
 We will have a closed book, closednote exam. However, you are allowed to bring your lettersize
cheat sheet to the exam.
Ground rules:
 I strongly advise you to attend all the
classes and take good notes.
 NO make up quizzes.
However, the lowest quiz grade will be dropped.
 Late homework will NOT be accepted.
However, the lowest homework
grade will be dropped.
 There will be NO make up midterm exams.
 Calculators are NOT allowed during the midterm and final exams.
However, you can bring a lettersize sheet with notes and formulas.
 The final grade will be calculated according to the evaluation scheme given above and these grades will then be curved to determine your letter grades.
However if you get less that 25/100 on the final exam or your total grade
is less than 45/100 your final grade will automatically
be an F.
 NO Incomplete grades will be given under any condition.
 NO extra work, extra credit or any thing outside the regular homeworks
and quizzes will be assigned.
Please plan your study strategy during the term accordingly.
 Grading mistakes:
If during the semester you feel there has been a mistake made in your
grading by the AIs, please contact them first. If after meeting with
the AIs you still feel there is a problem with the marking, please contact me.
 Collaborative work:
One of the best ways to learn new material is to collaborate in groups.
You may discuss the homework problems with your classmates, and in this way
make the learning process more enjoyable. However, the homework you hand in must be
your own work, in your own words and your own explanation.
 Here is the link to
The Code
of Student Conduct.
