For those who need a little bit of extra exploration, or some diversion for the summer, or just a little bit of fun, go to this site and fool around with the different chatbots on this site.
http://www.chatbots.org/
If you think this is neat, you might like this article.
http://www.themarysue.com/siri-chats-with-eliza/
I hope you're having a good summer. I am.
Thursday, June 19, 2014
Monday, April 21, 2014
Tentative AP Review Schedule
Check back for any changes:
Tuesday, 4/22 - AM: MC
PM: FRQ
Wednesday, 4/23 - AM: MC
Friday, 4/25 - AM: FRQ
Monday, 4/28 - PM: FRQ
Tuesday, 4/29 - AM: MC
PM: FRQ
Wednesday, 4/30 - AM: MC
Friday, 5/2 - AM: FRQ
PM: MC
Saturday, 5/3 - 1:00 Practice Test
Monday, 5/5 - AM: Questions
PM: Last Minute Questions
Tuesday, 5/6 - The Big Day!
Tuesday, 4/22 - AM: MC
PM: FRQ
Wednesday, 4/23 - AM: MC
Friday, 4/25 - AM: FRQ
Monday, 4/28 - PM: FRQ
Tuesday, 4/29 - AM: MC
PM: FRQ
Wednesday, 4/30 - AM: MC
Friday, 5/2 - AM: FRQ
PM: MC
Saturday, 5/3 - 1:00 Practice Test
Monday, 5/5 - AM: Questions
PM: Last Minute Questions
Tuesday, 5/6 - The Big Day!
Wednesday, April 2, 2014
Test # 5 Review for Accelerated Math III
Answers to today's review in Accelerated III can be found below. Don't forget to find some word problems to review, as well.
https://drive.google.com/file/d/0B2XYF8oNHClQcERSZTFxSkxRS1k/edit?usp=sharing
https://drive.google.com/file/d/0B2XYF8oNHClQcERSZTFxSkxRS1k/edit?usp=sharing
Monday, March 31, 2014
APCS Test # 5 Review stuff
I have made a folder in Drive for the Test 5 review materials, including the keys.
Wednesday, March 26, 2014
APCS Quiz # 8 Free Response
//this
method will return the sum of all even numbers(except 8) in array
public
int evenSumMinusEight(int[] array)
{
int sum=0;
for(int i=0; i<array.length;i++)
{
if(array[i]!=8&&array[i]%2==0)
sum=sum+array[i];
}
return sum;
Write
the LotteryTicket method search(), as started below. search() will receive an
integer and determine if that integer is contained in the array instance
variable numberList.
Assuming numberList
contains [1,2,3,4,5,6,7,8,9.10]
The call search(34)
would return false
as
34 is not contained the list.
The call search(3)
would return true
as
3 is contained the list.
The call search(4)
would return true
as
4 is contained the list.
/** @param
val is a positive non-decimal value
* Precondition
: val >= 1 and val <= 50
* @return true if val is contained in numberList
*
@return false if val is not contained in numberList
*/
private boolean search(int val)
{
for(int item : numberList)
{
if(item
== val)
return true;
}
return false;
}
Tuesday, March 25, 2014
Assignments Update
There is an update in the Google Drive regarding everything that has been assigned throughout the semester in APCS.
Thursday, March 20, 2014
Free Response Hint for Friday's APCS Quiz
//this
method will return the number of numbers in array
//that
are less than the number 20
public
int lessThanTwentyCount(int[] array)
{
int count=0;
for(int spot=0; spot<array.length;
spot++)
{
if(array[spot]<20)
count++;
}
return count;
}
Subscribe to:
Posts (Atom)