12CompSci

=ICS4U1: Grade 12 Computer Science=

Course Outline:



 * ** Unit 0 ** || ** Reintroduction to Programming in Java (4 Days) ** ||
 * || Java method format ||
 * || For loops ||
 * || While loops ||
 * || Arrays ||
 * || If statements ||
 * || Strings ||
 * || Scanner ||
 * || Primitive Types ||
 * || Assignment (Due Sept 21) ||
 * ** Unit 1 ** || ** Classes (8 days) ** ||
 * Sept 19 || Classes, instance variables, encapsulation ||
 * || Methods (accessor/ mutator), constructors ||
 * || Overloading methods ||
 * || Testing a Class ||
 * || Design UML/JavaDoc and algorithm based on problem specifications ||
 * || Assignment (**due Tues Oct 17 - beginning of class)** ||
 * || Review ||
 * Oct 13 || Test ||
 * || ** Evaluate Learning Skills (1 day) ** ||
 * ** Unit 2 ** || ** File IO/Arrays (10 days) ** ||
 * || Input/output ||
 * || Basic exception handling ||
 * || Review of Arrays ||
 * || 2D/3D Arrays (2 days) ||
 * || Arrays of Objects ||
 * || Algorithms with Arrays (eg multiply matrices, pixels in an image) ||
 * || Review ||
 * Nov 14 || Project + Quiz (2 days) ||
 * ** Unit 3 ** || ** Serching and Sorting (8 days) ** ||
 * || Sequential Search ||
 * || Binary Search ||
 * || Insertion Sort ||
 * || Selection Sort ||
 * || Bubble Sort ||
 * || Shell Sort ||
 * || Efficiency of Algorithms ||
 * || Test ||
 * ** Unit 4 ** || ** Recursion (8 classes) ** ||
 * Jan 8 || Recursion Concepts in Everyday life and Math ||
 * || Recursive Methods ||
 * || Recursive Methods 2, Efficiency ||
 * || Towers of Hanoi ||
 * || Searching and Sorting, Quick Sort ||
 * || Mergesort (AP only), assignment given out ||
 * || Review ||
 * Jan 29 || Test ||
 * || ** Topics in Computer Science Research Project (4 days) ** ||
 * || Analyze societal, environmental and ethical aspects of Computer Science ||
 * ** Unit 5 ** || ** Inheritance/ interfaces/ polymorphism (10 days) ** ||
 * || Interfaces ||
 * || Converting between Types, Casting (2 days) – start with primitives ||
 * || Polymorphism ||
 * || Inheritance (3 classes) ||
 * || Quiz and Larger Project (4 days) ||
 * || ** Introduction Summative project (1 day) ** ||
 * ** Unit 6 ** || ** Algorithms (9 days) ** ||
 * || Linked Lists ||
 * || Operations on Linked Lists ||
 * || Stacks and Queues (2 days) ||
 * || Binary Trees ||
 * || Binary Tree Search ||
 * || Other Algorithms (3 days) + Evaluation ||
 * || ** Summative Project Check-in (1 day) ** ||
 * ** Unit 7 ** || ** GUIs (9 days) ** ||
 * || Introduction to swing/JFrame etc. and Drawing Text ||
 * || Drawing Shapes ||
 * || Layout Manager ||
 * || Buttons ||
 * || Mouse Events ||
 * || Text Input and Output ||
 * || Make a GUI (3 days) ||
 * ** Unit 8 ** || ** Summative Project (8 days) ** ||
 * || EXAM REVIEW (3 days) ||
 * ** Total ** || ** 84 days, 2 days buffer ** ||
 * ** Unit 7 ** || ** GUIs (9 days) ** ||
 * || Introduction to swing/JFrame etc. and Drawing Text ||
 * || Drawing Shapes ||
 * || Layout Manager ||
 * || Buttons ||
 * || Mouse Events ||
 * || Text Input and Output ||
 * || Make a GUI (3 days) ||
 * ** Unit 8 ** || ** Summative Project (8 days) ** ||
 * || EXAM REVIEW (3 days) ||
 * ** Total ** || ** 84 days, 2 days buffer ** ||
 * || EXAM REVIEW (3 days) ||
 * ** Total ** || ** 84 days, 2 days buffer ** ||
 * ** Total ** || ** 84 days, 2 days buffer ** ||