C.S. 3166Discrete Structures3 Cr. (Hrs.:3Lec.)
Course includes those mathematical topics which will help students in future computer-related courses. It refines problem solving skills by providing a vocabulary, structures and techniques for working with problems. Topics include basic counting techniques, recursion, logic, proofs, graph theory. Prerequisite: C.S. 2116 and M 172. (2nd)
Expectations:
E1. Students are proficient in a programming language and have learned basic error handling, testing and debugging techniques. (C.S. 2116)
E2. Students are familiar with summation notation, union and intersection of sets, logarithms, exponential functions, and are able to work with abstractions and manipulate formulas. (M 172)
Course Outcomes:
R1. Students are able to use propositional and predicate logic to specify and reason about program requirements. (CS 14, SE 14)
R2. Students can use inference to prove statements, can distinguish valid from invalid proofs, and know the vocabulary of proofs. (CS 14, SE 14)
R3. Students can use mathematical structures such as sets, relations, functions and sequences to reason about problems. (CS 14, SE 14)
R4. Students recognize when a problem can be modeled as a graph, and can use raph terminology and theory to reason about problems. (CS 14, SE 14)
R5. Students know when induction can be applied and can develop inductive proofs; similarly they know when recursion can be employed and can develop recursive algorithms. Students understand the relation between recursion and induction and can prove the correctness of recursive algorithms using induction. (CS 14, SE 14)
R6. Students can recognize situations in which combinatoric approaches to problem solving can be used and will be able to apply counting arguments to algorithmic design. (CS 14, SE 14)
|