Difference between revisions of "IB Computer Science 1"

From WLCS
Line 1: Line 1:
 +
== 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
 +
* Draft Criterion A of [[Internal Assessment]] due Monday (5/4/15)
 +
** Submit via Google Classroom
 +
 
== Monday - Thursday (4/20/15 - 4/23/15) ==
 
== Monday - Thursday (4/20/15 - 4/23/15) ==
 
'''Agenda:'''
 
'''Agenda:'''

Revision as of 07:12, 27 April 2015

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
  • Draft Criterion A of Internal Assessment due Monday (5/4/15)
    • Submit via Google Classroom

Monday - Thursday (4/20/15 - 4/23/15)

Agenda:

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:

Tuesday (4/7/15)

Agenda:

Archives