UNIVERSITY OF MARY HARDIN-BAYLOR
COMPUTER SCIENCE CLASS SYLLABUS
Fall 2006
GENERAL INFORMATION
Course Number:
Course Title:
Number of Credits:
Location of Class:
Meeting Time:
Professor:
Office:
Office Hours:
Office Phone:
Email:
CISC 2315
Discrete Structures
3
Davidson Building, Room 101
8:00 – 8:50 A.M. Monday, Wednesday, & Friday
William G. Tanner, Jr., PhD
Room 119 Davidson Building
Professor’s schedule posted in Davidson
(254) 295-4645
btanner@umhb.edu
COURSE DESCRIPTION
A foundational course designed to introduce students to the concepts of discrete structures for Computer
Science and to prepare them for courses that will utilize the methods they have mastered. In particular,
students will have practical experience employing various discrete structure techniques to solve problems
in Computer Science. Topics covered by this course will be propositional and predicate logic, inference,
functions, Boolean algebra, combinational digital logic, discrete probability, finite state machines and
computability. Topics also to be covered are sets, recursive programs, graphs, trees and lists.
The purpose of CISC 2315 is to acquaint the students with an array of mathematical concepts and
methods which form the foundation of modern computer science, in a form that will be relevant and
useful for CS students. CISC 2315 will draw some of its material from several mathematical disciplines:
formal language theory, mathematical logic, discrete mathematics. CISC 2315 will present these concepts
in an elementary way, with much more emphasis on CS algorithms and programs. CISC 2315 will be
structured as a small number of modules. Each module will introduce a group of mathematical concepts
and present applications of those concepts to problems of computer science and technology.
COURSE OBJECTIVES
Goals in this course are to build skills and give the student experience in the following areas:
1. Mathematical Reasoning: The ability to construct a sound logical argument which is essential for
computer scientists to be able to construct proofs and to write sound programs.
2. Combinatorial Analysis: An important problem solving skill is the ability to count or enumerate objects.
3. Discrete Structures: Recognition of abstract mathematical structures used to represent discrete objects
and relationships between those objects. These structures form the conceptual basis for many of the data
structures that we use as programmers.
4. Algorithmic Thinking: Certain classes of problems are solved by the specification of an algorithm that
can be implemented in a program.
5. Applications and Modeling: Discrete structures have applications to almost every conceivable area of
study including (of course) computer science, chemistry, botany, zoology, linguistics, geography,
business, etc.
In summary, our primary tasks in this course are to develop the student’s proving, problem-solving and
algorithmic skills, and to use discrete structures as abstract models for use in solving problems and
developing algorithms.
COURSE MATERIALS:
Textbooks:
J. L. Hein, Discrete Structures, Logic, and Computability, 2002, 2nd Edition, Jones & Bartlett
Computer Science, ISBN 0-7637-1843-2 [HEIN1]
J. L. Hein, Student Study Guide for Discrete Structures, Logic, and Computability,
2002, 2nd Edition, Jones & Bartlett Computer Science ISBN 0-7637-0971-9 [HEIN2]
COURSE POLICIES AND PROCEDURES
1. Grading: The final grade calculation will be reached according to the distribution described
on page 68 of the 2006 – 2007 UMHB Bulletin. The final course grade will be computed by
the following way:
Class Participation
Problem Sets and Quizzes
Four Section Examinations (worth 20% each)
Final Examination (worth 20%)
10%
10%
60%*
20%#
(*Best 3 out of 4 examination scores may be used).
(#All students will take the final examination).
2. Attendance: The student is expected to attend all scheduled classes and is held
responsible for all class work and assignments. Continued absences will reduce your
Class Participation score and will result in an unsatisfactory grade report for the course.
3. Tests: All students are required to be present for a test. If an emergency occurs, and
you can not make the test time, the student should immediately contact the instructor by
email, phone or in person to receive permission to miss the test. Permission will be granted
only under extenuating circumstances.
4. Makeup Tests: Makeup tests will be given only under extenuating circumstances
(major illness, death in the family, etc.). Students desiring a Makeup Test must make
arrangements with the instructor to take the test. A Makeup Test must be scheduled during
office hours BEFORE the next scheduled test. If a student fails to take a Makeup Test before
the next scheduled test, that student will receive a ZERO for the test missed.
5. Assignments: All assignments will be due on the DUE-DATE that is listed on the following
pages. They are due at the beginning of the class (firsts 10 minutes) on class days.
6. Final Exam: The final exam WILL be comprehensive. NO MAKEUP WILL BE GIVEN FOR
THE FINAL EXAM. A grade of ZERO will be given to any student not present for the final.
DISCRETE STRUCTURES -- CISC 2315
MONDAY, WEDNESDAY & FRIDAY @ 8:00 – 8:50 AM
Davidson Building Room 101
PART I
WEEK
01
02
DISCRETE STRUCTURES, LOGIC, AND COMPUTABILITY
DATE
DAY TEXT
ASSIGNMENTS
August
23
Introduction
Syllabus
August
25
HEIN Chap. #1
Read 1.1 – 1.4; 1.1:1, 3ad, 4ac, 6a, 7a, 8a
August
28
HEIN Chap. #1
1.2:1ae, 2ac, 3aceg, 6ace, 7a, 8a, 10ac, 11ac,
August
30
HEIN Chap. #1
16ac, 19ace, 23e, 28ac, 1.3:1, 2ace, 4ac, 5ac
September
01
HEIN Chap. #1
8ace, 9ace, 10ace, 11a, 12ac, 13ace, 14ac, 16a,
17c, 18c. 1.4:2, 4ac, 5ab, 7ab, 8, 9, 11
03 September 04 LABOR DAY
04
05
06
07
08
HOLIDAY
September
06
HEIN Chap. #2
Read 2.1 – 2.3
September
08
HEIN Chap. #2
2.1:1ac, 2ace, 3ac, 4ac, 5, 6ac, 11ac, 12ac,
September
11
HEIN Chap. #2
13ac, 14a, 15e, 18a, 19c 2.2:1aceg, 2ac, 3ac, 4a,
September
13
HEIN Chap. #2
6, 7a, 8a, 9ace, 11a, 2.3:1, 2ac, 3a, 4ace, 5ace
September
15
HEIN Chap. #2
6ac, 7ac, 8a, 9aceg, 10a, 11ac, 12ac, 13ac, 15ac
September
18
HEIN Chap. #2
September
20 HEIN Chap 1.1 – 2.3
September
22
HEIN Chap. #2
Read 3.1
September
25
HEIN Chap. # 2
3.1:1a, 2ace, 3a, 4a, 6ac, 7ac, 9a,
September
27
HEIN Chap. # 2
10ac, 11a, 13, 15, 16a, 17a, 18ac
September
29
HEIN Chap. #3
Read 3.2 – 3.3
October
02
HEIN Chap. #3
3.2:1, 3, 4ace, 5ace, 6ac, 7ace, 10a,
October
04
HEIN Chap. #3
14a, 15ac, 16a, 18a, 19ac, 22, 16a, 18a,
October
06
HEIN Chap. #3
19ac, 22, 24a, 3.3:2ac, 3acegi, 4ace,
October
09
HEIN Chap. #3
5ace, 6a, 7a, 8a, 11ace, 13a, 14a
October
11
HEIN Chap. #3
REVIEW
October
13
HEIN Chap. 3.1 - 3.3
REVIEW
Exam #1 Turn-in Homework
Exam #2
Turn-in Homework
DISCRETE STRUCTURES -- CISC 2315
MONDAY, WEDNESDAY & FRIDAY @ 8:00 – 8:50 AM
Davidson Building Room 101
PART II
WEEK
09
DISCRETE STRUCTURES, LOGIC, AND COMPUTABILITY
DATE
DAY TEXT
ASSIGNMENTS
October
16
FALL BREAK
HOLIDAY
October
18
HEIN Chap. #4
Read 4.1 – 4.2
October
20
HEIN Chap. #4
4.1: 1acegi, 2ace, 3a, 4ac, 5ac, 7a, 8a, 9ac
12ac, 13ac, 15c, 16ab, 22c
10
11
12
October
23
HEIN Chap. #4
4.2:1ace, 2acd, 3aceg, 4a, 5a, 7a, 9
October
25
HEIN Chap. #4
Read 4.3 – 4.4
October
27
HEIN Chap. #4
4.3:1ac, 2ace, 3abc, 5, 7ac, 9, 11, 14ac
October
30
HEIN Chap. #4
4.4:2acegi, 3a, 4a, 7, 10a, 11a, 13, 15, 20,
October
01
HEIN Chap. #4
REVIEW
November
03
HEIN Chap. 4.1 – 4.4 Exam #3 Turn-in Homework
November
06
HEIN Chap. #5
Read 5.1 – 5.3
November
08
HEIN Chap. #5
5.1:1, 2ac, 3; 5.2:1ac, 2ace, 3ac, 5aceg, 6a, 7a,
November
10
HEIN Chap. #5
8a, 5.3: 1ace, 2ace, 3ace, 4, 5ace, 7, 9, 10ac,
11ac, 12ac, 13a, 15, 16ac, 18ac, 19a, 26a
13
14
November
13
HEIN Chap. #5
Read 5.4 – 5.5
November
15
HEIN Chap. #5
5.4:1ac, 2ac, 5, 6ac, 7ac, 8ac.
November
17
HEIN Chap. #5
5.5:1, 2a, 3a, 4, 5, 6a, 8, 9
November
20
HEIN Chap. #5
REVIEW
November
22
HEIN Chap. 5.1 – 5.5 Exam #4 Turn-in Homework
November 24 THANKSGIVING
15
16
HOLIDAY
November
27
HEIN Chap. #6
Read 6.1 – 6.3
November
29
HEIN Chap. #6
6.2:1ac, 2a, 5, 7ace, 8aceg, 9ace, 10aceg,
December
01
HEIN Chap. #6
11ace, 12aceg, 13a, 14ace, 15ace
December
04
HEIN Chap. #6
6.3:1a, 2, 3a, 4, 5aceg, 6ace, 7aceg, 8a.
December
06
HEIN Chap. #6
REVIEW
December
08
HEIN Chap. 1 – 6
FINAL EXAMINATION