CS 2620 A: Discrete Structures

Course Description:

Propositional and predicate logic, mathematical induction, 
and recursion. Sets, relations, functions. Graphs and trees. 
Boolean algebra and computer logic. Finite state machines 
and computability.

Prerequisite: Math 2261 or Math 2262, with a grade of "C" 
or better. 

Required Materials:

         
Text:Discrete Mathematics and its Applications,
                5th. Ed.,
         	Author: 	Kenneth H. Rosen
         	Publisher:	McGraw Hill

            

Topical Outline

Number Systems
Sets and Logics
Combinatorics
Relations and Functions
Graphs
Trees
Boolean Algebra
Finite State Machines
 

Grading Policy:

             The grade for the course will be assigned based on the 
             following percentages:
 
 3-4  Tests:      90 - 100%
	If you miss a test with a legitimate reason, the score 
	you make on the final will be assigned for that test.
          
 Assignments, Quizzes, Attendance, 
        and class participation:	0 - 10%     
        
Grading Scale
        90 - 100          A
        80 - 89		B
        70 - 79		C
        60 - 69		D
        0  - 59		F	
 

Instructor:

	Said C. Fares
	Office:                         2132  Nevins Hall 
	Traditional Office Hours:       10:45 AM - 11:45 AM TR
 					or by appointment
	Electronic Office Hours:        Any day, any time
	E-mail:                         sfares@valdosta.edu
	Phone:                          (912) 333-5780

Semester Calendar:

	January  9:	First Class Day
	January 16:	MLK
	March    2:	Mid-term
	March13-17:	Spring Break
	May      1:	Last Class Day
	May      3:	Final (Wednesday, 12:30 pm - 2:30 pm) 

Last update January 5, 2006.