Topics Coverage Summary: variables, types, assignment, order of operations, lists, dictionaries, functions, scope, conditional statements, logical expressions, while loops, for loops Number of Questions/Slides Available: 100+ Materials Author: Daniel Zingaro, University of Toronto Sampl ...read more
Topics Coverage Summary: Use and implementation of basic data structures including linked lists, stacks, and queues. Use of advanced structures such as binary trees and hash tables. Object-oriented design including interfaces, polymorphism, encapsulation, abstract data types, pre-/post-con ...read more
Topics Coverage Summary: This is an introductory course on the principles of operating systems. Topics include processes, scheduling, synchronization, memory management, virtual memory, file systems, I/O, protection, security, networking, and distributed systems. There is a significant sys ...read more
Topics Coverage Summary: variables, types, assignment, order of operations, vector indexing, matrix indexing, RGB color scheme and RGB image matrices, scripts, functions, scope, conditional statements, logical expressions, shortcutting, logical matrix indexing, for loops, while loops, spar ...read more
Topics Coverage Summary: Alice: methods (class and world level), parameters, events, functions, if statements, counted and while loops, lists. Excel: functions and formulas, relative and absolute addressing, linking Excel functions to Alice concepts (e.g. vlookup, average, etc.) Materia ...read more
Topics Coverage Summary: ISAs, performance evaluation, computer arithmetic, single-cycle processor, multi-cycle processor, pipelining, caches, virtual memory, modern superscalars, and multithreading Number of Questions/Slides Available: 107 Materials Author: Leo Porter, Skidmore College S ...read more
Topics Coverage Summary: Deterministic Finite Auotmata (DFA), Nondeterministic Finite Auomata (NFA), Regular Expressions, Pushdown Auomata (PDA), Context-Free Grammars, Turing Machines, Decidability, Halting Problem, Undecidability, Diagonalization, Reductions, P vs NP. Number of Questions ...read more
Topics Coverage Summary: Simple execution/multiple objects with turtles, Pictures and Sound, Pictures: loops (for each, for, while), if statements, 1-D and 2-D arrays. Sounds: repeat of loops, if statements, and 1-D arrays. Basic introduction to class design, getters/setters, construc ...read more
Topics Coverage Summary: This course focuses on three different paradigms – functional, object-oriented and logic programming, as embodied in OCaml, Scala and Prolog. Number of Questions/Slides Available: 18 lectures of slides with about 5 PI questions each (lectures also include standar ...read more
**We are beginning an e-support program for those new to Peer Instruction. We are forming small groups of new adopters and experienced PI faculty to discuss issues/concerns. If you are interested in participating, please sign up here.**
Implementing Peer Instruction is not (necessarily) the same as “using clickers.” Like any tool, clickers can be used for good or ill. Below we share some advice on how to get started using Peer Instruction, advice for helping students understand why it’s valuable, an instructor “cheat sheet” to take with you to class, and specific tips on things that we see instructors tend to do but should be avoided.
What have people published about Peer Instruction in Computing? Here are some things we think you might find useful or interesting, updated periodically with the latest findings:
Can Peer Instruction be Effective in Upper-division Computer Science Courses?
Cynthia Lee, Saturnino Garcia, and Leo Porter.
ACM Transactions on Computing Education (TOCE), August, 2013.
Student Experience in a Student-Centered Peer Instruction Classroom
Beth Simon, Sarah Esper, Leo Porter, and Quintin Cutts.
To appear in ICER 2013
Peer Instruction in Computer Science at Small Liberal Arts Colleges
Leo Porter, Saturnino Garcia, John Glick, Andrew Matusiewicz, Cynthia Taylor.
Halving Fail Rates Using Peer Instruction: A Study of Four Computer Science Courses
Leo Porter, Cynthia Bailey Lee, Beth Simon.
How We Teach Impacts Student Learning: Peer Instruction vs. Lecture in CS0
Jaime Spacco, Beth Simon, Julian Parris.
Retaining 18-30% more Majors with a Trio of Instructional Best Practices in CS1
Leo Porter, Beth Simon.
Experience Report: CS1 in MATLAB for Non-Majors, with Media Computation and Peer Instruction
Cynthia Bailey Lee.
Everything CS faculty need to adopt Peer Instruction