CS 2233 Discrete Mathematical Structures
Fall 08
[ Home | Calender | Policies | Pictures | Homework | Resources ]

Home

News:

  • The grades are up.
  • Have happy holidays, Merry Christmas, and a happy new year.

Course Description:

This course is a survey and development of the theoretical tools suitable for algorithmic applications. Topics include logic, mathematical induction, proofs, set theory, functions, relations, counting, graphs, and trees. The objectives of this course are to introduce you to several mathematical concepts for analyzing computer programs and to give you experience in the use of these concepts.

Prerequisites:

CS 1713 Introduction to Computer Programming II
MAT 1214 Calculus I

Time & Place:

Lecture: MWF 2:00pm - 2:50pm, SB 3.02.02

Recitations:

Textbook:

Required text:
Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6th edition, McGraw-Hill, 2007.
Online resources for this book (additional exercises with solutions, links to resources on the web, ...) are available.

Instructor:

Carola Wenk
SB 4.01.14
E-mail: carola -AT- cs.utsa.edu
Phone: 458-4501
Office hours: Monday 3:00pm - 4:00pm, Wednesday 4:00pm - 5:00pm, and by appointment

Teaching assistant:

Zhenxin Zhan
Email: andyjian430074 -AT- gmail.com

Last modified by Carola Wenk,   carola @ cs.utsa.edu ,