You are here

CC.L3C-01e

Arrays Lesson Plan

Description: 
This is a sample lesson plan and assignment for teaching arrays. This was part of a lesson plan assignment of mine for my CS AQ. I learned how to program by taking working video games and enhancing them. Many students will likely learn the same way. Resources for source code are given in the Word doc.

Cache-Oblivious Computations: Algorithms and Experimental Evaluation

Description: 
Discussion based on techniques and analysis for handling massive data sets. Analysis of algorithms is discussed from the perspective of I/O complexity and the cache-oblivious model. Related topics include the Longest Common Subsequence problem, recursion, bioinformatics, priority queue, heaps and Gaussian Elemination. This is a very mathematical treatment.

First Day Activity - Sorting

Description: 
This is an activityfor grades 6-12 that gets students to think about the problem of sorting some playing cards. The rules of the "game" essentially abstract the "rules" for the comparison-based sorting in a computer. It seems to work well to get kids into the CS mindset, and builds some confidence that they can succeed.

Food For Thought: Great Ideas in CS Illustrated with Food

Description: 
This presentation is oriented around efficiency in computing, in particular constructing algorithms, correctness, running time, and algorithm efficiency.

Guzdial and Ericson Java Media Computation Walkthrough

Description: 
This is a movie in which the author Mark Guzdial talks through and demonstrations various Javaprogramming examples using media computation (media manipulation); it accompanied the set of 4 lessons in this web repository entitled "Learning Java through Media Computation". It is an 81mb zip file and for this reason was separated from the set of sessions.

Introduction to Graph Theory

Description: 
This presentation will explore graph theory and its relationship to ICS4U. A graph is a mathematical structure usually drawn by connecting dots with lines. They are typically represented in a program using arrays and/or linked lists. Graphs are gentle to introduce, fun to draw and play with, and a wonderful example of the connection between mathematics andcomputer science.

Learning Java Through Media Computation

Description: 
This is a set of 4 sessions: Intro to OO Programming concepts and Java Turtles, Intro to Media Computation and image manipulation using objects, methods, arrays, and loops; Image Manipulation using 2d arrays and conditionals, Manipulating sound using ranges in iteration and methods that return values; also a look at inheeritance using Java Turtles.

Power of Randomness in Computation

Description: 
The presenter talks about the usefulness of randomness in CS noting algorithms, Monte Carlo simulations, cryptography. He explores the generation of pseudo-random numbers and the quality of random numbers generated including the minimal randomness requirement.

Programming Ideas V2

Description: 
"This is a collection of ideas for exercises, test questions, projects, etc. It is not a collection of exercises, test questions, projects, etc. This collection is meant to be used when the teacher first begins to design an assignment or test and needs some ideas. This collection is no good to the teacher who is in a panic and needs a string exercise for a class starting in five minutes!

Role Playing Helper Functions/Recursion

Description: 
Students role play various objects of simple programs to understand parameter passing and recursive calls. Grades 10-12. Prior knowledge: compile and run simple programs; write code using parameters.

Pages

Subscribe to CC.L3C-01e