1. Syllabus

2. Course Outcomes

3. Lab Rules

4. Course Info Slides

5. Google Folder Setup

6. Aspirations in Computing Award (for women, genderqueer, or non-binary students with strong interests in computer technology)

1. Course Workbook (Work in Progress)

2. CodeHS Gitbook (Specifically the "Basic Java" and "Methods" units)

3. CSAwesome (Specifically units 1-4)

4. Princeton's Interdisciplinary Approach to Computer Science

5. Princeton Java Cheatsheet

6. AP CS A Quick Reference

7. Think Java Textbook : HTML Version PDF Version Trinket Version

8. Study Material: Library Fiveable

9. Youtube - Math & Comps

10. Vocab - Virginia CS101 Vocab

11. Playlist - Physical Memory Models

1. PracticeIt - CS Washington (Specifically Chapters 7-10, 12-13) CodeStepByStep

2. CodeWars Birkel's CodeWars Labs

3. Programming Problems List

4. Standford Nifty Assignments

5. Simple Programming Problems list

1. Downloads: Eclipse Java Developer Download JDK Download

2. Online Java Compiler (Code in browser) - Online GDB     CodeHS

3. Java Visualizer

The following terms are ones you should be very familiar with at the end of this unit.

• Computer Science - The science of solving problems, sometimes with a computer

• Programming - Writing out a sequence of commands that a computer understands and can execute.

• Computer Program - Instructions for a computer to follow (like a recipe, or instructions to build Ikea furniture)

• Problem Solving - Creating a solution to a problem

• Binary - 1's and 0's.

• Logic - the process that solving a problem (similar to algorithm, but less concrete)

• Algorithm - the specific sequence of steps that generates a solution to a problem. Algorithms must be repeatable (doing the same task under the same circumstances should produce the same/expected results)

• Hardware

• Software

  • System Software - Operating System - Software that manages the computer (Windows, Linux, MacOS)

  • Application Software - Software that completes a specific task (calculator, web browser, game, etc)

1. Youtube - TechPrep - What is Computer Science?

2. Slides - What is Computer Science (Guided Notes)

3. Video - CS is Everywhere (Video is also in Slides)

4. Reading - Think Java - What is Computer Science

1. Slides - CS Careers

2. Worksheet - Career Exploration

1. Slides - Communication & Binary (Guided Notes)

2. Worksheet - Binary Name

3. Binary Resources:

   1. Binary to Decimal Slides

   2. Decimal to Binary Slides

1. CSAwesome (Access through Canvas - "CSAwesome - Chapter 1 Readings")

   1. Getting Started

   2. Preface

   3. Java Development Environments

   4. Growth Mindset & Pair Programming

   5. Pretest for the AP CS A Exam

   6. Survey

The following terms are ones you should be very familiar with at the end of this unit.

• Statement - A single command.

• Comment - Text in a program that will not be executed by the compiler (side notes for the programmer, not the computer)

• Method/Function - A chunk of related commands that are given a single name. Instead of saying "A^2 + B^2 = C^2" I can just say "The Pythagorean Theorem".

• Virtual Machine - A program that acts like another machine/Operating System.

• Bug - a problem/error in your code/algorithm. There are 3 types of bugs - Syntax, Runtime, and Logical/Semantic.

  • Syntax Error - A bug caused by not following the rules of the programming language. Your program won't run at all.

  • Runtime Error - A bug caused by doing something unexpected in a program (like dividing by 0, or trying to convert "Hello" into a number). Program crashes mid-run

  • Logical/Semantic Error - A bug caused by not getting the correct output. Example: "Hello "+2+2 = "Hello22", not "Hello4". This is called a logical error or a semantic error because your logic is wrong or your logic doesn't match the computer's logic. Your code is being misinterpreted by the computer.

• Debugging - Trying to find your errors and fix them.

1. Slides - What does it all mean (Guided Notes)

2. Slides - Software Solutions 01

3. Slides - Programming Basics (Guided Notes)

   1. Youtube: Mr. Joyce's Basic Outputs - Useful reference for those who need to watch someone program

4. Worksheet - Strings & Escape Sequences

5. Practice - PracticeIt - Intro to Java Programming

6. Worksheet - Error Fixing

Challenges

