hts.StevenWood.com

ICS4U - Term 1 - Michaelmas

Home ] Up ] [ Michaelmas ] Lent ] Trinity ][ Last Page ]

Check the Late Submissions policy .  

Class #

Odd Day

Even Day

Preview
(Print out and review these before class)
Topics Homework
1

Sept 4

 

Getting the software:

Designing and Implementing Data Structures (Unit 1)
Reviewing Fundamental Data Structures and Algorithms
(Activity 1-1)

  • Application basics
    • classes
    • methods - String (use at least 3) / Math (use at least 3) / main
    • keyboard input
    • menus
    • displaying
    • import
    • comments
  • Data & Operators
    • variables
    • converting types
  • Control Structures
    • for / do / while
    • if
  • Install Java & JCreator / NetBeans
  • Although some time will be given next class, work on review assignment.
2

Sept 6

  Designing and Implementing Data Structures (Unit 1)
Reviewing Fundamental Data Structures and Algorithms
(Activity 1-1)
  • Complete review of topics given in previous lesson
  • Based on the review topics, EACH student creates 25 review questions as follows. Give the SOLUTIONS for the questions as well!
    • 5 definition / give example questions
      e.g. What is a condition?
    • 5 multiple choice questions (4 options)
    • 5 ask for the correct line of code questions
      e.g. Correct the following line of code:
      Public void static main {string () arg }
      Correction:
      public static void main (String[] arg )
       
    • 5 short program sections
      e.g. Give the for loop that will...
    • 5 fill in the blank
 
3

Sept 10

How to get a random number Reviewing Fundamental Data Structures and Algorithms (Activity 1-1)
  • Take the FORMATIVE Review of ICS3U Quiz AT LEAST ONCE (Blackboard -> Content -> Unit 1: Designing... -> Review of ICS3U -> FORMATIVE Review Test of ICS3U)
  • Game of Craps
    rules, logic for one run
 
4

Sept 12

Breakaway    
5

Sept 16

  Reviewing Fundamental Data Structures and Algorithms (Activity 1-1)
  • once basic game is completed:
    • add some wagering: start with $1000, can bet up to balance of cash, loses -> subtract bet, wins-> add bet.
    • add messages to the game:
      bank balance = 0: "Sorry. You busted!"
      random messages: "you're going for broke!"; "c'mon, take a chance!"; "quit while you're ahead!"; etc.
    • build a version of the game that will run 10 times on its own and keep track of number of wins and losses

6

Sept 18

Core Array resources:
Chapter 46 

Introduction to Arrays

 

Chapter 47 Common Array Algorithms
 

Extra resources:

Chapter 48  Arrays as Parameters
Chapter 49A Methods that Change Arrays
  • Programming Exercises (none)

Using Data Storage Methods (Activity 1-2)

  • Review for Arrays:
  1. Provide a WRITTEN answer (use Word or NetBeans) for each of the following. You MAY need to look at the resources (Chapters 46 & 47) to the left.
    • definition "array" & give an example of one in real life
    • declare an array - what are the default values?
    • use an initializer list
    • fill an array with values
    • display values (use a loop)
    • find the largest or smallest values (use a loop)
    • sum the values  (use a loop)
  2. Take the Blackboard FORMATIVE test on arrays AT LEAST ONCE (Blackboard -> Assignments -> Review of ICS3U -> ICS3U Concept Review of Array Formative Test)
  3. create a program that will create an array, fill it with numbers - use some random numbers AND numbers entered in from the keyboard by the user, display it, find the minimum and maximum values, and the sum of the values
  4. extra practice Array Questions
 
7

Sept 20

Chapter 49C 

Two-dimensional Arrays

Using Data Storage Methods (Activity 1-2)

  • two dimensional arrays  2 dimensional arrays PowerPoint

  • MarkBook.java

  • Question 1
    • create a 2-d array 4 x 3
    • fill each element with random number
    • print out array
    • find which row has the highest total
    • find which row with the lowest number

  • Question 2
    • create random text
    • create a program that will create a 2-d array, fill it with 5-10 letter words,
    • display it,
    • find the first and last words values, and
    • the number of letters and average word length
 
8

Sept 24

 

Reviewing Fundamental Data Structures and Algorithms (Activity 1-1)

  • TEST! on review material
    (not arrays)

Using Data Storage Methods (Activity 1-2)

  • complete unfinished work

Tool or Master (Unit 2)

