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, 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, HSS 3.01.18
Recitations:
- W 3:00pm-3:50pm, HSS 3.02.40
- F 3:00pm-3:50pm, BB 3.03.14
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.17
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 assistants:
Jessica Sherette
Wednesday recitation
Office: SB 1.04.02
Email: jlsherette -AT- satx.rr.com
Office hours:
Wednesday 4:00pm - 5:00pm, and by appointment
Vicente Ferrer Gutierrez
Friday recitation
Email: vferrer11 -AT- hotmail.com
Last modified by Carola Wenk,
carola @ cs.utsa.edu ,