CS 3233 Discrete Mathematical Structures
[ Home | Message Board | Calender | Policies | Pictures | Homework | Resources ]

Home

News:

-->

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 1723 and MATH 1223

Time & Place:

Lecture: M,W 4:00pm - 5:15pm, HSS 3.01.18

Recitations:

Textbook:

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

Instructor:

Carola Wenk
SB 4.01.36
E-mail: carola@cs.utsa.edu
Phone: 458-4501
Office hours: Monday 5:30pm - 7:00pm, Wednesday 5:30pm - 7:00pm, and by appointment

Teaching assistant:

Yijuan Lu
E-mail: lyijuan@cs.utsa.edu

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