CMPT 335 - Discrete Structures

Description
A study of concepts and fundamentals of propositional logic, logic of predicates, sets and set operations, mathematical induction, modular arithmetic, relations, coding theory and encryption. Detailed consideration of structures most frequently encountered in computer science: graphs, trees, and operations on them. Spring (and Fall if needed). Prerequisite: A grade of C or better in CMPT 101 or CMPT 201
Credits
3
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Spring 2020, Spring 2019, Spring 2018, Fall 2017
Offered
MTh, TuF, MWTh
Avg. Class Size
28
Avg. Sections
1