CSCI225S04Syl

**CSCI 225 Mathematical Structures for Computer Science**

An introduction to the fundamental concepts and structures used in computer science. Topics include propositional and predicate logic; sets, functions, and relations; mathematical induction, counting principles, and recurrences; trees and graphs.

**Text:** *Discrete Mathematics and Its Applications*
by Kenneth H. Rosen, 5th Edition.

**Objectives:**

Students will in the course of mastering the material offered develop significant skills in 1) Mathematical Reasoning, 2) Combinatorial Analysis, 3) Discrete Structures, 4) Algorithmic Thinking, and 5) Applications and Modeling. The student will achieve mastery at the introductory level of:

- Symbolic Logic
- Set Theory
- Algorithms their use and design including counting algorithms and matrices
- Mathematical Reasoning including proof strategy, sequences and summations, mathematical induction, and recursive and structural induction
- Counting techniques, permutations and combination and advanced counting techniques
- Discrete Probability
- Relations, Graphs and Trees

The material will be exercised through many detailed assignments which allow the student to develop and demonstrate mastery. When the student has completed the course he or she will be prepared for more advanced study of algorithms in a Computer Science curriculum and more advanced study of mathematics that build upon these skills.