Month: October 2016

We will meet in the board room at 25N at 5:45 tonight.

Tonight’s Agenda:

• Welcome & Introductions for anyone new tonight
• Breifly review
  • Variables
  • Loops – specifically infinite loops!
  • Conditionals
  • Procedures
• Sample AP Exam Question: We will analyze Sample Question #17 for the AP Computer Science Principles Course and Exam shown below.
• Let’s see if we can build our own infinite loop in Scratch.

#17. Consider the following program code:

i = 0
sum = 0

REPEAT UNTIL i = 4
{
   i = 1
   sum = sum + i
   i = i + 1
}

Which of the following best describes the result of running the program code?

a) The number 0 is displayed
b) The number 6 is displayed
c) The number 10 is displayed
d) Nothing is displayed; the program results in an infinite loop.

Not sure what the answer is? Play the Scratch project!

This Scratch Project brings to life Sample Question #17 for the AP Computer Science Principles Course and Exam Description.

https://scratch.mit.edu/projects/127025645/

We will meet in the board room at 25N at 5:45 tonight.

Tonight’s Agenda:

• Welcome & Introductions for anyone new tonight
• Focus on the key concept of Procedures
  • Break a project into manageable units of work
  • Create reusable code blocks that are unit testable
  • Make your program’s code more readable; easier to follow the logic
• Develop an algorithm together to solve a problem
• Look at pseudocode; how does it help with the initial approach to problem solving
• How do we break down the terms used in pseudocode into code blocks to be implemented?
• Sample AP Exam Question: We will analyze and develop a programmatic solution to Sample Question #8 for the AP Computer Science Principles Course and Exam shown below:

The program segment below is intended to move a robot in a grid to a gray square. The program segment uses the procedure GoalReached which evaluates to true if the robot is in the gray square and evaluates to false otherwise. The robot in each grid is represented as a triangle and is initially facing left. The robot can move into a white or gray square but cannot move into a black region.

REPEAT UNTIL (GoalReached ())
{
IF (CAN_MOVE (forward)){MOVE_FORWARD()}
IF (CAN_MOVE (right)){ROTATE_RIGHT()}
IF (CAN_MOVE (left)){ROTATE_LEFT ()
}

Notes for tonight’s meeting: Introduction to procedures FVGCC

We will meet in the board room at 25N at 5:45 tonight.

Tonight’s Agenda:

• Welcome & Introductions
• What are some key concepts of computer science that we will learn?
• Intro to Scratch – https://scratch.mit.edu/ 
  • Intro to Scratch
• Makey Makey – https://youtu.be/rfQqh7iCcOU
• Sample AP Exam Question

#10. Consider the code segment:

IF [onTime]
   DISPLAY "Hello."
ELSE
   IF [absent]
      DISPLAY "Is anyone there?"
   ELSE
      DISPLAY "Better late than never."

If the variables onTime and absent both have the value false, what is displayed as a result of running the code segment?

a.) Is anyone there?
b.) Better late than never.
c.) Hello. Is anyone there?
d.) Hello. Better late than never.

Check out this fun Scratch Project to help illustrate the answer!

https://scratch.mit.edu/projects/95239704/

See you at tonight’s meeting!