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

Learning Mechanisms: Blackboard Multiple external resources Piazza Google Chat for office hours Learning Mechanisms: Blackboard Multiple external resources Piazza Google Chat for office hours Learning Actions: Video Lectures Readings from Text Videos presenting examples Assignments Quizzes Midterm & Final Proctored Exams Learning Actions: Video Lectures Readings from Text Videos presenting examples Assignments Quizzes Midterm & Final Proctored Exams INNOVATION: None identified RELEVANCE: Mathematics structures for computer science COLLABORATION: None (discouraged - concern of plagiarism) Online Learning Trajectory Logic Expressions Sets, Functions, Sequences and Summations Non-Inductive Proof Techniques Inductive Proofs Recursive Definitions Combinatorics Graphs and Trees Course Content

Learning Outcomes 7. Defines and prove properties of graphs and trees 6. Apply basic counting arguments on combinatorial objects 5. Construct recursive definitions and proofs involving them. 4. Determine the correctness of and construct inductive proofs. 3. Determine the correctness of and construct non-inductive proofs 2. Define properties of and operations on sets, functions and sequences 1. Construct and interpret propositions expressed using logic expressions. Instructional Strategies Learning Outcomes 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

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