EECS 2520 - Discrete Structures Course Syllabus
Credits/Contact Hours
3 credit hours & 3 50-minute lecture contact hours per week.
Textbook
Discrete Mathematics and Its Applications, Kenneth H. Rosen, (8th Edition) McGraw-Hill, 2019
Course Information
An introduction to the discrete structures used in computer science to develop software
including proof techniques, Boolean logic, graphs, trees, recurrence relations, and
functions.
Prerequisite: PHIL 1010
Required course
Specific Goals - Student Learning Objectives (SLOs)
The students will be able to:
1. Develop a vocabulary for and appreciation for mathematical rigor in Computer Science.
2. Learn and apply Mathematical Induction to a range of problems.
3. Learn fundamental notations for sets, functions, sequences, and summations.
4. Learn and apply Number Theory to solve problems in Computer Science.
5. Develop the mathematical underpinnings required for computer security.
6. Learn the elementary principles of Combinatorics.
7. Solve a limited class of recurrence relations.
8. Ability to define and construct graphs and trees.
9. Motivate the relevance of sound mathematics to software development.
Topics
- The Foundations: Logic and Proofs
- Basic Structures: Sets, Functions, Sequences and Sums
- Algorithms
- Number Theory
- Induction and Recursion
- Counting
- Recurrence relations
- Relations
- Graphs and Trees