6. 1. Text Output

      1. Rocket (Easy)

      2. Park (Medium)

      3. Shrek Coding Challenge (Hard)

Extra Resources:

7. Article - World of Ones & Zeros - Algorithms in Programming

1. Youtube: Mr. Joyce's Basic Operations

2. Formatting Doubles - https://langintro.com/comsc075/formatting_output.html

3. Potential Challenges:

   1. Convert Time: Hours & Minutes --> Minutes

   2. Convert Time: Minutes --> Hours & Minutes (Modulus)

   3. Momentum: mass * velocity

   4. Kinetic Energy: KE = 1/2 m*v*v

   5. Paycheck Calculator: normal hours, overtime hours, hourly wage

   6. Coin total: #quarters, #dimes, #nickles, #pennies

Mrs. Gray's Resources - the Mod Game (Teacher resource - Login Required)

The Mod Game is similar to "Rock, Paper, Scissors", but is played with 3 people, each assigned the value 0, 1, or 2. 

Instead of picking Rock, Paper, or Scissors, students pick a # from 0 to 5. Once shown, students add their values together, divide by 3, and calculate the remainder (the modulus/mod).

The winner is the person assigned the number that matches the modulated result.

Algorithm:

1. 3 players

2. each is assigned the # 0, 1, or 2 (identifier).

3. Repeat the following until some condition is met (first to 3 points, for example)

   1. Similar to "Rock, Paper, Scissors", students pick a value, but their value must be a random #, 0-5.

   2. When ready, all students show their value

   3. Add all values

   4. Modulate by 3 (Remainder after dividing by 3) - this gives you a 0, 1, or 2 value

   5. Whoever's assigned # (identifier) matches the modulated result gets a point.

1. Slides - Strings & Methods (Guided Notes)

2. Worksheet - Creating Methods

import java.util.Scanner;

public class MyFunctions

{

public static double inputDouble(String msg, Scanner scan)

{

System.out.println(msg);

double resp = scan.nextDouble(); scan.nextLine();

return resp;

}

public static String makePretty(double val, int place)

{

return String.format("%."+place+"f", val);

}

}

<Under Construction>

1. CSAwesome (Access through Canvas - "CSAwesome - Chapter 2 Reading - Objects & Functions")

   1. Objects - Instances of Classes

   2. Creating & Initializing Objects - Constructors

   3. Calling Methods without Parameters

   4. Calling Methods with Parameters

   5. Methods that Return Values

1. CSAwesome (Access through Canvas - "CSAwesome - Chapter 2 Reading - Strings & Math")

   1. Strings

   2. String Methods

   3. Wrapper Classes - Integer & Double

   4. Using the Math Class

   5. Unit 2 Summary

How the compareTo function works:

• students don't need to know how to calculate the numeric values, just be able to identify whether the result will be negative, positive, or 0. 

• Typical scenario (character difference): In most cases the words are completely different (i.e. "elephant".compareTo("banana"), or "help".compareTo("hemp")), and in all these conditions the returned value will be the ASCII difference between the first letter difference found (i.e. 'e' vs 'b' when comparing elephant to banana, and 'l' vs 'm' when comparing help and hemp). 

• Special scenario (length difference): When 1 word is identical to the start of another word (i.e. "Sam".compareTo("Samantha")), it returns the difference of the String lengths (Sam - Samantha --> 3 - 8 = -5). This is also when it finds that 2 words are identical and returns 0 (i.e. "Sam".compareTo("Sam") reaches the end of the first String, so it returns 3-3 --> 0) 

1. CSAwesome (Access through Canvas - "CSAwesome - Chapter 2 Problems & Quiz")

2. Unit 2 Coding Practice

3. Practice Test for Objects

4. Unit 2 Multiple Choice Exercises

1. Youtube: Mr. Joyce's Basic Java Input

2. Scanner Basics - Getting Strings

3. MadLibs Coding Challenge (Graded)

4. Scanner Basics - Other Inputs

5. CSAwesome - Java Swing GUI (Optional Lesson)

Object & Function Challenge

1. Equality Operators

   1. == is equal to

   2. != is not equal to

2. Relational Operators

   1. < Less than

   2. > Greater than

   3. <= Less than or equal to

   4. >= Greater than or equal to

3. Logical Operators

   1. ! Not

   2. && AND

   3. || OR

