CS501A/MA304E (Fundamentals of Computation) Syllabus - Rivier College Page 1
General Information
INSTRUCTOR Donald Braffitt DATE 14-Sep-1982
---------- (603) 888-1311 Rivier X60 (Box 895) ----
(603) 883-7192 Home (Nights)
(603) 884-6163 Office (Days)
3 semester credits; Fall 1982 - Tuesday evenings - 5:30 to 7:30 PM; Room LP04
Class starts: 14-Sep-1982; Midterm Exam: 02-Nov-1982; Final Exam: 21-Dec-1982
COURSE Liu, C. L. Elements of Discrete Mathematics.
TEXTBOOK New York: McGraw-Hill Book Company, 1977.
--------
OBJECTIVES
----------
This course will introduce some of the mathematical theory and techniques
underlying computer science. Topics include set theory, graph theory,
algebra, and combinatorics.
TEACHING STRATEGIES
-------------------
Class time will usually include reviewing the solutions to the assignments
turned in at the beginning of class. New material will usually be introduced
that corresponds to the problems due the following week.
COURSE REQUIREMENTS
-------------------
The required work for the course consists of a set of problems, programminng
assignments, and take-home quizzes as well as in-class written Midterm and
Final exams. There will be 12 problem sets (assigned 1 week before due), 2
programming assignments (assigned 2 weeks before due), and 4 take-home
chapter quizzes (assigned 1 week before due). Problem sets and programming
assignments will be graded primarily on effort. Quizzes and exams will be
graded on effort and correctness.
You are responsible for all material presented in class as well as the
appropriate textbook material and any material assigned for outside class
reading. Attendance will be taken each class period. Regular attendance is
expected. The work you turn in on quizzes and exams must be entirely your
own (all in-class exams will be closed book - 1 page of notes will be
allowed). However, you are allowed to discuss the problem sets and
programming assignments with any other member of the class. The final
product on each problem set and programming assignment must be substantially
your own work. Assignments must be handed in at or prior to the beginning of
class on the date due. The work you do outside of class for this course
(reviewing class notes, reading, homework assignments, and reviewing for
exams) should average 6 to 10 hours per week. Please keep all graded
assignments and exams until the course is over. The homework assignments and
exams should generally be handed back graded the following week.
HOMEWORK AND EXAMINATIONS GRADING WEIGHTS
------------------------- ---------------
Problem Sets 12 @ 3% each 36%
Programming assignments 2 @ 3% each 6%
Take-home chapter quizzes 4 @ 4% each 16%
Midterm exam (Chapters 1-4) 02-Nov (1st hour) 14%
Final exam (Chapters 1-9) 21-Dec (both hours) 28%
CS501A/MA304E (Fundamentals of Computation) Syllabus - Rivier College Page 2
Course Outline / Bibliography
COURSE OUTLINE
--------------
For a given week, the assignments are due at the beginning of class, and the
indicated material will be introduced in class that day.
Week Class Text Topics Assignments Due
---- ----- ---- ------ ---------------
1 14-Sep Chap 1 Sets and Propositions
2 21-Sep Chap 1 probs
3 28-Sep Chap 2 Permutations and Combin. Chap 1 probs
4 05-Oct Chap 3 Relations and Functions Chap 2 probs Chap 1 quiz
5 12-Oct Chap 4 Graphs and Planar Graphs Chap 3 probs
6 19-Oct Chap 4 probs Chap 2-3 quiz
7 26-Oct Chap 5 Trees and Cut-Sets Chap 4 probs Prog 1
8 02-Nov Midterm exam (1st hour)
9 09-Nov Chap 6 Numeric Functions Chap 5 probs
10 16-Nov Chap 7 Recurrence Relations Chap 6 probs
11 23-Nov Chap 8 Groups and Rings Chap 7 probs Chap 5-6 quiz
12 30-Nov Chap 8 probs
13 07-Dec Chap 9 Boolean Algebras Chap 8 probs Prog 2
14 14-Dec Chap 9 probs Chap 7-8 quiz
15 21-Dec Final exam (both hours)
BIBLIOGRAPHY
------------
Bavel, Zamir. Math Companion for Computer Science. Reston, Virginia:
Reston Publishing Company, Inc., 1982. [sets, logic, relations, functions,
graphs, algebras, proof techniques; very complete treatment, handbook-like,
no examples]
Beckman, Frank S. Mathematical Foundations of Programming. Reading
Massachusetts: Addison-Wesley Publishing Company, 1980. [set theory, graph
theory, algebra]
Berztiss, A. T. Data Structures Theory and Practice. Second Edition. New
York: Academic Press, 1975. [set theory, graph theory, algebra,
introduction to languages and automata; MA304/CS501 text - fall 1981]
Bobrow, Leonard S. and Michael A. Arbib. Discrete Mathematics: Applied
Algebra for Computer and Information Science. Philadelphia: W. B.
Saunders Company, 1974. [set theory, graph theory, algebra; CS601 text -
spring 1982]
Gilligan, Lawrence G. and Robert B. Nenno. Finite Mathematics with
Applications to Life. Second Edition. Santa Monica, California: Goodyear
Publishing Company, Inc., 1979. [sets, functions, combinatorics; MA201/CS201
text - 1981, 1982]
Prather, Ronald E. Discrete Mathematical Structures for Computer Science.
Boston: Houghton Mifflin Company, 1976. [sets, relations, functions,
algebras, graphs, monoids, machines, lattices, groups, combinatorics, logic,
languages; in depth treatment of subjects]
Tremblay, Jean-Paul and Ram P. Manohar. Discrete Mathematical Structures
with Applications to Computer Science. New York: McGraw-Hill, 1975.
[mathematical logic, set theory, algebraic structures, lattices and Boolean
algebra, graph theory, introduction to computability theory]