CSci 127: Introduction to Computer Science

Similar documents
CSci 127: Introduction to Computer Science

CSci 127: Introduction to Computer Science

CSci 127: Introduction to Computer Science

CSci 127: Introduction to Computer Science

Final Exam, Version 2 CSci 127: Introduction to Computer Science Hunter College, City University of New York

CSC 443: Web Programming

Mock Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York

Final Exam, Version 3 CSci 127: Introduction to Computer Science Hunter College, City University of New York

Final Exam, Version 1 CSci 127: Introduction to Computer Science Hunter College, City University of New York

research assistant at VSE/LEE course site: janvavra.github.io consultations by appointment

CSCI0931 Intro Comp for Humanities & Soc Sci Jun Ki Lee. Final Project. Rubric

Computer and Programming: Lab 1

Sample Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York

Final Exam, Version 4 CSci 127: Introduction to Computer Science Hunter College, City University of New York

Final Exam, Version 2 CSci 127: Introduction to Computer Science Hunter College, City University of New York

Final Exam, Version 3 CSci 127: Introduction to Computer Science Hunter College, City University of New York

Introduction to Events

COMP 522 Modelling and Simulation model everything

CS 520: Introduction to Artificial Intelligence. Review

Lecture 1. Course Overview, Python Basics

CS 343: Artificial Intelligence

Lecture 1. Course Overview, Python Basics

Mock Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York

Pervasive Computing. OpenLab Jan 14 04pm L Institute of Networked and Embedded Systems

EventCenter Training SEPTEMBER CrowdCompass 2505 SE 11 th Ave, Suite #300 Portland, OR

Professor Stephen Sekula

CS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, Good Luck!

Finding Pi: Applications of Loops, Random Numbers, Booleans CS 8: Introduction to Computer Science, Winter 2018 Lecture #6

CS1110 Lab 5: Practice for A4 (Mar 8-9, 2016) First Name: Last Name: NetID:

Recitation # Embedded System Engineering Friday 16-Oct-2015

Welcome to CS120 Fall 2012

(0) introduction to the course. how to learn a programming language. (0) course structure

Lecture #2: Programming Structures: Loops and Functions

CSCI 446: Artificial Intelligence

Applying AI to Mapping

Artificial Intelligence Class 3: Search (Ch ) Some material adopted from notes by Charles R. Dyer, University of Wisconsin-Madison

Lecture 5. Defining Functions

Course 55197A: Microsoft SharePoint Server 2016 for the Site Owner/Power User

What are different approaches of Computer Art? How can computation create art? 9/17/12. Human uses computer to modify digital images

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims

CSCI 136 Data Structures & Advanced Programming. Fall 2018 Instructors Bill Lenhart & Bill Jannen

Chapter 1 Exploring the Network

Final Exam, Version 1 CSci 127: Introduction to Computer Science Hunter College, City University of New York

Introductory Guide to the Daily Digest

CMSC 201 Fall 2018 Lab 04 While Loops

Potential Midterm Exam Questions

Final Exam Practice Fall Semester, 2012

CS240 Fall Mike Lam, Professor. Algorithm Analysis

CS 460/560 Introduction to Computational Robotics Fall 2017, Rutgers University. Course Logistics. Instructor: Jingjin Yu

CS 3640: Introduction to Networks and Their Applications

Collision Avoidance with Unity3d

Computing Plans EYFS

Final Project Grading Criteria, CSCI 588, Fall 2001

Mock Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York

Semester. DEPARTMENT: _ Mathematics COURSE: PC Hardware

CS 343H: Artificial Intelligence

CS510 \ Lecture Ariel Stolerman

ECE Object-Oriented Programming using C++ and Java

Introduction to 9.0. White Paper. Sync and Surf FirstClass Support for Mobile Users. November Powering collaborative online communities.

Answer Key: CMP 167 Final Exam, Version 4, Spring 2015

While Loops A while loop executes a statement as long as a condition is true while condition: statement(s) Statement may be simple or compound Typical

Announcements. Project 0: Python Tutorial Due last night

Survey #2. Variable Scope. University of British Columbia CPSC 111, Intro to Computation Alan J. Hu. Readings. Scope Static.

Grandparents U, 2018 Part 1

Chapter 2 Web Development Overview

CP122 CS I. Hello, World!

What is the Best Way for Children to Learn Computer Programming?

