Course Notes 
    Syllabus
    Semester Planner
 
    Lecture Notes

    Assignments

    Quizes
 
    Tests

Course Syllabus for MATH 280

VIRGINIA STATE UNIVERSITY
SCHOOL OF ENGINEERING, SCIENCE, & TECHNOLOGY
DEPARTMENT OF MATHEMATICS & COMPUTER SCIENCE
MATH 280 - DISCRETE MATHEMATICS FOR COMPUTER SCIENCE I - 3 sem. hours

COURSE SYLLABUS: FALL 2003


COURSE DESCRIPTION:

Introduction to fundamental techniques in Discrete Mathematics for the application in Computer Science. Mathematical logic, Mathematical induction, Set theory, Relations, Functions, analysis of algorithms, Counting principle, Boolean algebra, Grammars and finite state automata.

Prerequisites: MATH 121
 

COURSE  TEXT:

Kenneth H. Rosen;  Discrete Mathematics and its Applications, 5th Edition,  McGraw Hill, New York, NY 10020, 2003
 
 

TOPICS TO BE COVERED:

  1. The Foundations: Logic and Proofs, Sets and Functions
    • Logic
    • Propositional Equivalences
    • Predicates and Quantifiers
    • Nested Quantifiers
    • Methods of Proof
    • Sets
    • Set Operations
    • Functions
  2. The Fundamentals: Algorithms, the Integers, and Matricies
    • Algorithms
    • The Growth of Functions
    • Complexity of Algorithms
    • The Integers and Division
    • Integers and Algorithms
    • Applications of Number Theory
    • Matricies
  3. Mathematical Reasoning, Induction, and Recurtion
    • Proof Strategy
    • Sequence and Summations
    • Mathematical Induction
    • Recursive Definitions and Structural Induction
    • Recursive Algorithms
    • Program Correctness
  4. Counting
    • The Basics of Counting
    • The Pigeonhole Principle
    • Permutation and Combinations
    • Binomial Coefficients
    • Generalized Permutations and Combinations
  5. Boolean Algebra
    • Boolean Functions
    • Representing Boolean Functions
    • Logic Gates
    • Minimization of Circuits
GRADING:

Each student's grade will be determined by the following criteria:

Midterm Average = 2/3 (Average of all work prior to the Midterm Exam) + 1/3 (Midterm  Exam Score)

Final Grade = 1/3 (Midterm Average) + 1/3 (Average of all work assigned after the Midterm  Exam and prior to the Final Exam) + 1/3 (Final Exam Score)

The following scale will be used:

                              A: 90 - 100
                              B: 80 - 89
                              C: 70 - 79
                              D: 60 - 69
                              F: BELOW 60
 

TUTORIAL ASSISTANCE:

Instructor's Office  - 306Sa HM
Mathematics Laboratory - 210 HM
Computer Science/Mathematics Laboratory - 214 HM
Lab hours are posted on each lab office door and will be passed out in class no later than the 3rd week of class.