Course Overview
- Syllabus
- University in the High School Program - Registration Link | Detailed Course Outline
Our course # is I CSI 201: Introduction to Computer Science

- Handout books
- Create Server Structure (cpp1/karel)
- Read pages 1 to 5 in Karel++
- Answers questions on pages 5 and 6
- Dive into the world of Karel
- Watch a Karel Demo
- Experiment with Karel: Creating worlds; running programs

[We will make firstDay.kpp and firstDay.wld]

Open up Karel++
In Karel++, load your firstDay.kpp and the world that you made, run them.

Open CodeBlocks. We will discuss comments (documentation) and entering code.
Review the capabilities of our robot.

Open text to page 22 and do problem 5 together. The world.

Read Chapter 2.

• Do problem 6 on page 22 working with your neighbor. 2.6 World
• Discuss problems 1 and 2 (from page 20)
• Do exercises 1 and 2 in Chapter 2. (p. 20) ON GRAPH PAPER
• Look at exercise #8 on page 24 and come up with two ways for doing the task. Draw a sketch/make a plan - do with your neighbor.
  
• Look at your algorithms for p. 24: #8 and how loops may be used.
• Complete your program by typing in the code. Call me over to see your code and its execution.
• Extra Credit - p. 24: #9

• Read 3.1 through 3.5 (p. 25-35) and do p. 62: 1 (in UltimateRobot) and 2 (in 62_2)
• Continue work on 24.8
• Discuss extending the Robot's vocabulary
• Start creation of the Ultimate_Robot

• A quick glance at the rest of chapter 3.
• Discuss Style and Documentation
• indentation, white space, case issues
• comments, meaningful identifiers
• Finish exercise 8 on page 24 and get it checked.
• Read 3.6 through 3.9 (pages 35 to 53) and do 1(3) on p. 62
  -----> You are to make your own task block for the Harvester Situation (page 38.) that is different from their task block on Page 47d
• Complete the task block for #5 on page 63 on PAPER.
• Go over problem 1 on page 62
• Work on page 24 #9 [extra credit]
• Discuss Stepwise Refinement as a class
  

Where we have been/what you SHOULD already have done or are finishing today:
- You finished page 62, problems 1 and 2
- You Read 3.6 to 3.9 in our text
- Complete the task block for #5 on page 63 on PAPER.

NEW FOR TODAY (or a continuation)

- Go over the Sample Class handout
- Discuss Stepwise Refinement as a class.
- Look at problem 62_4 and do the Harvester Worksheet.
-Complete the Karel Vocabulary worksheet, defining all words that appear on or before page 62.
- Rework 24-8 extending the ur_Robot with new instructions - your task block should have <= 10 lines.
- Read pages 53-61

Where we have been/what you SHOULD already have done:
- We discussed Stepwise Refinement as a class.
- You finished page 62, problem 1, parts 1 and 2.
- You Read 3.6 to 3.9 and did problem 1 part 3 on p. 62
- You completed the Harvester Worksheet and are programming it
- You have (or will very soon) finish reading chapter 3 (pages 52 to 61)

NEW FOR TODAY (or a continuation)

- QUIZ #1
- Complete the Karel Vocabulary worksheet, defining all words that appear on or before page 62.
- Rework 24-8 extending the ur_Robot with new instructions - your task block should have <= 10 lines.

- Read problem 64_11 (page 64, ex 11). On a sheet of paper, write out your plan to solve the problem. Include a sketch as well as the task block with the names of the methods you will create. Show it to me, then you can do it! :)

- Extra Credit: 24_9, 62_2, 64_9

Where we have been/what you SHOULD already have done:
- Completed the Karel Vocabulary worksheet.
- Taken the Quiz (Kissane and Tate need to complete the quiz.)

NEW FOR TODAY (or a continuation)
- Read (if you didn't last night) pages 69-80: conditional expressions and predicates (instructions that return true or false
- We will have the Harvester Race later in class today

working on..
- do problems 1 and 2 on page 95 ON PAPER.
- Rework 2.8 extending the ur_Robot with new instructions - your task block should have <= 10 lines.
- Read problem 3.11 (page 64, ex 11). On a sheet of paper, write out your plan to solve the problem. Include a sketch as well as the task block with the names of the methods you will create. Try to be efficient/fast/use few instructions.
(new: Read pages 80-89, do page 95, problems 3 and 4.)

NEW FOR TODAY (or a continuation)
- Discuss pages 69-80: IF/ELSE STATEMENTS
--- There is a short Powerpoint on this.
---Create the IAmRich() predicate
- Read pages 80-89, do page 95, problems 3 and 4.

working on..
- Do problems 1 and 2 on page 95 ON PAPER.
- Rework 2.8 extending the ur_Robot with new instructions - your task block should have <= 10 lines.
- Read problem 3.11 (page 64, ex 11). On a sheet of paper, write out your plan to solve the problem. Include a sketch as well as the task block with the names of the methods you will create. Try to be efficient/fast/use few instructions.

Where we have been/what you SHOULD already have done:
- You should have done 1-4 on page 95.
- You should have read problem 3.11 (page 64, ex 11) and successfully completed it.

Today...
- Go over 3 and 4 on page 95.
- Look at page 79 faceNorth() - we must understand this!
- Discuss loop/while (look at page 101-105)
- Continue your work on Robot Antics
- When done with Robot Antics, read pages 89-94 and complete 95.5 and 96.7.
- Extra Credit: 97.9, 99.12

- A first look at recursion. (Test this code on your own. I will give a handout next class.)

GENERAL PLACE OF WHERE WE ARE

- Continue your work on Robot Antics
- When done with Robot Antics, read pages 89-94 and complete 95.5 and 96.7.
- Extra Credit: 97.9, 99.12

NEW FOR TODAY
- (Recursion Handout) | Recursion
- Work on whatever you are currently doing. :)