Search with Costs and Heuristic Search

CS535: Interactive Computer Graphics

Embedded Systems and Ubiquitous Computing

Bachelor of Computer Science (Course Code: C2001)

Using PowerPoint - 1

A* optimality proof, cycle checking

(Refer Slide Time: 01.26)

Monday, August 28, 2017

roboturtle Documentation

Department of Computing MSc Programmes. MSc in Computing Science MSc in Computing(<specialism>) MSc in Advanced Computing MRes in Advanced Computing

Draw beautiful and intricate patterns with Python Turtle, while learning how to code with Python.

DS504/CS586: Big Data Analytics Data Pre-processing and Cleaning Prof. Yanhua Li

Top 10 List Surviving Top 10 List (cont)

Student Handbook Master of Information Systems Management (MISM)

Usability Testing. November 14, 2016

Algorithmic Approaches for Biological Data, Lecture #1

The Alice Scene Editor

CS283: Robotics Fall 2016: Software

Lecture 13. For-Loops

ISC West 2018 preview: Cyber, smart homes and drones

Human-Computer Interaction (CS4317/5317)

Today. Informed Search. Graph Search. Heuristics Greedy Search A* Search

Duplicate and customize an existing kahoot to fit your needs. Launch and host a kahoot game in your class

Curriculum Map Grade(s): Subject: AP Computer Science

Planning: Wrap up CSP Planning Logic: Intro

61A LECTURE 1 FUNCTIONS, VALUES. Steven Tang and Eric Tzeng June 24, 2013

Econ 172A - Slides from Lecture 9

Data Structures and Algorithms

Midterm Exam 2A Principles of Computing Fall November 10, 2014

Lesson Plan. Course Title: Web Technologies

CSCI 141 Computer Programming I. Filip Jagodzinski

CS 241 Data Organization using C

T Mobile Systems Programming (5 cr)

Transcription:

CSci 127: Introduction to Computer Science hunter.cuny.edu/csci CSci 127 (Hunter) Lecture 9 7 November 2018 1 / 41

Announcements Each lecture includes a survey of computing research and tech in NYC. Today: Prof. Susan Epstein Machine Learning CSci 127 (Hunter) Lecture 9 7 November 2018 2 / 41

Today s Topics Recap: Functions & Top Down Design Mapping GIS Data Loops CS Survey CSci 127 (Hunter) Lecture 9 7 November 2018 3 / 41

In Pairs or Triples: What are the formal parameters for the functions? What is the output of: r = prob4(4,"city") print("return: ", r) What is the output of: r = prob4(2,"university") print("return: ", r) CSci 127 (Hunter) Lecture 9 7 November 2018 4 / 41

Python Tutor (Demo with pythontutor) CSci 127 (Hunter) Lecture 9 7 November 2018 5 / 41

In Pairs or Triples: Write the missing functions for the program: def main(): tess = setup() #Returns a purple turtle with pen up. for i in range(5): x,y = getinput() #Asks user for two numbers. marklocation(tess,x,y) #Move tess to (x,y) and stamp. CSci 127 (Hunter) Lecture 9 7 November 2018 6 / 41

Group Work: Fill in Missing Pieces def main(): tess = setup() #Returns a purple turtle with pen up. for i in range(5): x,y = getinput() #Asks user for two numbers. marklocation(tess,x,y) #Move tess to (x,y) and stamp. CSci 127 (Hunter) Lecture 9 7 November 2018 7 / 41

Group Work: Fill in Missing Pieces 1 Write import statements. import turtle def main(): tess = setup() #Returns a purple turtle with pen up. for i in range(5): x,y = getinput() #Asks user for two numbers. marklocation(tess,x,y) #Move tess to (x,y) and stamp. CSci 127 (Hunter) Lecture 9 7 November 2018 8 / 41

Third Part: Fill in Missing Pieces 1 Write import statements. 2 Write down new function names and inputs. import turtle def setup(): #FILL IN def getinput(): #FILL IN def marklocation(t,x,y): #FILL IN def main(): tess = setup() #Returns a purple turtle with pen up. for i in range(5): x,y = getinput() #Asks user for two numbers. marklocation(tess,x,y) #Move tess to (x,y) and stamp. CSci 127 (Hunter) Lecture 9 7 November 2018 9 / 41

