CSCI 3030 - Mathematical Structures for Computer Science


Instructor: Predrag Punosevac

Office: Allgood Hall N334


Office Hours: MW 2:30 PM - 4:00 PM

Term: Spring 2013

Lectures: MW 1:00 PM - 2:15 PM   AH E364

Credit Hours: 3


The course prepares Computer Science majors for advanced study by emphasizing components of Discrete Mathematics related to Computer Science. The topics include sets, functions and relations, logic, Boolean algebra, graph theory, proof techniques, and matrices. Examples will emphasize Computer Science applications.

Prerequisites: MATH 2011 or MATH 1220, either with C or better.


  1. Edward A. Bander and S. Gill Williamson, A Short Course in Discreate Mathematics , Dover, 2011.
  2. Edward A. Bander and S. Gill Williamson, Mathematics for Algorithm and System Analysis, Dover, 2011.


[01.01.2010]   Students are strongly encouraged to use the university learning management system. This content management system provides a grade book functionality and is regularly updated including the solution keys for all problem sets and exams.