CSc    2510   THEORITICAL FOUNDATIONS OF COMPUTER SCIENCE

Fall Semester, 2008
Computer Number: 87220

Classroom: CS400
Time: TR 11:00 am  -- 12:15 pm

Computer Science Department

 

Instructor:   Dr. Alex Zelikovsky

                   34 Peachtree Str. Suite 1443

                   Phone: (404) 651-0676

                   Fax: (404) 651-2246

                   Email: alexz@cs.gsu.edu

                   Web site: http://www.cs.gsu.edu/~cscazz

                  

Office Hours:  TR 12:30 pm – 1:30 pm

 

Texts:              Discrete Mathematics and Its Applications by K. Rosen,

6th edition, McGrawHill

Course Content: This course covers the basic theoretical foundations required to study various sub-disciplines in computer science. Topics include: propositional and predicate logic with applications to logic programming, database querying, and program verification; induction and its application in proving correctness and termination of programs; recurrence relations, combinatorics, and graph theory with applications to analysis of algorithms; sets, relations, and functions and their applications in databases, functional programming, and automata. 3.000 Credit Hours. (Refer to GSU Catalog description)    

Prerequisite: CSc 2010 (grade C or higher)

Attendance:  You may be dropped if you have more than three unauthorized absences. 

                      Students are responsible for all the material covered or assigned

Withdrawals: The last day of regular withdrawal.

Course Requirements: Students should attend all classes, regular completion of all assignments, quizzes and tests is

absolutely essential to succeed in this course

Course Grades   quizzes – 30%, home assignments – 30%, final 40%

Other Policy:       Make-up’s or missed deadlines must be arranged prior, and will be 

                            allowed only at the discretion of the instructor.