**PAPERWORK for University in the HS Course**

WORK DAY --> Get caught up!
Create the Racer robot (based upon page 81 of the text)
- Write a TASK BLOCK to show the final situation in Figure 4.2
- Once that works, create a NEW class called Steeplechaser that extends Racer
- Write a TASK BLOCK in Steeplechaser to solve Figure 4.5 on page 96
- Take a look at nested IF statements and simplifying conditionals
- Read 101-116 and do p. 134, 1-4

WORK DAY

Show me your Steeplechaser.
Show me 1-4 on page 134.

--------------------------------------------
FINAL KAREL ASSIGNMENTS

COMPLETE at least TWO of these problems.
For each problem, make a plan and use stepwise refinement to write the task block and new instructions.

* 138.11
* 140.15
* 143.19
* 144.23
* 145.25

WRITTEN TEST ON FRIDAY, Programming Test next Tuesday. Then we start C++.

(Happy 10th Month Birthday Mr. Merlis)
--- Klapper Info for UHS
--- Karel Assignment Info [due tomorrow]
- Return the Karel Final Exams and go over them
- Begin C++ | Handout #1

= Create our C++ Server Structure
= Discuss setting up projects in CodeBlocks

Interest Feed for Advanced Computing
Handout #2

• Discuss handout #2
• Experiment with loop structures
• Begin Assignment 2a --> PSEUDOCODE TOGETHER
• Random Number files: rando.cpp | rando.h
• You should finish assignment 1b on your own time.
  

DO NOW (Do immediately)

You should have the complete pseudocode for Assignment 2a (Quadrant Program)
- Program it! Pseudocode
- Show it to me when done.

Complete program 2b - do NOT do 2c yet (we haven't created the PointClass yet)
Do EC 2d if you have time.
# Move on the Note Sheet #3 [get from me]
# Begin assignments on Sheet #3

START CLASS WITH: Powerpoint on Data Types and Control Structures

Turkey Handout

Finish C++ Assignments UP to 3a

You don't have to do the extra credit.

DO NOW: Complete this activity on a clean sheet of paper.
- On the top right of your sheet, write the date and Class #28
- Include the heading "Check-up #1" in the center

Finish the min method

Examine CRectangle
# Create a new folder in your cppCode folder called "pointClass"

* Create a new project called pointClass in that folder
* Create a new .cpp file called "pointClass.cpp"
* We will be working with classes today

Create the actual PointClass

Create
- point.h
- point.cpp

Examine header files and how to include them.
All implementations for the functions in this header file should be completed today.

# Add methods to the Point Class
* void shift(int x1, int y1) // add those values to x, y in the class
* void dilate(int scale) // multiply x,y by scale

Test these in your main method by writing calls to them and then calling printPoint() to see if they worked.

• THEN CONTINUE...
• Add getX() and getY() as accessors
• Create addPoints(Point) and slope(Point) functions
• See the handout for more information

• C++ Test #1| STARTER CODE FOR THE PROGRAMMING PART
• When finished,
• CALL ME OVER to check your program
• Give me your test
• Take a C++ Reference Sheet from the back desk
• Read this page about C++ Basics
• Then read this page about classes.
• Do NOT worry about destructors.
• DO look at some of the other pages on that site when you finish reading about classes.
  

• Read the sheet together that covers what we should know by now
  
• Go over the test
• if(!you.finishedProgrammingPart())
  
• Finish the Programming Part
• Show me when done (-5 pts for lateness)
  
• // Activities below will not be completed until above is done
• Finish Point --> addPoints() and slope()
• Try the For Loop Fun sheet
• if(forLoopFun.done() || timeOfDay > 12:00pm)
• Create a new folder/project "MathFun" and inside the main method, experiment with the math functions on the reference sheet [math.h]
• I would also like you to play with the following (this is cool:)
• Notice the range of values for int, unsigned int, long, etc. Try math calculations that cause the variables of those data types to exceed their maximum ranges. See what happens!
  
• Next class we will begin the Dice project together!

YOU MUST SHOW ME your Point Project functions (addPoints(Point) and slope(Point)) by Thursday after school

• We're moving forward today!
• Take the Notes 4 handout.
  
• Create a new PROJECT "dice" in a new FOLDER called "dice".
• Copy dice.h into a new file (name it dice.h - add it to the project) and let's begin by studying it!
• Now copy in dice.cpp and let's take a look at the implementation of the methods.
• You should notice that dice.h has #include "rando.h" which means we need to include the random class in our project as well. Copy in rando.h and rando.cpp.
• The <iomanip> class used for setw(int)
• Dice Extra Credit Assignment (Making your own game)
  

Quiz on loops
Finish Dice Assignments

Begin Vectors

• Array.cpp
• ioAndRando.cpp

DO Now Review for Final Exam
Continue with Vectors - Class Demo

• Array.cpp
• ioAndRando.cpp