Computer Science in the News (Activity 2-1)

Education & Careers (Activity 2-3)

  • educational opportunities in computer science
  • Activity and Rubric
  • make a presentation (Dec 3)
  • send e-mail with your career choices
  • Work period
 
9

Sept 26

  Designing and Implementing Data Structures (Unit 1)
Windows Applications
(Activity 1-3)
 
10

Sept 30

  Windows Applications (Activity 1-3)  
11

Oct 2

Java API (Application Programming Interface)Index Windows Applications (Activity 1-3)  
12

Oct 4

Java API (Application Programming Interface)Index Windows Applications (Activity 1-3)  
13

Oct 8

Java API (Application Programming Interface)Index

Using Data Storage Methods (Activity 1-2)

  • Test on arrays

Windows Applications (Activity 1-3)
  • using an anonymous inner class
  • using JOptionPane.showMessageDialog()
  • getting user input from pop-up window
 
14

Oct 10

  Windows Applications (Activity 1-3)
  • Here is the in-class assignment
    (hidden units/1/activity4/inclass2_1.gif hidden)
 
15

Oct 16

  Applet Building (Activity 1-4)

 

 
16

Oct 18

 

Applet Building (Activity 1-4)  
17

Oct 22

  Applet Building (Activity 1-4)  
18

Oct 24

  Applet Building (Activity 1-4)  
19

Oct 28

  Working With Files (Activity 1-5)  
20

Oct 30

  Working With Files (Activity 1-5)  
21

Nov 1

Tool or Master (Unit 2)
Computer Science in the News
(Activity 2-1)

 
22

Nov 5

   
23

Nov 7

  Designing and Implementing Data Structures (Unit 1)
Creating Disk Files (Activity 1-6)
 
24

Nov 13

  Creating Disk Files (Activity 1-7)  
25

Nov 15

Chapter 49B Arrays of Objects and Linear Search
What are sorting Algorithms?

Sorting Algorithms in Action

Step through a sort

Interested in the theory of sorting?

Creating Disk Files (Activity 1-7)

Exploring Advanced Algorithms (Unit 3)
Sorting Arrays
(Activity 3-2)

 
26

Nov 19

How do I… Perform date/time arithmetic with Java’s Calendar class?  Sorting Arrays (Activity 3-2) sorting
27

Nov 21

 

Searching Arrays (Activity 3-3)

 
28

Nov 25

 

Searching Arrays (Activity 3-3)

  • Searching: compare 2 types of sorting to measure searching efficiency (Bench mark: how many comparisons and time)

  • How to get a random number

 
29

Nov 27

  Creating Disk Files (Activity 1-7)  
30

Nov 29

  Creating Disk Files (Activity 1-7)  
31

Dec 3

  Creating Disk Files (Activity 1-7) IT Strategies: Towards Stewardship, and Sustainability (Activity 2-4)  
32

Dec 5

 

Exploring Advanced Algorithms (Unit 3)
Sorting Arrays
(Activity 3-2)

 

  • Searching: use search code to measure efficiency (Bench mark: time taken to sort, number of comparisons)
  • Exercise 3-3-1b
 
33

Dec 9

  Tool or Master (Unit 2)
Education & Careers
(Activity 2-3)
  • presentations submitted today

IT Strategies: Towards Stewardship, and Sustainability (Activity 2-4)

 
34

Dec 11

  IT Strategies: Towards Stewardship, and Sustainability (Activity 2-4)
  • Work period - report to class first
 
35

Dec 13

  IT Strategies: Towards Stewardship, and Sustainability (Activity 2-4)
  • Work period - report to class first
 
36

Dec 17

  IT Strategies: Towards Stewardship, and Sustainability (Activity 2-4)
  • Work period - report to class first
 
37

Dec 19

  IT Strategies: Towards Stewardship, and Sustainability  (Activity 2-4)
  • Presentations
  • Group report due
 
    Movie assignment  
 
  • How to use the HTS computer system
  • HTS Expectations for students
  • The Problem With Software
 

 
Visitor:

Home ] Up ] [ Michaelmas ] Lent ] Trinity ][Last Page]
All material on this site is copyright © 1997- by Steven Wood or as credited. All right reserved. Use of this site indicates you agreement with the  terms of use.
Send comments or questions to about this page.
Every attempt has been made to credit work under copyright. If there are any claims that copyright has been missed please contact the .
+SDG+