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

  • Social distancing? Try a better way to work remotely on your online files. Dokkio, a new product from PBworks, can help your team find, organize, and collaborate on your Drive, Gmail, Dropbox, Box, and Slack files. Sign up for free.

View
 

ICS3C 2016-2017 S1

Page history last edited by Steve Sweeney 3 years, 4 months ago

 

ICS3C

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
2
3
4
5 6

Topic:

Input/Processing/Output

Selection

(IF/ELSE)

Repetition

(Loops)

Strings
Subprograms Projects
Language: Turing Turing Turing Turing Turing Turing

 

All Turing Lessons

Unit 5: Subroutines in Turing

Date Topic Lesson Resources Exercises
 
Summative Project  

Game Ideas by Theme/Difficulty

 
N14

Intro to Subroutines

(also called Subprograms, Procedures)

Lesson - Method Basics Exercises: Basic Subroutines
N17
Procedures

Presentation - Procedures

Summary - Procedures

Presentation - Using Procedures to Simplify Programs

VT - Intro to Procedures

VT - Passing Parameters into Procedures

procedure exercises  
N21
Functions

Turing Lesson - Functions

Summary - Functions

VT - Functions
function exercises 
  Procedures vs Functions   VT - Procedures vs Functions  
  Random Values Presentation - Random Values   random value exercises
  Boolean Variables   VT: Boolean Values & Variables  

 

Unit 4: Arrays & Strings

Date Topic Lesson Resources Exercises
O26
Arrays in Turing Present: Intro to Arrays Sample Code Exercises - Arrays # 1, 2
O27
Strings as Arrays Presentation - Strings as Arrays   Exercises - Strings # 1, 4, 3, 7, 8
O28
String Functions & Procedures Presentation - String Subroutines VT - Strings in Turing (substrings) Exercises - Strings

 

Case Study # 1 - TicTacToe

Date Topic Assigned Work Additional Resources

O20

O21

Design: TicTacToe

(using IPO, if/else, loops)

see Edmodo for sample program
 

O24

O25

Implement: TicTacToe    

 

Unit 3: Repetition (Loops)

O02 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
O03

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
O04

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)
O11
Random Values
  1. Presentation - Random Values
  2. Random Values Exercises
 
 
Assignment - Loops   Turing - Java Cheatsheet

 

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

      Turing Selection Lessons
Date Topic
Activity ~ Classwork ~ Homework Resources
S19

Introduction:

Simple Selection using If/Else

(one or two pathways)

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

Complex Selection:

Nested IF/ELSE, ELSE IF

(three or more pathways)

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

Optional:

CASE Statements

see Turing Help
 
 
Work Period    
 
Assignment - Selection see Edmodo
 

 

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

Date Topic
Activity ~ Classwork ~ Homework Resources

Tue

S06

  1. Introduction to Course
  2. File Organization & History
  3. Turing Programming Environment
  4. Edmodo
  1. Presentation - Intro to ICS3C/3U/4C/4U
  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 the Lightbot programming/logic game.

Wed

S07

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 tomorrow

[Note - First Program & Output]

[Video - Simple Output in Turing]

Thurs

S08

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]

Fri

S09

Performing Calculations
  1. Presentation - Calculations & Assigning Values
  2. Exercises - Calculations
[Video - Input & Variables]
S12 Mathematical Functions
  1. Presentation: Mathematical Functions
  2. Exercises: Mathematical Functions
 
S13 Constants & Initial Values Presentation: Constants & Initial Values  
S14

Advanced Output & Formatting

(includes rounding)

Presentation: Advanced Output  

S15

S16

Assignment - IPO
  • see Edmodo
 

 

 

Multiplication

 

  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.