• If you are citizen of an European Union member nation, you may not use this service unless you are at least 16 years old.

  • Stop wasting time looking for files and revisions. Connect your Gmail, DriveDropbox, and Slack accounts and in less than 2 minutes, Dokkio will automatically organize all your file attachments. Learn more and claim your free account.


ICS3C 2018-2019 Sem 1

Page history last edited by Steve Sweeney 1 year, 11 months ago



Introduction to Computer Programming, Grade 11

College Preparation

"This course introduces students to computer programming concepts and practices.  Students will write and test computer programs, using various problem-solving strategies.  They will learn the fundamentals of program design and apply a software development life-cycle model to a software development project.  Students will also learn about computer environments and systems, and explore environmental issues related to computers, safe computing practices, emerging technologies, and post-secondary opportunities in computer-related fields."


General Course Outline

Sequence 1
5 6 7








Strings pt2

(or Arrays)

Language: Turing Turing Turing Turing Turing Turing Turing


Summative Assignment

Date Topic Lesson Resources Exercises
Summative Assignment


see Edmodo


Unit 6: Arrays & Strings

Date Topic Lesson Resources Exercises
String Operations

Presentation - String Operations

VT - Strings in Turing (substrings)

Exercises - Strings

# 1, 2, 3, 5, 7, 10, 11, 15

String Operations

Presentation - String Subroutines

VT - Strings in Turing (substrings)

Exercises - Strings

  Assignment: Strings      

Arrays in Turing


Present: Intro to Arrays Sample Code Exercises - Arrays 

Strings as Arrays


Presentation - Strings as Arrays   Exercises - Strings # 1, 4, 3, 7, 8


Unit 5: Subroutines in Turing

Date Topic Lesson Resources Exercises

Intro to Subroutines

(also called Subprograms, Procedures)

Lesson - Method Basics Exercises: Basic Subroutines

Presentation - Procedures without Parameters

Summary - Procedures

Presentation - Procedures & Passing Parameters

VT - Intro to Procedures

VT - Passing Parameters into Procedures

procedure exercises  

Turing Lesson - Functions

Summary - Functions

VT - Functions
function exercises 
  Procedures vs Functions   VT - Procedures vs Functions  


Unit 4: Review & Improve Fundamental Concepts

  • While the ICS3U students switch from programming in Turing to Java, the ICS3C students will work on another programming assignment.
  • This assignment will focus on IPO, IF/ELSE, and LOOPS.
  • see Edmodo for assignment description.


Unit 3: Repetition (Loops)

Counted Loops
  1. Lesson - Counted Loops
  2. Use video tutorial to clarify lesson
  3. counted loop exercises
  4. more counted loop exercises
VT - Counted Loops

Conditional Loops

  1. Lesson - Conditional Loops 
  2. use video tutorials & code examples as support
  3. Exercises - Conditional Loops
  1. VT - Loops with Exit Condition at Beginning
  2. VT - Loops with Exit Condition at End
  3. Code Examples - Conditional Loops

Nested Loops

(loops within loops)

  1. Lesson - Nested Loops
  2. counted loop exercises # 4, 6
  3. more counted loop exercises # 5
  4. Conditional Loops Exercises # 2, 3
VT - Nested Loops (loop within another loop)
Random Values
  1. Presentation - Random Values
  2. Random Values Exercises
Assignment - Loops   Turing - Java Cheatsheet


Unit 2 - Programming in Turing - Selection (IF/ELSE)

Date Topic
Activity ~ Classwork ~ Homework Resources


Simple Selection using If/Else

(one or two pathways)

  1. Presentation - Simple If/Else Statements
  2. Exercises - Simple Decisions Part A # 1, 2, 3

Complex Selection:


(three or more pathways)

  1. Presentation - Nested Selection Statements
  2. Exercises - Selection Part B
Logical Operators
  1. Presentation - Logical Operators
  2. Exercises - Selection Part B
    (try Part C if done Part B)
VT - AND/OR Logical Operations
Boolean Variables Presentation - Boolean Variables VT - Boolean Variables with Logical Operators
Assignment - Selection see Edmodo


Unit 1 - Programming in Turing - Input Processing Output (IPO):

Date Topic
Activity ~ Classwork ~ Homework Resources


  1. Introduction to Course
  2. File Organization & History
  3. Turing Programming Environment
  4. Edmodo
  1. Presentation - Introduction to Course
  2. Read [Note - File Organization & History] and setup your file structure
  3. Read [Note - Install Turing] and install the Turing IDE
  4. Register for Edmodo and connect to course
  5. Finished? Try an activity from the Hour of Code.
  6. Finished? Try the Lightbot programming/logic game.


Creating Your First Programs

- output simple text to the screen

  1. Presentation - Intro to Programming in Turing
  2. Complete as many [Output Exercises] as possible, submit to Edmodo
  3. If all exercises complete, look ahead to next lesson

[Note - First Program & Output]

[Video - Simple Output in Turing]


Adding Variables & User Input

- interactive programs

  1. Presentation - Input 
  2. Work [Input Exercises

[Note - Data Types]

[Note - Variables]

[Note - Changing Variables]

[Video - Input & Variables] 

[Video - Variables & Data Types]


Performing Calculations
  1. Presentation - Calculations & Assigning Values
  2. Exercises - Calculations
[Video - Input & Variables]
Work Period
  • catch up on lessons & exercises so far
  • submit completed exercises to Edmodo
  • ask for help where necessary
  • be prepared to show your progress and answer questions
Math Contest Programming Problems
Mathematical Functions
  1. Presentation: Mathematical Functions
  2. Exercises: Mathematical Functions
Constants & Initial Values
  1. Presentation: Constants & Initial Values
  2. Try to complete any previous exercises

Advanced Output & Formatting

(includes rounding)

  1. Presentation: Advanced Output
  2. Some difficult exercises may be possible now. Try them again.


Assignment - IPO
  • see Edmodo


All Turing Lessons








  1. Reduce any numerators with any denominator

  2. Multiply (reduced) numerators

  3. Multiply (reduced) denominators

  4. Reduce if possible (if previous steps done perfectly, will not be necessary)

Comments (0)

You don't have permission to comment on this page.