Third Part: Fill in Missing Pieces 1 Write import statements. 2 Write down new function names and inputs. 3 Fill in return values. import turtle def setup(): #FILL IN return(newturtle) def getinput(): #FILL IN return(x,y) def marklocation(t,x,y): #FILL IN def main(): tess = setup() #Returns a purple turtle with pen up. for i in range(5): x,y = getinput() #Asks user for two numbers. marklocation(tess,x,y) #Move tess to (x,y) and stamp. CSci 127 (Hunter) Lecture 9 7 November 2018 10 / 41

Third Part: Fill in Missing Pieces 1 Write import statements. 2 Write down new function names and inputs. 3 Fill in return values. 4 Fill in body of functions. import turtle def setup(): newturtle = turtle.turtle() newturtle.penup() return(newturtle) def getinput(): x = int(input( Enter x: )) y = int(input( Enter y: )) return(x,y) def marklocation(t,x,y): t.goto(x,y) t.stamp() def main(): tess = setup() #Returns a purple turtle with pen up. for i in range(5): x,y = getinput() #Asks user for two numbers. CSci marklocation(tess,x,y) 127 (Hunter) #Move Lecture tess 9 to (x,y) and stamp. 7 November 2018 11 / 41

Top-Down Design The last example demonstrates top-down design: breaking into subproblems, and implementing each part separately. CSci 127 (Hunter) Lecture 9 7 November 2018 12 / 41

Top-Down Design The last example demonstrates top-down design: breaking into subproblems, and implementing each part separately. Break the problem into tasks for a To Do list. CSci 127 (Hunter) Lecture 9 7 November 2018 12 / 41

Top-Down Design The last example demonstrates top-down design: breaking into subproblems, and implementing each part separately. Break the problem into tasks for a To Do list. Translate list into function names & inputs/returns. CSci 127 (Hunter) Lecture 9 7 November 2018 12 / 41

Top-Down Design The last example demonstrates top-down design: breaking into subproblems, and implementing each part separately. Break the problem into tasks for a To Do list. Translate list into function names & inputs/returns. Implement the functions, one-by-one. CSci 127 (Hunter) Lecture 9 7 November 2018 12 / 41

Top-Down Design The last example demonstrates top-down design: breaking into subproblems, and implementing each part separately. Break the problem into tasks for a To Do list. Translate list into function names & inputs/returns. Implement the functions, one-by-one. Excellent approach since you can then test each part separately before adding it to a large program. CSci 127 (Hunter) Lecture 9 7 November 2018 12 / 41

Top-Down Design The last example demonstrates top-down design: breaking into subproblems, and implementing each part separately. Break the problem into tasks for a To Do list. Translate list into function names & inputs/returns. Implement the functions, one-by-one. Excellent approach since you can then test each part separately before adding it to a large program. Very common when working with a team: each has their own functions to implement and maintain. CSci 127 (Hunter) Lecture 9 7 November 2018 12 / 41

From Last Time: koalas CSci 127 (Hunter) Lecture 9 7 November 2018 13 / 41

From Last Time: koalas CSci 127 (Hunter) Lecture 9 7 November 2018 13 / 41

From Last Time: koalas CSci 127 (Hunter) Lecture 9 7 November 2018 13 / 41

From Last Time: koalas http://koalastothemax.com CSci 127 (Hunter) Lecture 9 7 November 2018 13 / 41

From Last Time: koalas CSci 127 (Hunter) Lecture 9 7 November 2018 14 / 41

From Last Time: koalas Top-down design puzzle: What does koalastomax do? What does each circle represent? Write a high-level design for it. Translate into a main() with function calls. CSci 127 (Hunter) Lecture 9 7 November 2018 14 / 41

From Last Time: koalas CSci 127 (Hunter) Lecture 9 7 November 2018 15 / 41

From Last Time: koalas CSci 127 (Hunter) Lecture 9 7 November 2018 15 / 41

From Last Time: koalas CSci 127 (Hunter) Lecture 9 7 November 2018 15 / 41

From Last Time: koalas Top-down design puzzle: What does koalastomax do? What does each circle represent? Write a high-level design for it. Translate into a main() with function calls. CSci 127 (Hunter) Lecture 9 7 November 2018 15 / 41

From Last Time: koalas CSci 127 (Hunter) Lecture 9 7 November 2018 16 / 41

