CSCI13680-01 Course Syllabus

Discrete Structures in Computer Science, Fall 2017

 

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

Telephone:      (478) 445-5483
Email:              jf.yao@gcsu.edu
URL:               http://abacus2.gcsu.edu  or  http://abacus.gcsu.edu

Office Hours:  8:20 A.M.-9:20 A.M., 10:50 A.M.-12:20 P.M. on Tu. and Th.  and by appointments

·      Emails that are not urgent only will be answered during the office hours

LOCATION
Classrooms: Atk 207 (12:30-1:45PM on T, Th) and Atk309 (10:00-10:50AM on W)

REQUIRED TEXT:

“Mathematical Structures for Computer Science –Discrete Mathematics and Its Applications”, seventh Edition, 2014, by Judith Gersting.   

PREREQUISITE: C or better in CSCI 1302 and Math 1113 (or approval of professor).

COURSE OBJECTIVES:

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

COURSE DESCRIPTION :
This course offers an intensive introduction to discrete mathematics as it is used in computer science. Topics include functions, relations, sets, propositional and predicate logic, simple circuit logic, proof techniques, cryptography, discrete probability, graphs and trees, and understand basic Finite-State Machines, Turing Machines, and Formal Languages.

 

EXPECTED COURSE OUTCOME:

 

Students will be able to:

  • Explain with examples the basic terminology of functions, relations, and sets.
  • Perform the operations associated with sets, functions, and relations.
  • Relate practical examples to the appropriate set, function, or relation model, and interpret the associated operations and terminology in context.
  • Demonstrate basic counting principles, including uses of diagonalization and the pigeonhole principle.
  • Apply formal methods of symbolic propositional and predicate logic.
  • Describe how formal tools of symbolic logic are used to model algorithms and real-life situations.
  • Use formal logic proofs and logical reasoning to solve problems such as puzzles.
  • Describe the importance and limitations of predicate logic.
  • Outline the basic structure of and give examples of each proof technique described in this unit.
  • Discuss which type of proof is best for a given problem.
  • Relate the ideas of mathematical induction to recursion and recursively defined structures.
  • Identify the difference between mathematical and strong induction and give examples of the appropriate use of each.
  • Apply the tools of probability to solve problems such as the Monte Carlo method, the average case analysis of algorithms, and hashing.
  • Understand cryptography
  • Understand basic graph and Trees
  • Understand basic Finite-State Machines, Turing Machines, and Formal Languages

 

SATISFIED PROGRAM STUDENT OUTCOMES:

·      Outcome 1: An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems

·      Outcome 4: An understanding of security issues

 

ENABLED ABET STUDENT OUTCOMES:

·      Outcome (a) An ability to apply knowledge of computing and mathematics appropriate to the discipline

·      Outcome (b): An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution

·      Outcome (e): An understanding of security issues

·      Outcome (j): An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that comprehension of the tradeoffs involved in design choices.  

 

COURSE TOPICS INCLUDED BUT NOT LIMITED TO:

·      Formal Logic: Statements, Symbolic Representation, and Tautologies

·      Formal Logic: Propositional Logic, Quantifiers, Predicates, and Validity

·      Formal Logic: Predicate Logic, Logic Programming

·      Proof Techniques

·      Induction Recursion and Recurrence Relations

·      Analysis of Algorithms

·      Sets

·      Counting

·      Principle of Inclusion and Exclusion

·      Pigeonhole Principle

·      Relations

·      Topological Sorting

·      Relations and Databases

·      Functions

·      Matrices

·      Graphs and Their Representations

·      Trees and Their Representations

·      Cryptography

·      Decision Trees

·      Huffman Codes

·      Boolean Algebra and Computer Logic

·      Modeling Arithmetic

·      Computation and Languages

·      Finite-State Machines

·      Turing Machines

·      Formal Languages

 

GRADE DISTRIBUTION:
                                             Percentage           Date
         Weekly Quiz               20%                   Wednesday

         Mid-term exam           35%                    October 10, 2017
         Final Exam                  45%                    Dec. 14, 2017; 10:30AM-12:45PM       

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

