Course Description

Contents and Objecives:

 
This course covers the theoretical foundations of Computer Science in the areas of propositional and predicate logic, mathematical proof techniques, sets, combinatorics, functions and relations, Boolean algebra, graphs, and graph algorithms. Students successfully completing this course will have gained important insights into the theoretical foundations of computer science and be able to apply formal techniques to the analysis of problems.

Prerequisites:

 
All students are expected to have passed the courses Intermediate Programming (CSE 1320) and Calculus I (Math 1426) or an equivalent before attending this course.

Textbook:

 
Judith L. Gersting, Mathematical Structures for Computer Science,
4th edition, W.H. Freeman and Company, 1999

Course Materials:

 
Additional course materials will be available electronically. Also, changes, if any, will be announced by e-mail.

E-mail and WWW page:

 
There is a course web page at http://www-cse.uta.edu/~huber/cse2315 . All changes and supplementary course materials will be available from this site. In addition, necessary changes or important announcements will also be distributed by e-mail. In order to receive class-related messages you have to send an e-mail to the instructor (huber@omega.uta.edu).

Teaching Assistant:

 
The TA for this course is Emre Celebi. He will hold office hours in WH 412, MW 11:00 - 13:00. His e-mail address is cse2315@yahoo.com .

Tentative Office Hours:

 
Office hours for the course will be held by the instructor in 302 Nedderman Hall,
MW 3:30 - 4:30, and Tu 2:00 - 3:00. The first office hours will be held on Wednesday, August 28. Times are subject to change and will be posted. If for some reason you can not make it to any of these office hours, please inform the instructor.
e-mail: huber@omega.uta.edu