From Last Time: koalas The main() is written for you. CSci 127 (Hunter) Lecture 9 7 November 2018 16 / 41

From Last Time: koalas The main() is written for you. Only fill in two functions: average() and setregion(). CSci 127 (Hunter) Lecture 9 7 November 2018 16 / 41

From Last Time: koalas Process: Get template Fill in missing Test locally Submit to from github functions idle3/python3 Gradescope CSci 127 (Hunter) Lecture 9 7 November 2018 17 / 41

Today s Topics Recap: Functions & Top Down Design Mapping GIS Data Loops CS Survey CSci 127 (Hunter) Lecture 9 7 November 2018 18 / 41

Folium CSci 127 (Hunter) Lecture 9 7 November 2018 19 / 41

Folium A module for making HTML maps. CSci 127 (Hunter) Lecture 9 7 November 2018 20 / 41

Folium A module for making HTML maps. It s a Python interface to the popular leaflet.js. CSci 127 (Hunter) Lecture 9 7 November 2018 20 / 41

Folium A module for making HTML maps. It s a Python interface to the popular leaflet.js. Outputs.html files which you can open in a browser. CSci 127 (Hunter) Lecture 9 7 November 2018 20 / 41

Folium A module for making HTML maps. It s a Python interface to the popular leaflet.js. Outputs.html files which you can open in a browser. An extra step: CSci 127 (Hunter) Lecture 9 7 November 2018 20 / 41

Folium A module for making HTML maps. It s a Python interface to the popular leaflet.js. Outputs.html files which you can open in a browser. An extra step: Write Run Open.html code. program. in browser. CSci 127 (Hunter) Lecture 9 7 November 2018 20 / 41

Demo (Map created by Folium.) CSci 127 (Hunter) Lecture 9 7 November 2018 21 / 41

Folium To use: import folium CSci 127 (Hunter) Lecture 9 7 November 2018 22 / 41

Folium To use: import folium Create a map: mymap = folium.map() CSci 127 (Hunter) Lecture 9 7 November 2018 22 / 41

Folium To use: import folium Create a map: mymap = folium.map() Make markers: newmark = folium.marker([lat,lon],popup=name) CSci 127 (Hunter) Lecture 9 7 November 2018 22 / 41

Folium To use: import folium Create a map: mymap = folium.map() Make markers: newmark = folium.marker([lat,lon],popup=name) Add to the map: newmark.add to(mymap) CSci 127 (Hunter) Lecture 9 7 November 2018 22 / 41

Folium To use: import folium Create a map: mymap = folium.map() Make markers: newmark = folium.marker([lat,lon],popup=name) Add to the map: newmark.add to(mymap) Many options to customize background map ( tiles ) and markers. CSci 127 (Hunter) Lecture 9 7 November 2018 22 / 41

Demo (Python program using Folium.) CSci 127 (Hunter) Lecture 9 7 November 2018 23 / 41

In Pairs of Triples Predict which each line of code does: (example from Folium documentation) CSci 127 (Hunter) Lecture 9 7 November 2018 24 / 41

Today s Topics Recap: Functions & Top Down Design Mapping GIS Data Loops CS Survey CSci 127 (Hunter) Lecture 9 7 November 2018 25 / 41

In Pairs or Triples: Predict what the code will do: CSci 127 (Hunter) Lecture 9 7 November 2018 26 / 41

Python Tutor (Demo with pythontutor) CSci 127 (Hunter) Lecture 9 7 November 2018 27 / 41

Indefinite Loops CSci 127 (Hunter) Lecture 9 7 November 2018 28 / 41

Indefinite Loops CSci 127 (Hunter) Lecture 9 7 November 2018 28 / 41

Indefinite Loops Indefinite loops repeat as long as the condition is true. CSci 127 (Hunter) Lecture 9 7 November 2018 29 / 41

Indefinite Loops Indefinite loops repeat as long as the condition is true. Could execute the body of the loop zero times, 10 times, infinite number of times. CSci 127 (Hunter) Lecture 9 7 November 2018 29 / 41

Indefinite Loops Indefinite loops repeat as long as the condition is true. Could execute the body of the loop zero times, 10 times, infinite number of times. The condition determines how many times. CSci 127 (Hunter) Lecture 9 7 November 2018 29 / 41

