CS 225 Discrete Structures in Computer Science Winter

CS 225 Discrete Structures in Computer Science Winter, 2014: 157 Spring, 2014: 151 Summer, 2014: Two sections 97 and 53

Course Content g n i n ar O r o t ec j a r T y Le e nlin Learning Mechanisms: • • Blackboard Multiple external resources Piazza Google Chat for office hours Graphs and Trees Learning Actions: Combinatorics • Video Lectures • Readings from Text • Videos presenting examples • Assignments • Quizzes • Midterm & Final Proctored Exams Recursive Definitions Inductive Proofs Sets, Functions, Sequences and Summations Non-Inductive Proof Techniques Logic Expressions INNOVATION: None identified RELEVANCE: Mathematics structures for computer science COLLABORATION: None (discouraged - concern of plagiarism)

Instructional Strategies Readings Video lectures Think-out-loud problem (videos) Student discussion (Piazza) Homework problems Assignment Solutions plus video solutions • Quizzes and quiz demos • Midterm • Final Exam • • • Learning Outcomes 1. Construct and interpret propositions expressed using logic expressions. 2. Define properties of and operations on sets, functions and sequences 3. Determine the correctness of and construct non-inductive proofs 4. Determine the correctness of and construct inductive proofs. 5. Construct recursive definitions and proofs involving them. 6. Apply basic counting arguments on combinatorial objects 7. Defines and prove properties of graphs and trees

Teacher Presence • • Teacher-directed • Direct instruction – lecture oriented • Student homework submissions for teacher grading Teacher set climate Cognitive Presence Little student interaction supported/encouraged Social Presence