4. Boolean Logic Simulator

5. Boolean Logic Game

Additional Resources

• CSAwesome Boolean Expressions & If Statements

• Boolean Laws and Boolean Algebra Summary

1. If

2. else if

3. else

4. nesting

5. Comparing Primitives

6. Comparing Strings/Objects

7. 
   

8. Google Drive Resources

• WordToPigLatin - Create a function which takes in a single word and converts it into pig latin

  • Consider creating a 2nd function called beginsWithVowel which also takes in a word and returns whether or not the word begins with a vowel.

Iterator

For Loop

While Loop

Condition

Initializer

Incrementor

Worksheet 1 - [not posted]

Worksheet 2 - [not posted]

Challenge - Ask the user for 5 numbers, print the smallest, largest, sum, and average.

Challenge - Alternating Case - go through every character in a String and capitalize it if it's @ an even index, and lowercase it if it's @ an odd index.

Challenge - Fibonacci

Challenge - Scrambled String

"As long as" loop.

"As long as the user says 'flip'"

"As long as the 2 dice aren't the same:

Use while loops when you don't know the exact # of times you'll do something

Common While Loop scenarios:

• User Input Validators

  • This often involves "AND" and "OR" statements

• Dice Games (roll 2 dice until you get doubles)

• Repeat until the user says "quit" (similar to a validator)

• Infinite Loops

• tally problems (paired with arrays) - roll 2 dice 100,000,000 times and count how many times they sum to 2, 3, 4, ..., 10, 11, 12.

Scenarios that can be hard to tell that you should use a while loop, or that you could potentially use either.

• Rock Paper Scissors - Best out of 3. How many times will you repeat? at least 2 times, maybe 3. With ties, it might be more.

• List search algorithms - You could loop through every item in a list, but once you find the correct value, you should kick out.

Practice:

• CSAwesome Runestone

  • While Loops

• Data Validator - Get number between 1 and 10 from the user. As long as they type something outside the range, get a different number from the user. When a valid number is written print "Nicely done" and end the program.

• RollDoubles - Roll 2 dice. As long as the dice aren't doubles, roll again. Count how many rolls it takes.

• Get the user's text - "Duck" or "Goose". As long as they said "Duck" get another value. When they finally type "Goose" print "Run!" and end the program.

• Tipsy Timmy - Tipsy Timmy is trying to cross a bridge, but he had too much to drink. He starts in the middle of one side of the bridge. He always moves forwards, but some times he moves 1 space forward and other times he moves 1 space diagonally (left or right), potentially getting near the edge. The bridge is 11 steps wide (center of bridge + 5 steps to the left and 5 steps to the right), and 30 steps long. Can Tipsy Timmy make it across all 30 steps without falling off the edge of the bridge? Every step Tipsy Timmy randomly moved forward, forward-left, and forward-right.

• Revisit the PigLatin program from the Booleans/Conditionals unit. Scan a full line of text. Try to divide the text into words and pass the words into the piglatinTranslator function.

1. CSAwesome Unit 4 - Iterations (Loops)

2. Do Loops

3. Switch Statements

4. Breaks & Continues

5. Nested Loops

Tools in our toolbox - and how to use them

• Outputs - System.out.println (sysout)

• Variables - Stored data

  • Primitive (store by value)

    • boolean - true/false

    • char - Individual Character

    • int - Whole # (+/- 2.14 billion)

    • double - floating point (real) #'s

  • Object (store by reference)

    • String - 2+ characters

    • Scanner - Get input

• Using Functions

  • Strings

    • equals/equalsIgnoreCase - find out if 2 Strings are the same

    • charAt - get the character @ a specific location

    • substring - get a chunk of text

  • Math

    • PI - 14-digit-past-decimal value of pi

    • abs - absolute value

    • round - rounds a # (based on .5)

    • floor - rounds down (same as casting to int)

    • ceil - round up

    • pow - calculate exponents (2^4)

• Operators

  • Basic math operators +, -, *, /, % (modulus)

  • Mod (%) - Gets remainder after division.

    • %2 - Even (0) or odd (1)

    • %10 - Get the last digit

    • %x==0 - Tells us if something is evenly divisible by x

  • Assignment operators =, +=, -=, *=, /=, %=

  • Inc/Dec operators ++, --

  • Boolean Operators

  • Logical Operators >, >=, <, <=, ==, !=

  • Combinors

    • AND && - Returns true if 2 things result in true.

    •  OR || - Returns true if @ least 1 thing evaluates to true.

  • Not ! - Returns the opposite of the result (true-->false)

