ICS4U

Computer Science, Grade 12

University Preparation

Prerequisite Course(s): ICS3U

Reading & Writing Objects to Files (Stack Overflow)

VT - Writing Objects to a File (~11 minutes)

VT # 2 - Writing Objects to a File (~ 20 minutes)

• Create a recursive program to solve ToH
• allow the user to specify number of plates

Algorithm - Tower of Hanoi

1. move n−1 discs from A to B. This leaves disc n alone on peg A
2. move disc n from A to C
3. move n−1 discs from B to C so they sit on disc n

VT - Recursion 

VT - Recursion (factorial)

• create a "MySort.java" class
• create class methods for each sorting algorithm
• start with each method sorting an array of integers

Shell Sort

(faster, more complex)

Note: Shell Sort

Sorting Arrays:

Basic Methods

1. 01 Insertion Sort
2. 02 Selection Sort
3. 03 Bubble Sort

• Visual Representation of Sorting Algorithms
• Another Visual Sorting Page
• Yet Another Visual Sort
• Another Sort

Assignment:

Chess Piece Attack

Design & Implement Monkey Gardeners

• using a procedural approach
• using an object-oriented approach
• work alone or collaboratively

1. Presentation - Working with Arrays
2. Continue with Exercises - Arrays

• VT - Using Array Elements as Counters (frequency table)
• Array Coding Example
  (see later examples for dynamic sizing)

1. Java Arrays - Intro
2. Exercises - Arrays

• VT: Introduction to Arrays
• Sample Code - Arrays
• Note - Basic Arrays

Unit 4:

Arrays in Java

VT - Public & Private in Java

VT - Set & Get Methods

1. View Tutorial (aligned with note).
2. Read through note.
3. Exercises at end of note.

VT - Constructor Methods

VT - Overloading Constructors

1. VT: Instance Methods
2. Note: Instance Methods

1. VT: - Introduction to Classes & Objects
2. Note - Creating Objects
3. Exercises (attached to Note)

1. Presentation - Working with Arrays
2. Continue with Exercises - Arrays

1. Java Arrays - Intro
2. Exercises - Arrays

• VT: Introduction to Arrays
• Sample Code - Arrays
• Note - Basic Arrays

1. Presentation - Method Overloading
2. Note - Method Overloading
3. Exercises - see Note

1. Presentation - Review Methods
2. [Exercises - Subroutines no Parameters] #5
3. [Exercises - Subroutines with Parameters] #A2, B1, B3
4. [Exercises - Functions] #2, 3, 4

Assignment - Review Concepts

• IPO
• Selection (if/else, case)
• Repetition (counted & conditional loops)

Presentation: Modulo in Java

Exercises: Modulo # 4, 5, 9

S10

S09

S08

Review Java Concepts

• input & output
• variables & calculations
• selection (if/else)
• repetition (loops)

Review Exercises:

• Input-Processing-Output # 3+4, 6, 7, 8
• Selection # A3, B3, B4, B7, C3 or C4 
• Counted Loops Part 1 # 2, 3e, 4, 6ab
• Conditional Loops # 2, 3, 6abc

1. Look over the materials at [Java Lessons - Fundamentals]
2. Start working on associated exercises

Tue

S08

1. Introduction to Course
2. File Organization & History
3. Java Programming Environment
4. Edmodo

1. Presentation - Intro to ICS3C/3U/4C/4U
2. Read [Note - File Organization & History] and setup your file structure
3. ReadNote - Install Dr.Java and install the Dr.Java IDE
4. Register for Edmodo and connect to course