Lecture Wed Week 7 Midterm grades on gradesource – Graded out of 26 (free point) – Question 1 confusing – everyone gets full points – Solutions posted.

Slides:



Advertisements
Similar presentations
As you come in…  Sign in (in back) and pick up  Badge  Name Card – write your first name LARGELY on back  Any questions? (of any kind)  Put on index.
Advertisements

As you come in…  Sign in (in back) and pick up  Badge  Name Card – write your first name LARGELY on back  Log in:  Launch/Start Alice  Any questions?
Team Teaching Section 2: Traditional Team Teaching.
Exponential Functions Logarithmic Functions
Mrs. Kristi Walker 4th Grade
Annoucements  Next labs 9 and 10 are paired for everyone. So don’t miss the lab.  There is a review session for the quiz on Monday, November 4, at 8:00.
As you come in…  Sign in (in back) and pick up  Badge  Name Card – write your first name LARGELY on back  Any questions? (of any kind)  Put on index.
Lecture 4: Finishing 4.2 and onto 4.3 What have you learned so far? To control a computer by designing and writing a program – Creating animations/movies.
Programming with Alice Computing Institute for K-12 Teachers Summer 2011 Workshop.
CSE 113 Introduction to Computer Programming Lecture slides for Week 10 Monday, October 31 th, 2011 Instructor: Scott Settembre.
Chapter 9.1: Lists Lists are often called by another name in other programming languages – arrays.
CIS101 Introduction to Computing Week 12. Agenda Your questions Solutions to practice text Final HTML/JavaScript Project Copy and paste assignment JavaScript:
Blended classes are an exciting way to learn. Their convenience and scheduling appeals to many students, but they are not for everyone. Students drop-out.
Faculty of Sciences and Social Sciences HOPE PHP Flow Control Website Development Stewart Blakeway FML
Alice Variables Pepper. Set to Java look Edit / preferences restart.
Loops – While, Do, For Repetition Statements Introduction to Arrays
Lecture 2: CSE3: Fluency in Information Technology Read csemoodle.ucsd.edu – Homework for next Monday (you don’t turn anything in) – Joined class late,
Games and Simulations O-O Programming in Java The Walker School
While Loops and Do Loops. Suppose you wanted to repeat the same code over and over again? System.out.println(“text”); System.out.println(“text”); System.out.println(“text”);
Lecture 11 Alice Project Deliverable 1: Extension to Midnight! Midterm next class – Midterm review 4-6pm WED Pepper Canyon Hall 106 – Red scantron (1/2.
Welcome to CS 115! Introduction to Programming. Class URL Please write this down!
Chapter 6: (Expressions,) Functions, and If/Else First we had animations – They “ran”/played the same way every time. – Neat, but a bit boring Then we.
Lecture 5: Finishing 4.3 and onto 5.1 Preparing for the Midterm: Written Explanations Technology and Society Assignment (5% - 3 in term) – How does the.
1. 2 Class Class meets here 7:00 Tuesdays for between 1 and 1.5 hours A Lab immediately follows the class in 143 Baker A second lab is Friday 2-5 in 143.
Python November 28, Unit 9+. Local and Global Variables There are two main types of variables in Python: local and global –The explanation of local and.
Bellwork Copy and Answer 5 – x ÷ x -10.
Creative Commons Attribution Non-Commercial Share Alike License sa/3.0/
Week 5 - Wednesday.  What did we talk about last time?  Exam 1!  And before that?  Review!  And before that?  if and switch statements.
CS 114 – Class 02 Topics  Computer programs  Using the compiler Assignments  Read pages for Thursday.  We will go to the lab on Thursday.
CPS120 Introduction to Computer Science Iteration (Looping)
Chapter 4: Classes, Objects, and Parameters 4.1 World-Level methods.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
Room 112 Math/Accelerated Math Teacher.  Been in Oxford for 14 years  Have taught math all 14 (other years have taught science and geography)  Went.
Moving Around in Scratch The Basics… -You do want to have Scratch open as you will be creating a program. -Follow the instructions and if you have questions.
CPS120: Introduction to Computer Science Decision Making in Programs.
CSE 113 Introduction to Computer Programming Lecture slides for Week 12 Monday, November 14 th, 2011 Instructor: Scott Settembre.
Intermediate 2 Software Development Process. Software You should already know that any computer system is made up of hardware and software. The term hardware.
© 2006 Pearson Education 1 More Operators  To round out our knowledge of Java operators, let's examine a few more  In particular, we will examine the.
Overview of Java Loops By: Reid Hunter. What Is A Loop? A loop is a series of commands that will continue to repeat over and over again until a condition.
COMN Lecture 1a WELCOME!WELCOME! What We are Here to Do Become aware of the limitations of our common sense understanding of how interpersonal.
Today’s Announcements Assignment 8 is due Project 2 is due 7/27/04 We will be skipping chapter 22 Test 3 (chapters 18-21) will be on 7/29/04 Tip of the.
COMN Organizational Communication Lecture 1a
Selection Statements. Introduction Today we learn more about learn to make decisions in Turing ▫Nested if statements, ▫case statements.
Welcome! Hello and welcome to English Composition 102, Introduction to Literature. I am looking forward to exploring, writing, and discussing literature.
CPS120 Introduction to Computer Science Iteration (Looping)
CS 139 – Algorithm Development MS. NANCY HARRIS LECTURER, DEPARTMENT OF COMPUTER SCIENCE.
Tutorial for Arrays and Lists. Description This presentation will cover the basics of using Arrays and Lists in an Alice world It uses a set of chickens.
1 Printing in Python Every program needs to do some output This is usually to the screen (shell window) Later we’ll see graphics windows and external files.
CHAPTER 14 Classes, Objects, and Games XNA Game Studio 4.0.
BIT 143: Programming – Data Structures It is assumed that you will also be present for the slideshow for the first day of class. Between that slideshow.
U.S. History Group Project.  In the remaining weeks of school, you, the students, will be put in the position of teacher. You will be broken up into.
Repetition everywhere – comparing while in a method and as an event Susan Rodger Duke University July 2010.
Arrays and Loops. Learning Objectives By the end of this lecture, you should be able to: – Understand what a loop is – Appreciate the need for loops and.
Programming in Java (COP 2250) Lecture 12 & 13 Chengyong Yang Fall, 2005.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
CDA 3100 Fall Special Thanks Thanks to Dr. Xiuwen Liu for letting me use his class slides and other materials as a base for this course.
Loops Brent M. Dingle Texas A&M University Chapter 6 – Section 6.3 Multiway Branches (and some from Mastering Turbo Pascal 5.5, 3 rd Edition by Tom Swan)
1 Quiz Show Programming Terms. 2 Alice - 3D Virtual Programming Vocabulary Quiz Board Chapter 1 Chapter 2a Chapter 2b Chapter 3 Chapter 4 $100 $200 $300.
Alice Development Environment. Which area contains our “program” (set of instructions)? D AB C.
11 Making Decisions in a Program Session 2.3. Session Overview  Introduce the idea of an algorithm  Show how a program can make logical decisions based.
Introduction to Programming
Introducing Instructions
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1301! Principles of Programming I.
Alice Variables Pepper.
Looping and Random Numbers
Blackboard Beginner Level Training
Lecture Mon Week 8 Tech and Society #2 Due Tuesday 11:59pm!
Presentation transcript:

Lecture Wed Week 7 Midterm grades on gradesource – Graded out of 26 (free point) – Question 1 confusing – everyone gets full points – Solutions posted soon Great job!

Could you help me out Please be completely honest…

How many hours did you study for the midterm? A. None B.1 hour C.2 hours D.3 hours E.More than 3 hours

How did you spend your study time? A.Working with the sample midterm/clicker questions B.Reading the book C.Both fairly evenly

Were you surprised by the content of the exam? A.Not at all B.A little bit C.Quite a bit D.I was completely surprised

Tech and Society #2: Ifs and Events on the Web… (due Tuesday Week 8) Let’s look on moodle The Web: – New Opportunities for Social Particpation Explore account creation and a web site – Answer “questions” (like lab) on surveymonkey about the experience Forum Post – Reflection on power of “pervasive” computing

Suppose there is a list of Customers (people waiting in line). You want to serve each customer one at a time, so each one should walk into the store one at a time. A.Use a DoTogether tile B.Use a DoInOrder tile C.Use a ForAllTogether tile D.Use a ForAllInOrder tile

Which of the following types can be used in a list? A.Rockette B.Rockette’s Thighs C.Rockette’s Hips D.All of the Above

If I declare a list thusly, and use a ForAllInOrder tile, what order do the rockettes kick? Order Arockette rockette2 rockette3 Brockette rockette3 rockette2 CYou can’t be sure DNone of the above

Finish Section 7.2 While (Indeterminate) Loops Did you watch the video? – Please do!

Chapter 9-1 Lists Our last Alice chapter  After Chapter 9, we’ll move into the white and red Excel book – A certain amount of background excel knowledge is expected. – We have an online quiz to help you figure out if you don’t have that background And an online tutorial to help you get it You will need to do this on your own

Old Budweiser Commercial Three frogs, together they say Budwesier – Frog 1 (on left) “Bud” – Frog 2 (in middle) “weis” – Frog 3 (on right) “er” That’s hard – let’s start with – Three frogs talk in order left to right – Like this:

What does this code do?

A.The frogs talk in order left to right B.The frogs talk in backwards order (right to left) C.Each frog talks, but the order depends

It ALWAYS goes in the order you make your list in

Let’s assume I remake my list like this (L to R):

What if I want the frogs to say Hello (left to right) 5 times? A.Make a counted loop run five times INSIDE (as the inner loop) the ForAllInOrder loop B.Make a counted loop run five times with the ForAllInOrder loop INSIDE (as the inner loop)

Predict: What would this code do? ???

By the way… you can make a list out of different kinds of objects Do the wave with different “People” objects Make different types of flowers grow And out of other things…

Problem: Each frog should say something different… Bud Wei Ser

What programming construct would you use? A.An if statement inside the For all in order B.A counted loop inside the For all in order C.An if statement before the For all in order D.A counted loop outside the For all in order E.I don’ t know…

There are (at least) two possible solutions… What is the BEST explanation of why is one better than the other? A.Option 1 is better because it is shorter B.Option 1 is better because it does the least number of “checks” (or boolean condition evaluations) C.Option 2 is better because it makes clear exactly what the “checks” (or boolean condition evaluations) are D.Option 2 is better because it has a regular structure with empty “else” portions

A)Shorter B)Least Boolean Checks C) Clear Boolean Checks D) Regular Structure with Empty “else”es

Remember this… “Good” programs aren’t (always) the ones that – Make it easiest on the programmer – Are easiest for humans to read – Require least amount of effort from programmer Instead they are (usually) the ones that – Require least computing work (by computer) – Are easiest to adapt to new situations Methods and parameters come in here

There’s an EVEN BETTER way to write this program! Think about this… – What if we had… A list of froggies – Some number of frogs that want to talk A list of words – Exactly the same “number” of Strings to be “said” by each of those frogs… – How can we make a program that will make each frog say a specific word In ONLY 2 LINES OF CODE?!?!?

Let’s make the beetles do a more complicated dance… Like this:

Which structure would you want? A.One ForAllInOrder loop B.One ForAllInOrder loop with an if statement inside C.One if statement with a ForAllTogether inside D.None of the above

Does this code correctly implement our intended behavior? A.Yes B.No C.I don’t know And WHY!

What is new about this code? Nested “for all” loops A loop that “iterates” over all items in a list – Inside that is another loop that goes over all the items in a list – In this case, happen to be the same list Wow, you can do complicated things now…

There are 4 beetles, how many times is this instruction executed? A.4 B.12 C.16 D.48 E.I don’t know

Parameters to methods: We can do better now!

How would we do our “new” solo (with backup)