Indefinite Loops Indefinite loops repeat as long as the condition is true. Could execute the body of the loop zero times, 10 times, infinite number of times. The condition determines how many times. Very useful for checking input, simulations, and games. CSci 127 (Hunter) Lecture 9 7 November 2018 29 / 41

Python s random package Python has a built-in package for generating pseudo-random numbers. CSci 127 (Hunter) Lecture 9 7 November 2018 30 / 41

Python s random package Python has a built-in package for generating pseudo-random numbers. To use: import random CSci 127 (Hunter) Lecture 9 7 November 2018 30 / 41

Python s random package Python has a built-in package for generating pseudo-random numbers. To use: import random Useful command to generate whole numbers: random.randrange(start,stop,step) which gives a number chosen randomly from the specified range. CSci 127 (Hunter) Lecture 9 7 November 2018 30 / 41

Python s random package Python has a built-in package for generating pseudo-random numbers. To use: import random Useful command to generate whole numbers: random.randrange(start,stop,step) which gives a number chosen randomly from the specified range. Useful command to generate real numbers: CSci 127 (Hunter) Lecture 9 7 November 2018 30 / 41

Python s random package Python has a built-in package for generating pseudo-random numbers. To use: import random Useful command to generate whole numbers: random.randrange(start,stop,step) which gives a number chosen randomly from the specified range. Useful command to generate real numbers: random.random() which gives a number chosen (uniformly) at random from [0.0,1.0). CSci 127 (Hunter) Lecture 9 7 November 2018 30 / 41

Python s random package Python has a built-in package for generating pseudo-random numbers. To use: import random Useful command to generate whole numbers: random.randrange(start,stop,step) which gives a number chosen randomly from the specified range. Useful command to generate real numbers: random.random() which gives a number chosen (uniformly) at random from [0.0,1.0). Very useful for simulations, games, and testing. CSci 127 (Hunter) Lecture 9 7 November 2018 30 / 41

Trinket (Demo turtle random walk) CSci 127 (Hunter) Lecture 9 7 November 2018 31 / 41

Today s Topics Recap: Functions & Top Down Design Mapping GIS Data Loops CS Survey CSci 127 (Hunter) Lecture 9 7 November 2018 32 / 41

CS Survey Talk Prof. Susan Epstein (Machine Learning) CSci 127 (Hunter) Lecture 9 7 November 2018 33 / 41

Computational system implements decisions and actions on a physical device A computational agent executes a perpetual sense-decide-act loop Do forever Sense the world Select an action Execute that action How to sense the world: infrared sonar radar Kinect microphone camera Given a set of possible actions, an agent decides by selecting one Fall 2018 CSCI 127 1/6 CSci 127 (Hunter) Lecture 9 7 November 2018 34 / 41

An AI agent doesn't have to be a robot (embodied in the world) An AI agent doesn't have to be autonomous (make decisions entirely on its own) But it does have to be smart That means it has to make smart decisions Artificial intelligence = simulation of intelligent (human) behavior by a computational agent Do forever Sense the world Select an action Execute that action Nest Controlled by Wi-Fi from a smartphone Reprograms itself based on human behavior Fall 2018 CSCI 127 2/6 2/33 CSci 127 (Hunter) Lecture 9 7 November 2018 35 / 41

Tackles hard, interesting problems Does this image show cancer? Should I move this car through the intersection? How do I get to that concert? Builds models of perception, thinking, and action Uses these models to build smarter programs Apollo and ROSie Our autonomous robot navigators Despite uncertainty, noise, and constant changes in the world Learn models of their environment Make smart decisions with those models Fall 2018 CSci 127 (Hunter) Lecture 9 CSCI 127 3/6 7 November 2018 36 / 41

We built SemaFORR, a robot controller that makes decisions autonomously First the robots learn to travel by building a model of the world we put them in Then they prove they can find both hard and easy targets there Apollo has already done this on a small part of the 10 th floor here And in simulation ROSie has traveled Through much of Hunter, The Graduate Center, and MOMA Through moving crowds of people Without collision and without coming too close to people And explained her behavior in natural language Fall 2018 CSCI 127 4/6 4 CSci 127 (Hunter) Lecture 9 7 November 2018 37 / 41

