CSCI-C 241 Discrete Structures for Computer Science
- Prerequisites: None
- Delivery: On-Campus
Induction and recursive programs, running time, asymptotic notations, combinatorics and discrete probability, trees and lists, the relational data model, graph algorithms, and propositional and predicate logic.
- Use logical notation to define and reason about fundamental mathematical concepts such as sets, relations, functions, and integers.
- Evaluate elementary mathematical arguments.
- Synthesize induction hypotheses and simple induction proofs.
- Prove elementary properties of modular arithmetic and explain their computer science applications.
- Apply graph theory models of data structures and state machines to solve problems of connectivity and constraint satisfaction.
- Apply invariants and well-founded ordering to prove the correctness and termination of processes and state machines.
- Derive closed-form and asymptotic expressions from series and recurrences for growth rates of processes.
- Calculate the number of possible outcomes of elementary combinatorial processes.
- Calculate probabilities and discrete distributions for simple combinatorial processes.
- Problem-solve in small teams.
There is not a syllabus available for this course.