Difference between revisions of "IB Computer Science 1"
From WLCS
| Line 1: | Line 1: | ||
| + | == Friday - Tuesday (5/1/15 - 5/4/15) == | ||
| + | '''Agenda:''' | ||
| + | * Demo your Java port of the Benford's Law program | ||
| + | * Draft Criterion A of [[Internal Assessment]] due Monday, Tuesday (5/4/15, 5/5/15) | ||
| + | ** Submit via Google Classroom | ||
| + | |||
== Tuesday - Thursday (4/28/15 - 4/30/15) == | == Tuesday - Thursday (4/28/15 - 4/30/15) == | ||
'''Agenda:''' | '''Agenda:''' | ||
Revision as of 07:32, 4 May 2015
Contents
Friday - Tuesday (5/1/15 - 5/4/15)
Agenda:
- Demo your Java port of the Benford's Law program
- Draft Criterion A of Internal Assessment due Monday, Tuesday (5/4/15, 5/5/15)
- Submit via Google Classroom
Tuesday - Thursday (4/28/15 - 4/30/15)
Agenda:
- Port your Benford's Law program to Java and demo to Mr. Bui
- Elevator pitch your Internal Assessment idea
- Draft Criterion A of Internal Assessment due Monday (5/4/15)
- Submit via Google Classroom
Friday - Monday (4/24/15 - 4/27/15)
Agenda:
- Demo 2-player Hangman (1 person types in a secret word and other person plays)
- Demo 1-player Hangman (Add a text file of secret words to you game)
- Port your Benford's Law program to Java and demo to Mr. Bui
- Elevator pitch your Internal Assessment idea
- Draft Criterion A of Internal Assessment due Monday (5/4/15)
- Submit via Google Classroom
Monday - Thursday (4/20/15 - 4/23/15)
Agenda:
- Demo Hangman
- Java Reading Files
- Add a text file of secret words to your Hangman game
- Port your Benford's Law program to Java
- Internal Assessment
- Begin thinking about Criterion A and what you would like to do for your Internal Assessment
Monday - Friday (4/13/15 - 4/17/15)
Agenda:
- After-Hours Study Night @ Central Library - Sunday, May 3rd, 2015
- Free pizza, snacks, and coffee
- Make sure you've completed CodingBat Arrays 1 & 2 (3 exercises from each)
- Complete and demo Hangman
- Hangman Hints:
- Use the String's indexOf(char ch) method to find out if a character is in a String. indexOf() will return -1 if it is not found
- To find out if you've won, count the number of underscores left in the reveal word. If there are none, then you've won
- For random words, create an explicit array of Strings of your choice. Generate a random number between 0 and the length of the String, and select your random word from that
Wednesday - Friday (4/8/15 - 4/10/15)
Agenda:
- Java Arrays
- Media:JavaArrays Basic.ppt
- Complete 3 exercises from CodingBat - Array-1
- Complete 3 exercises from CodingBat - Array-2
- Work on Hangman
Tuesday (4/7/15)
Agenda:
- for loop review
- Java Arrays
- Media:JavaArrays Basic.ppt
- Complete 3 exercises from CodingBat - Array-1
- Complete 3 exercises from CodingBat - Array-2
