CSc2510 Theoretical Foundations of Computer Science

Spring, 2014
Computer Number: 16301
Classroom: Library South 102
Time: TR 11:00 am  -- 12:15 pm

Instructor:   Dr. Alex Zelikovsky
                   34 Peachtree Str. Suite 1443
                   Phone: (404) (404) 413 5730
                   Fax: (404) 413-5717
                   Email: alexz@cs.gsu.edu
                   Web site: http://alan.cs.gsu.edu/NGS/?q=content/classes                 
Office Hours:  TR 12:15 pm – 1:15 pm
Texts:              Discrete Mathematics and Its Applications by K. Rosen, 6/7th 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
                         Recitation sessions are mandatory!

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 – 40%, home assignments – 20%, final 40%
Other Policy:       Make-up’s or missed deadlines must be arranged prior, and will be generally not allowed