CSCI12680 Course Syllabus

Discrete Structures in Computer Science, Fall 2007

Professor Info	Locations	Required Textbook	Prerequisite	Course Objectives
Course Description	Course_Policy	Final_grades	Exams	Exam Schedule
Course Outlines	Last Day To Drop	Academic_Honesty	Fire_Drill

PROFESSOR INFORMATION
Name:             Dr. Yao
Office:             Atkinson Hall 317

Telephone:      (478) 445-5483
Email:              jf.yao@gcsu.edu
URL:               http://abacus.gcsu.edu
Office Hours:  T, H -- 8:20AM-9:20AM, 10:50AM-12:20PM; or by appointments (Back to top)

LOCATIONS
Classroom: Atk 307 (12:30PM-1:45PM; T, H) (Back to top)

REQUIRED TEXT:

Mathematical Structures for Computer Science – A Modern Treatment of Discrete Mathematics, sixth Edition, 2006, by Judith Gersting. (Back to top)

PREREQUISITE: C or better in MATH 1113 and CSCI 1302. (Back to top)

COURSE OBJECTIVES:

This course serves the objective of learning an intensive introduction to discrete mathematics as it is used in computer science.

(Back to top)

COURSE DESCRIPTION :
Topics include propositional and predicate logic, functions, relations, sets, simple circuit logic, proof techniques, elementary combinatorics, and discrete probability. (Back to top)

ACADEMIC HONESTY:

The integrity of students is a critical component of the academic process. All written work submitted in this course must be individual work unless the instructor assigns a team of students to work on an assignment. Students must properly document all outside sources used for projects, programs, and homework. The submission of another’s work as one’s own is plagiarism, and will be dealt with using the procedures outlined on the Undergraduate Catalog. You may view the honor code online. (Back to top)

EXAMS:
Percentage Date
Weekly Quiz      70%                Every Thursday
Final Exam              30% Dec. 11, 2007 (11:00AM-1:45PM, Tu.)

        ----------------------------------------------------------------------------------------------------------------------------
         Total                                100%

Note: The Homework material will be included in the exams. (Back to top)

FINAL GRADES:
      Grade              Percentage
        A                90% and up
        B                80% - 89.999%
        C                70% - 79.999%
        D                60% - 69.999%
        F                59.999% or less (Back to top)

COURSE POLICY:

• You are expected to read the textbook prior to and after class.
• Class participation is essential in learning computer technology.  It is your responsibility to attend the class in order to achieve good learning, therefore obtain a good grade.
• You must NOT miss a test unless you have a verifiable excuse.  An unexcused absence from a test will result in a numerical grade of zero for that test.
• Prior to mid-semester, you will receive feedback on your academic performance in this course. Your overall grades are updated on a regular basis on the Web throughout the semester. (Back to top)

TENTATIVE COURSE OUTLINE:

Week One Formal Logic: Statements, Symbolic Representation, and Tautologies

Week Two Formal Logic: Propositional Logic, Quantifiers, Predicates, and Validity

Week Three Formal Logic: Predicate Logic, Logic Programming, Proof of Correctness

Week Four Proof Techniques, Induction, More on Proof of correctness

Labor Day Holiday (Sept. 3-4, 2007)

Week Five Recursion and Recurrence Relations, Analysis of Algorithms

Week Six Sets, Counting, Principle of Inclusion and Exclusion, Pigeonhole Principle

Week Seven Permutations and Combinations, Probability, Binomial Theorem

Week Eight Relations, Topological Sorting, Relations and Databases

Week Nine Functions, Matrices

Week Ten Graphs and Their Representations, Trees and Their Representations

Week Eleven Decision Trees, Huffman Codes

Week Twelve Boolean Algebra and Computer Logic

Week Thirteen Boolean Algebra and Computer Logic

Week Fourteen Modeling Arithmetic, Computation, and Languages

Thanksgiving Holidays (Nov. 21-23, 2007)

Week Fifteen Finite-State Machines

Week Sixteen Turing Machines

Week Seventeen Formal Languages
(Class ended Dec. 4, 2007) (Back to top)

OCTOBER 10, 2007 IS THE LAST DAY TO WITHDRAW A COURSE WITHOUT ACADEMIC PENALTY. (Back to top)

FIRE DRILL PROCEDURE

In the event of a fire alarm signal students will exit the building in a quick and orderly manner through the nearest hallway exit.  Learn the floor plan and exits of this building. Do not use elevators.  Crawl on the floor if you encounter heavy smoke. Assist disabled persons and others if possible without endangering your own life. Assemble for a head count on front lawn of main campus. (Back to top)