CSC 2510

THEORITICAL FOUNDATIONS OF COMPUTER SCIENCE

SPRING 2008

CRN 16511

Aderhold Learning Center 303

12:00-1:15 pm  MW

 

Instructor

Dr. Saeid Belkasim               
Suite 1448
34 Peachtree St                    
Tel: (404) 413-5728                

Email: sbelkasim@cs.gsu.edu

Office Hours:             2:00 – 3:00 p.m. MW, others by appointment.

Text:                           Mathematical Structures for Computer Science (Sixth Edition), by Judith L. Gersting, W.H. Freeman and Company, 2007.

Course Description:  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).

Prerequisites * :       CSC 2010.  (grade C or higher)

Withdrawals:            The last day for regular withdrawal is March 3, 2008.

Requirements:           Students are expected to attend all classes.  Regular completion of all assignments, quizzes and tests is absolutely essential to succeed in this course.

Grading:  

                           

quizzes:

assignments:     

mid terms:     

final Exam:       

(15%)  

(15%)

(35%)

(35%). 

 

 

The overall grade for the course is assigned according to:      A(90-00) , B(80-89.9), C(70-79.9), D(60-69.9), F(0-59.9).

Other policy: 

·Make-up’s or missed deadlines must be coordinated prior, and are allowed only at the discretion of the instructor.                    

·All material submitted for grade must be the student’s own work. Any material that is not the students own work must be referenced.                                        
·Collaboration is allowed prior to preparation of actual material that is submitted for grade. Each student must work individually on his or her test. Any student found to be attempting to cheat on any test will receive a score of 0 for that test. Any attempt of getting or giving assistance in a test is considered cheating. It is the student's own responsibility to protect his or her work from being copied. No outside help is permitted. Plagiarized work is determined only by the instructor and is graded solely at the instructor's discretion.          

 

Test dates and locations:       

· Mid terms:                

            MT1:    Monday February 11, 2008

        MT2:    Monday March 24, 2008

 

· Final Exam:               

                         Monday April 28, 2008

All tests are scheduled to be taken during the normal class meeting times    

 

 

This syllabus provides a general plan for this course; deviations may be necessary.

* If you do not meet the prerequisite requirements, you are liable to being withdrawn from the course.