• Control Structures

  • If statements

  • For Loops

  •  While Loops

  • Functions

• If Statements

  •  if - single branch

  • if, if, if - multiple possible branches

  • if, else - 1 possible branch in 2 directions

  • if, else if... - 0 or 1 possible branch

  • if, else if, else - 1 possible branch

• For loops - Known # of loops/iterations

  • I need to loop 10 times

  • I need to check every letter in a String

• While loop - unknown # of loops/iterations

  • I need to loop until... (user says stop)

    • Fencepost algorithms

      • get info

      • loop until a condition is met

        • do something

        • get info again

• Functions - Repeatable chunks of code

  • Benefits - Code Reuse, Code Readability, code organization

  • Function calls - nameOfFunction(possibleParameters);

  • Parameters - what a function needs to work.

  • public static returnType nameOfFunction(list of parameters)

  • return types: void (no return) or the type of what is getting returned

• Create the indexOf function to find the 1st occurance of the target (char) in a text (String).

  • takes in the text and the target as parameters

  • creates a loop that goes through every index of the text looking for the target

  • if it finds the target, it should return the index #

  • else it should return -1 (not found).

text.charAt(i) gets a character at a specific index.

Discussion Question: Given the rules we defined for choosing loops:

• Is this a For Loop problem?

• Is this a While Loop problem?

For Loop Solution:

public static int indexOf(String text, char target)

{

for(int i = 0; i < text.length(); i++)

{

char cur = text.charAt(i);

System.out.println(cur);

if(cur == target)

return i; //premature exit

}

return -1;

}

While Loop Solution:

<coming soon>

The Pickup Sticks game:

• • You are playing against the computer

  • There are 21 sticks in a pile (or laid out in a row).

  • On your turn, you pick 1, 2, or 3 sticks to remove from the pile.

  • The computer takes 1, 2, or 3 sticks to remove from the pile.

  • Play repeats until there are no sticks left.

  • Whoever takes the last 1, 2, or 3 sticks is the winner.

You're tasked with programming the game. Make sure you fully comprehend the gameplay (as well as the winning strategy). Play with a neighbor if you need to. Use a whiteboard or scratch paper if you need help with your step-by-step process. Always think "What is the next step in the game?".

The computer should ALWAYS try to win (unless you do the E.C. option for easy vs hard play)

Requirements/Process

1. The computer will ask you how many sticks to start with (It doesn't actually have to be 21). - This should be saved as a variable.

2. Ask the user who goes first (the player or the computer)

3. Repeat until there is a winner ("as long as there are still sticks...")

   1. If it's the player's turn

      1. Ask for 1, 2, or 3 sticks (subtracting them from the total sticks)

   2. If it's the computer's turn

      1. If the computer can be put into a winning position, it should take that many sticks.

      2. Otherwise, it should randomly pick 1, 2, or 3 sticks.

   3. Switch turns

4. Declare the winner (based on who took the last sticks)

Additional Requirements

• Data Validation

  • The user & computer shouldn't be able to take:

    • less than 1.

    • more than 3 (or whatever the max grab is - see E.C.)

    • more than the total # of sticks (if there's only 1 stick left, you can't take 3).

Suggestions

• have a function for getting the player's choice (and validating it)

• have a function for getting the computer's choice (and playing smart)

EC: (1pt each)

• Allow the user to decide the max# of sticks to grab (doesn't have to be 3)

• Allow the user to choose an easy or hard mode

  • Hard: Computer plays smart (This is the default mode)

  • Easy: Computer always picks a random # between 1 & 3 and only plays smart if there's less than 4 sticks left (meaning the computer can win this turn)

• Allow the user to choose to play another player or the computer

You must email me to let me know if you've completed the E.C. and which ones specifically - I'll miss it otherwise.

• Count every vowel in a String

• FeeBee

• isLeapYear

• LambSauce

Final Part 1 - Schwein

Final Part 2 - Financial Difference

Final Part 3 - [Multiple Choice Quiz - coming soon]