Notes
September 15, 2015
Automate- task repeated over and over by a machine
Computer Science- the science of computers being used by humans to solve a
problem
Computer Scientist-Someone who works on computers to solve problems
Data-Information
Environment-The surroundings
Interface-the things in front of you
Open Source-Open Resources
Programming-Using to code to program something
Simulation- A simulation showing somebody something that isnt real, pretending to
be real.
10 Encode-To code something on technology
11. Decode-To get rid of code on technology
moveForward();
Moving forward
turnRight();
Turn Right
for (var count = 0; count < 5; count++) {
Repeat code five times
while (notFinished()) {
Moving unti soothing is finished
while (notFinished()) {
moveForward();
if (isPathLeft()) {
turnLeft();
Notes
If it is right turn right.
while (notFinished()) {
if (isPathForward()) {
moveForward();
} else {
turnLeft();
}
}
If ahead turn left and move forward
hile (notFinished()) {
if (isPathForward()) {
moveForward();
} else {
turnRight();
}
}
If ahead turn right and move forward until sunflower
while (notFinished()) {
if (isPathForward()) {
moveForward();
} else {
if (isPathRight()) {
turnRight();
} else {
Notes
turnLeft();
If right move forward if right turn left or right and keep repeating until sunflower
or (var count = 0; count < 4; count++) {
moveForward();
}
turnLeft();
for (var count2 = 0; count2 < 5; count2++) {
moveForward();
}
Move forward 4 time and then turn left and move forward 5 times
while (notFinished()) {
moveForward();
moveForward();
turnLeft();
}
Move forward turn left
moveForward(100);
turnRight(90);
moveForward(100);
Move forward 100 pixel turn right 90 degrees move forward 100 ixels
penColour('#228b22');
moveForward(100);
turnRight(90);
moveForward(100);
turnRight(90);
moveForward(100);
Notes
turnRight(90);
moveForward(100);
Color green and comlete a square
for (var count = 0; count < 4; count++) {
moveForward(100);
turnRight(90);
}
Repeat 4 times
for (var count = 0; count < 3; count++) {
penColour(colour_random());
moveForward(100);
turnRight(120);
}
Repeat three time with randm colors
for (var count = 0; count < 3; count++) {
penColour(colour_random());
moveForward(100);
turnRight(120);
}
for (var count2 = 0; count2 < 4; count2++) {
moveForward(100);
turnRight(90);
}for (var count = 0; count < 3; count++) {
moveForward(100);
turnRight(120);
}
Notes
for (var count2 = 0; count2 < 4; count2++) {
turnLeft(90);
moveForward(100);
}
Form a triangle and a square n opposite sides
1. Computational Thinking A method of problem solving thats help computer
scientist prepare problems for digital solutions
2. Abstraction removing details from a solution so that it could work with many
problems
3. Algorithm A list of steps that allow you to complete a task
4. Decompose to break a hard problem up into smaller easier ones
5. Pattern- A theme that is repeated many times
6. Program- instructions that can be understood and followed by a machine
4 steps
1.
2.
3.
4.
Decompose- Figure out base problem
Patterns- Common charactistics
Abstraction- Minimalize the words needed
Algorithms- Objective complete
for (var count2 = 0; count2 < 10; count2++) {
penColour(colour_random());
for (var count = 0; count < 4; count++) {
moveForward(20);
turnRight(90);
}
Notes
moveForward(20);
}
for (var count3 = 0; count3 < 4; count3++) {
for (var count2 = 0; count2 < 10; count2++) {
penColour(colour_random());
for (var count = 0; count < 4; count++) {
moveForward(20);
turnRight(90);
}
moveForward(20);
}
turnRight(90);
}
for (var count3 = 0; count3 < 4; count3++) {
for (var count2 = 0; count2 < 10; count2++) {
penColour(colour_random());
for (var count = 0; count < 4; count++) {
moveForward(20);
turnRight(90);
}
moveForward(20);
}
turnRight(80);
}
moveForward();
Notes
moveForward();
moveForward();
moveForward();
dig();
moveForward();
fill();
fill();
moveForward();
for (var count = 0; count < 10; count++) {
dig();
}
or (var count = 0; count < 5; count++) {
dig();
moveForward();
turnLeft();
}
while (isPathForward()) {
moveForward();
for (var count = 0; count < 5; count++) {
fill();
}
}
while (pilePresent()) {
dig();
moveForward();
}
Notes
turnRight();
moveForward();
while (holePresent()) {
fill();
}
while (isPathForward()) {
moveForward();
}
fill();
while (isPathForward()) {
moveForward();
dig();
}
turnLeft();
while (isPathForward()) {
[Link](); if ([Link]()){return;}
moveForward();
dig();
}while (isPathForward()) {
moveForward();
if (pilePresent()) {
dig();
}
}while (isPathForward()) {
moveForward();
if (pilePresent()) {
Notes
dig();
}
if (holePresent()) {
fill();
}
}for (var count = 0; count < 4; count++) {
moveForward(100);
turnRight(90);
}// draw_a_square
for (var count = 0; count < 4; count++) {
moveForward((50));
turnRight(90);
}
or (var count2 = 0; count2 < 3; count2++) {
penColour(colour_random());
// draw_a_square
for (var count = 0; count < 4; count++) {
moveForward((100));
turnRight(90);
}
turnLeft(120);
}
// draw_a_square
for (var count = 0; count < 4; count++) {
moveForward((50));
turnRight(90);
Notes
}
// draw_a_square
for (var count2 = 0; count2 < 4; count2++) {
moveForward((60));
turnRight(90);
}
// draw_a_square
for (var count3 = 0; count3 < 4; count3++) {
moveForward((70));
turnRight(90);
}
// draw_a_square
for (var count4 = 0; count4 < 4; count4++) {
moveForward((80));
turnRight(90);
}
// draw_a_square
for (var count5 = 0; count5 < 4; count5++) {
moveForward((90));
turnRight(90);
}
Make a square that gets bigger and bigger by 10 pixels
1.
2.
3.
4.
5.
6.
Function: A piece of code that can be called over and over
Function Call: The place you call on your function
Variable: A value that can change
Conditional: A statement that is either true or false
If statement: Weather or not you can run a certain type of code
Else statement: Another way of saying otherwise
Notes
7. Increment: To add a certain amount
8. Decrement: To subtract an amount
9. Nested statements: A statement in another statement
dig();
moveForward();
fill();
moveForward();
dig();
turnLeft();
for (var count = 0; count < 3; count++) {
moveForward();
dig();
}
turnLeft();
moveForward();
moveForward();
dig();
turnLeft();
moveForward();
dig();
moveForward();
dig();
turnLeft();
moveForward();
fill();
function fill_5() {
for (var count = 0; count < 5; count++) {
fill();
}
}
moveForward();
fill_5();
unction fill_5() {
for (var count = 0; count < 5; count++) {
fill();
}
}
while (isPathForward()) {
moveForward();
fill_5();
}
function remove_7() {
remove_7();
}
function fill_5() {
for (var count3 = 0; count3 < 5; count3++) {
Notes
fill();
}
}
for (var count2 = 0; count2 < 10; count2++) {
for (var count = 0; count < 7; count++) {
dig();
}
moveForward();
turnLeft();
moveForward();
turnRight();
}
function remove_6() {
remove_6();
}
for (var count2 = 0; count2 < 6; count2++) {
moveForward();
for (var count = 0; count < 6; count++) {
dig();
}
moveForward();
}
unction fill_8() {
for (var count = 0; count < 8; count++) {
fill();
}
}
function remove_8() {
for (var count2 = 0; count2 < 8; count2++) {
dig();
}
}
remove_8();
while (isPathForward()) {
moveForward();
}
fill_8();
function avoid_the_cow_and_remove_1() {
avoid_the_cow_and_remove_1();
}
turnLeft();
moveForward();
turnRight();
moveForward();
moveForward();
Notes
turnRight();
moveForward();
dig();
function avoid_the_cow_and_remove_1() {
avoid_the_cow_and_remove_1();
}
for (var count = 0; count < 10; count++) {
turnLeft();
moveForward();
turnRight();
moveForward();
moveForward();
turnRight();
moveForward();
dig();
turnLeft();
}
function remove_stack_of_4_piles() {
turnLeft();
for (var count2 = 0; count2 < 4; count2++) {
dig();
moveForward();
}
turnRight();
turnRight();
for (var count3 = 0; count3 < 4; count3++) {
moveForward();
}
turnLeft();
}
for (var count = 0; count < 6; count++) {
remove_stack_of_4_piles();
moveForward();
}
function fill_stack_of_2_holes() {
turnLeft();
for (var count = 0; count < 2; count++) {
fill();
moveForward();
}
turnRight();
turnRight();
for (var count2 = 0; count2 < 2; count2++) {
moveForward();
}
turnLeft();
}
Notes
function remove_stack_of_4_piles() {
turnLeft();
for (var count3 = 0; count3 < 4; count3++) {
dig();
moveForward();
}
turnRight();
turnRight();
for (var count4 = 0; count4 < 4; count4++) {
moveForward();
}
turnLeft();
}
while (isPathForward()) {
if (pilePresent()) {
remove_stack_of_4_piles();
} else {
fill_stack_of_2_holes();
}
moveForward();
}
unction draw_a_square() {
for (var count = 0; count < 4; count++) {
moveForward(100);
turnRight(90);
}
}
function draw_a_triangle() {
for (var count2 = 0; count2 < 4; count2++) {
moveForward(100);
turnRight(120);
}
}
draw_a_triangle();
function draw_a_square() {
for (var count = 0; count < 4; count++) {
moveForward(100);
turnRight(90);
}
}
function draw_a_triangle() {
for (var count2 = 0; count2 < 3; count2++) {
moveForward(100);
turnRight(120);
}
Notes
}
draw_a_triangle();
moveForward(100);
draw_a_square();
moveForward(100);
draw_a_triangl
function draw_a_square() {
for (var count = 0; count < 4; count++) {
moveForward(100);
turnRight(90);
}
}
function draw_a_triangle() {
for (var count2 = 0; count2 < 3; count2++) {
moveForward(100);
turnRight(120);
}
}
draw_a_square();
moveForward(100);
turnRight(30);
draw_a_triangle();
unction draw_a_square() {
for (var count = 0; count < 4; count++) {
moveForward(100);
turnRight(90);
}
}
function Draw_a_house() {
draw_a_square();
moveForward(100);
turnRight(30);
draw_a_triangle();
}
function draw_a_triangle() {
for (var count2 = 0; count2 < 3; count2++) {
moveForward(100);
turnRight(120);
}
}
Draw_a_house();
var length2;
function draw_a_triangle(length2) {
Notes
for (var count = 0; count < 3; count++) {
moveForward(length2);
turnRight(120);
}
}
function draw_a_square(length2) {
for (var count2 = 0; count2 < 4; count2++) {
moveForward(length2);
turnRight(90);
}
}
draw_a_triangle(100);
moveForward(100);
draw_a_triangle(200);
function draw_a_triangle(length2) {
for (var count2 = 0; count2 < 3; count2++) {
moveForward(length2);
turnRight(120);
}
}
function draw_a_house(length2) {
draw_a_square(150);
moveForward(150);
turnRight(30);
draw_a_triangle(150);
}
draw_a_house(length2)
moveEast();
moveEast();
End of 20 hours of code.
for (var count2 = 0; count2 < 8; count2++) {
turnLeft(120);
for (var count = 0; count < 3; count++) {
moveForward(40);
moveBackward(40);
turnRight(30);
}
turnRight(30);
jumpForward(50);
}
for (var count2 = 0; count2 < 12; count2++) {
Notes
penColour(colour_random());
for (var count = 0; count < 3; count++) {
moveForward(100);
turnRight(100);
}
turnRight(30);
}
for (var count2 = 0; count2 < 4; count2++) {
penColour(colour_random());
for (var count = 0; count < 360; count++) {
moveForward(1);
turnRight(1);
}
turnLeft(90);
}
for (var count3 = 0; count3 < 12; count3++) {
penColour(colour_random());
for (var count = 0; count < 180; count++) {
moveForward(1);
turnRight(2);
}
for (var count2 = 0; count2 < 15; count2++) {
moveForward(3);
turnRight(2);
}
}
September 17 2015
4 steps
1.
Decompose- Figure out base problem
2.
Patterns- Common charactistics
3.
Abstraction- Minimalize the words needed
4.
Algorithms- Objective complete
Course 3
function draw_a_flower() {
penColour('#228b22');
moveForward(100);
for (var count2 = 0; count2 < 10; count2++) {
penColour(colour_random());
turnLeft(36);
moveForward(25);
turnLeft(36);
moveForward(25);
turnLeft(144);
Notes
moveForward(25);
turnLeft(36);
moveForward(25);
turnLeft(144);
}
jumpBackward(100);
}
for (var count = 0; count < 3; count++) {
turnLeft(90);
draw_a_flower();
turnRight(90);
DNS: Service that translates urls into ip address
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
Youtube
Steam Powered
CSGO Lounge
[Link]
Cool Math Games
Reddit
Minecraft
[Link]
Renekton Counters
CSGO Source