Find good problems Start simple Run lots of experiments Analyze the results carefully and repeat ithm s s lem lgor so n b a a o e r g p dr r n in Fu n Go o L ea Fall 2018 CSci 127 (Hunter) s CSCI 127 Lecture 9 5/6 5 7 November 2018 38 / 41

Fall 2018: SCI 111 Brains, Minds, and Machines = cognitive neuroscience + cognitive psychology + AI Fall 2019: CSCI 350 Artificial Intelligence Fall 2018: CSCI 353 Machine Learning and then there s my lab, where workstations run 24/7, learning to be intelligent agents Susan Epstein, Professor of Computer Science 1090C Hunter North susan.epstein@hunter.cuny.edu http://www.cs.hunter.cuny.edu/~epstein/ Fall 2018 CSCI 127 6/6 6 CSci 127 (Hunter) Lecture 9 7 November 2018 39 / 41

Recap On lecture slip, write down a topic you wish we had spent more time (and why). CSci 127 (Hunter) Lecture 9 7 November 2018 40 / 41

Recap On lecture slip, write down a topic you wish we had spent more time (and why). Top-down design: breaking into subproblems, and implementing each part separately. CSci 127 (Hunter) Lecture 9 7 November 2018 40 / 41

Recap On lecture slip, write down a topic you wish we had spent more time (and why). Top-down design: breaking into subproblems, and implementing each part separately. Excellent approach: can then test each part separately before adding it to a large program. CSci 127 (Hunter) Lecture 9 7 November 2018 40 / 41

Recap On lecture slip, write down a topic you wish we had spent more time (and why). Top-down design: breaking into subproblems, and implementing each part separately. Excellent approach: can then test each part separately before adding it to a large program. When possible, design so that your code is flexible to be reused ( code reuse ). CSci 127 (Hunter) Lecture 9 7 November 2018 40 / 41

Recap On lecture slip, write down a topic you wish we had spent more time (and why). Top-down design: breaking into subproblems, and implementing each part separately. Excellent approach: can then test each part separately before adding it to a large program. When possible, design so that your code is flexible to be reused ( code reuse ). Introduced a Python library, Folium for creating interactive HTML maps. CSci 127 (Hunter) Lecture 9 7 November 2018 40 / 41

Recap On lecture slip, write down a topic you wish we had spent more time (and why). Top-down design: breaking into subproblems, and implementing each part separately. Excellent approach: can then test each part separately before adding it to a large program. When possible, design so that your code is flexible to be reused ( code reuse ). Introduced a Python library, Folium for creating interactive HTML maps. Introduced while loops for repeating commands for an indefinite number of times. CSci 127 (Hunter) Lecture 9 7 November 2018 40 / 41

Recap On lecture slip, write down a topic you wish we had spent more time (and why). Top-down design: breaking into subproblems, and implementing each part separately. Excellent approach: can then test each part separately before adding it to a large program. When possible, design so that your code is flexible to be reused ( code reuse ). Introduced a Python library, Folium for creating interactive HTML maps. Introduced while loops for repeating commands for an indefinite number of times. Pass your lecture slips to the aisles for the UTAs to collect. CSci 127 (Hunter) Lecture 9 7 November 2018 40 / 41

Practice Quiz & Final Questions Lightning rounds: CSci 127 (Hunter) Lecture 9 7 November 2018 41 / 41

Practice Quiz & Final Questions Lightning rounds: write as much you can for 60 seconds; CSci 127 (Hunter) Lecture 9 7 November 2018 41 / 41

Practice Quiz & Final Questions Lightning rounds: write as much you can for 60 seconds; followed by answer; and CSci 127 (Hunter) Lecture 9 7 November 2018 41 / 41

Practice Quiz & Final Questions Lightning rounds: write as much you can for 60 seconds; followed by answer; and repeat. CSci 127 (Hunter) Lecture 9 7 November 2018 41 / 41

Practice Quiz & Final Questions Lightning rounds: write as much you can for 60 seconds; followed by answer; and repeat. Past exams are on the webpage (under Final Exam Information). CSci 127 (Hunter) Lecture 9 7 November 2018 41 / 41

Practice Quiz & Final Questions Lightning rounds: write as much you can for 60 seconds; followed by answer; and repeat. Past exams are on the webpage (under Final Exam Information). Theme: Functions & Top-Down Design (Summer 18, #7 & #5). CSci 127 (Hunter) Lecture 9 7 November 2018 41 / 41