Sage already knows this exact syllabus — ask it anything about Discrete Structures I, generate practice questions in your exam's format, and get a cram sheet that works offline.
What you'll be able to do (official learning outcomes)
convert logical statements from informal language to propositional and predicate logic expressions
describe the strengths and limitations of propositional and predicate logic
outline the basic structure of each proof technique (direct proof, proof by contradiction, and induction) described in this unit
apply each of the proof techniques (direct proof, proof by contradiction, and induction) correctly in the construction of a sound argument
apply the pigeonhole principle in the context of a formal proof
compute permutations and combinations of a set, and interpret the meaning in the context of the particular application
Course contents
Propositional Logic, Predicate Logic, Sets, Functions, Sequences and Summation, Proof Techniques, Mathematical induction, Inclusion-exclusion and Pigeonhole principles, Permutations and Combinations (with and without repetitions), The Binomial Theorem, Discrete Probability, Recurrence Relations. Computing 109 New 300 Level
Source: the Nigerian Universities Commission (NUC) Core Curriculum and Minimum Academic Standards (CCMAS). StudyOps loads this syllabus automatically when you study CSC 203.