You are here

CC.L3C-01c

Binary Searching

Description: 
PowerPoint presentation introducing sequential and binary searching. Includes walk-throughs of a short sample list, using both algorithms, as well as a discussion of effiency. (language-independent)

Crazy Objects

Description: 
The "Crazy Objects" was an assignment put together to address misunderstanding some students have about how computer languages handle objects, specifically the idea of having a reference to an object and how objects can reference other objects.

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.

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.

Java: A Gentle Introduction

Description: 
Introduction to Java for teachers, including notes on AP Java subset, assignments based on resources available on BlueJ.org. PDF (converted PowerPoint presentation).

Object Oriented Design Using Pong Learning Module

Description: 
In this learning module students will design and implement Pong using object-oriented (OO) programming concepts. Lesson plans, worksheets and Java source files are included. This is intended for use by beginning Java programmers, but includes suggestions for enhanced learning for more experienced Java programmers. Solutions are included.

Sorting Algorithm Project

Description: 
The present project will give students an opportunity to research, learn and compare 2 sorting algorithms and present their findings to their peers. The project is given to the students after they have learned about arrays, reading and writing to text files, and bubble sort. Two students’ projects are also included as an example to show to the class, or to be used for teaching.

Unit Testing

Description: 
For this lab students will take a previous program (SpellChecker from the Data Structures entry from Virginia Tech), learn how to develop test cases and develop techniques to use these cases to test the program. Thus students will hypothesize about program behavior and then experimentally verify their hypotheses.

Visual Sorting Demos

Description: 
This Java applet shows a variety of sorting methods, visually. It includes a small quiz where students can see if they can recognize a sort method from the pattern of the movement of the elements of the array. It’s online at http://mmhs.ca/compsci/applets.htm#Sorting. NOTE: A few applets may have incompatibilities with some browsers and/or platforms.
Subscribe to CC.L3C-01c