Computer Science 2259

Discrete Structures

Catalog Description

Set algebra including mappings and relations; algebraic structures; elements of the theory of directed and undirected graphs; Boolean algebra and propositional logic; these structures applied to various areas of computer science.

Prerequisites

Credit or registration in CSC 1254 or CSC 1351 and MATH 1552.

Lectures
Section 1: TTH noon - 01:20 - Web-Based Delivery

Instructor
William E. Duncan

homepage: http://www.csc.lsu.edu/~duncan

Office Hours

Required Textbook

Discrete Mathematics and its Applications 8/e, Kenneth Rosen (ISBN: 978-1-259-67651-2)

Goal

To explore discrete mathematical structures and probability theory. By the end of this course the student will

understand the basics of mathematical reasoning in constructing mathematical arguments and proofs,
use combinatorial analysis and techniques in counting objects of various kinds, and
explore abstract mathematical structures that represent objects and the relationships between them.

Course Calendar

Evaluation

Grading will be based on programming assignments and exams.

Homework Assignments        20%

Exam 1                      25%

Exam 2                      25%

Final Exam                  30%