CCOG for CS 250 Winter 2025
- Course Number:
- CS 250
- Course Title:
- Discrete Structures I
- Credit Hours:
- 4
- Lecture Hours:
- 30
- Lecture/Lab Hours:
- 0
- Lab Hours:
- 30
Course Description
Introduces discrete structures and computational techniques in the areas of first-order logic, discrete proofs, number theory, sequences, induction, recursion, and set theory. Prerequisites: MTH 251 and CS 162. Audit available.
Intended Outcomes for the course
Upon completion of this course students will be able to:
- Formulate, interpret, and apply properties of propositional and first-order predicate calculus, recursive definitions, and sequences in real world contexts.
- Prove mathematical concepts using both deductive and inductive logic.
- Use analytical problem solving strategies to solve problems using multiple approaches and to interpret the results in practical terms.
- Utilize techniques in discrete mathematics and logic that are used in the study and practice of computer science.
Outcome Assessment Strategies
Assessment must include:
1. At least two in-class proctored examinations, one of which may be the final exam, and
2. At least two of the following additional measures, where at least one includes writing:
a) take-home examinations. (group and/or individual)
b) projects. (group and/or individual)
c) quizzes. (group and/or individual)
d) graded homework/worksheets.
E) in-class activities.
F) attendance.