GRADEING POLICY:
      Grade              Percentage
        A                90% and up
        B                80% - 89.99%
        C                70% - 79.99%
        D                60% - 69.99%
        F                59.999% or less  

 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.

·       All quizzes are teamwork.  You must form a 3-people team for the weekly quizzes.  The mid-term and final exam are individual work.

·       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.    

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.

 

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

Week Five           Induction Recursion and Recurrence Relations, Analysis of Algorithms

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

Week Seven         Relations, Topological Sorting, Relations and Databases

Week Eight          Relations, Topological Sorting, Relations and Databases

Week Nine           Functions, Matrices

Week Ten            Graphs and Their Representations, Trees and Their Representations

Week Eleven        Graphs and Their Representations, Trees and Their Representations

Week Twelve      Decision Trees, Huffman Codes

Week Thirteen     Modeling Arithmetic, Computation, and Languages

Week Fourteen    Finite-State Machines

Week Fifteen       Turing Machines

Week Sixteen       Formal Languages 

Last day to drop an individual course (reduce course load) without fee penalty and without a W grade (Aug 25,  2017, 5PM)

Last day of classes (Dec. 11, 2017)  

Labor Day Holiday (Sept. 4, 2017)
Fall Break (Oct. 9-10, 2017)
Thanksgiving Holidays (Nov. 22-24, 2017)

October 19, 2017, 5:00 P.M.  is the last day to drop a course or withdraw from ALL courses with a "W" grade (Unless previously assigned an "F" by instructor for absences or if maximum number of dropped courses has been exceeded)

INTELLECTUAL PROPERTY POLICY

The intellectual property of class assignments and other materials developed using university resources that are commercialized are reviewed under the USG and GC policies to determine ownership and/or payment rights. USG policies can be found at http://www.usg.edu/policymanual/section6/policy/6.3_intellectual_properties/ and GC policies can be found at http://www2.gcsu.edu/policies/overall/intellectual-property-polic.htm.

ASSISTANCE FOR STUDENT NEEDS RELATED TO DISABILITY

If you have a disability as described by the Americans with Disabilities Act (ADA) and the Rehabilitation Act of 1973, Section 504, you may be eligible to receive accommodations to assist in programmatic and physical accessibility. Disability Services, a unit of the GCSU Office of Institutional Equity and Diversity, can assist you in formulating a reasonable accommodation plan and in providing support in developing appropriate accommodations to ensure equal access to all GCSU programs and facilities. Course requirements will not be waived, but accommodations may assist you in meeting the requirements. For documentation requirements and for additional information, we recommend that you contact Disability Services located in Maxwell Student Union at 478-445-5931 or 478-445-4233.

STUDENT OPINION SURVEYS

Given the technological sophistication of Georgia College students, the student opinion survey is being delivered through an online process. Your constructive feedback plays an indispensable role in shaping quality education at Georgia College. All responses are completely confidential and your name is not stored with your responses in any way. In addition, instructors will not see any results of the opinion survey until after final grades are submitted to the University. An invitation to complete the online opinion survey is distributed to students near the end of the semester. Your participation in this very important process is greatly appreciated.

FIRE DRILL PROCEDURE

Fire drills will be conducted annually. In the event of a fire alarm, students will exit the building in a quick and orderly manner through the nearest hallway exit. Learn the floor plan and exits of the building. Do not use elevators. If you encounter heavy smoke, crawl on the floor so as to gain fresh air. Assist disabled persons and others if possible without endangering your own life. Assemble for a head count on the front lawn of main campus or other designated assembly area.

 RELIGIOUS OBSERVANCE POLICY

Students are permitted to miss class in observance of religious holidays and other activities observed by a religious group of which the student is a member without academic penalty. Exercising of one’s rights under this policy is subject to the GC Honor Code. Students who miss class in observance of a religious holiday or event are required to make up the coursework missed as a result from the absence. The nature of the make-up assignments and the deadline for completion of such assignments are at the sole discretion of the instructor. Providing verifiable proof of the religious affiliation and activities are at the sole discretion of the instructor as well.  Failure to follow the prescribed procedures voids all student rights under this policy.