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

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

Exam 2. Name: UVa ID:

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

Today. An Animated Introduction to Programming. Prerequisites. Computer programming

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

Lecture 10. Daily Puzzle

Unit 10: Data Structures CS 101, Fall 2018

Iteration and For Loops

Sample Final Exam 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

CS150 Sample Final. Name: Section: A / B

Lecture 13. For-Loops

Introduction to Web Design & Computer Principles

CSC207 Week 3. Larry Zhang

CS1 Lecture 3 Jan. 18, 2019

Lesson Plan #001. Class: Geometry Date: Wednesday September 9 th, 2015

CS1110. Lecture 6: Function calls

K-Nearest Neighbour (Continued) Dr. Xiaowei Huang

Lecture 17: Hash Tables, Maps, Finish Linked Lists

CS1 Lecture 3 Jan. 22, 2018

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

Computer and Programming: Lab 1

CS 112: Intro to Comp Prog

CSCI 1101B. While Loops

Lecture 7. Memory in Python

Lecture 11: Iteration and For-Loops

Lecture 13. For-Loops

Computer Science Technology Department

Elementary Computing CSC /01/2015 M. Cheng, Computer Science 1

Lecture 26: Sorting CS 1110 Introduction to Computing Using Python

CSC 443: Web Programming

Lecture 5. Defining Functions

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

You must pass the final exam to pass the course.

Individual research task. You should all have completed the research task set last week. Please make sure you hand it in today.

Sorting. Introduction. Classification

Today. CISC101 Reminders & Notes. Searching in Python - Cont. Searching in Python. From last time

Lecture 11: while loops CS1068+ Introductory Programming in Python. for loop revisited. while loop. Summary. Dr Kieran T. Herley

Computer Science Department

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

TREES Lecture 12 CS2110 Spring 2019

COSC 115A: Introduction to Web Authoring Fall 2014

Introduction to: Computers & Programming: Review prior to 2 nd Midterm

INFS 2150 (Section A) Fall 2018

What is sorting? Lecture 36: How can computation sort data in order for you? Why is sorting important? What is sorting? 11/30/10

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

15-388/688 - Practical Data Science: Relational Data. J. Zico Kolter Carnegie Mellon University Spring 2018

Credit: The lecture slides are created based on previous lecture slides by Dan Zingaro.

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

Technical University of Denmark

61A Lecture 2. Wednesday, September 4, 2013

Final Exam, Version 1 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

CS 4230 Java Application Development Syllabus

UCD School of Information and Library Studies. IS30020: Web Publishing

CS150 Sample Final Solution

Lab 4: NetLogo Experiments in the Random Walk and Wiggle Walk

Data Structures and Algorithms

CS 3030 Scripting Languages Syllabus

CSci 4211: Data Communications and Computer Networks. Time: Monday and Wednesday 1 pm to 2:15 pm Location: Vincent Hall 16 Spring 2016, 3 Credits

Wrap up indefinite loops Text processing, manipula7on. Broader Issue: Self-driving cars. How do write indefinite loops in Python?

CS61A Lecture 1. Amir Kamil UC Berkeley January 23, 2013

Human-Computer Interaction Design

Frequently asked questions on the Exam Period

Introduction to: Computers & Programming: Review prior to 1 st Midterm

Uninformed Search Strategies

Lecture 1. Course Overview, Python Basics

Lecture 27: Learning from relational data

CSCI 201L Written Exam #1 Fall % of course grade

Department of Electrical Engineering and Computer Sciences Spring 2001 Instructor: Dan Garcia CS 3 Midterm #2. Personal Information

Computer Technology Division. Course Syllabus for: COMT Spring Instructor: Joe Bolen

Parameters and Objects

61A Lecture 4. Monday, September 9

CMSC201 Computer Science I for Majors

Math 152: Applicable Mathematics and Computing

CS100 Spring 2017 Final

COMP 250. Lecture 7. Sorting a List: bubble sort selection sort insertion sort. Sept. 22, 2017

Course Syllabus. Course Information

CS 241 Data Organization. August 21, 2018

Homework: Programming with Abstraction

Product Backlog Document Template and Example

COURSE SYLLABUS FOR. COMP-297 Web Page Design: Adobe Dreamweaver

Programming Languages and Techniques (CIS120)

Lecture 4. Defining Functions

MEIN 50010: Python Recursive Functions

COMP 110 Introduction to Programming. What did we discuss?

CSE 115. Introduction to Computer Science I

61A Lecture 21. Friday, March 13

CSci 4211: Introduction to Computer Networks. Time: Monday and Wednesday 2:30 to 3:45 pm Location: Smith Hall 231 Fall 2018, 3 Credits

Extegrity Exam4 Take Home Exam Guide

Claremont McKenna College Computer Science

CS 343: Artificial Intelligence

CSE 167: Introduction to Computer Graphics. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016

Transcription:

CSci 127: Introduction to Computer Science hunter.cuny.edu/csci CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 1 / 32

Announcements Final will be Wednesday, 20 December, 9am to 11am. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 2 / 32

Announcements Final will be Wednesday, 20 December, 9am to 11am. For those with a final at the same time (e.g. PHILO 101 & POLSC 100 students), we are arranging an alternative time. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 2 / 32

Announcements Final will be Wednesday, 20 December, 9am to 11am. For those with a final at the same time (e.g. PHILO 101 & POLSC 100 students), we are arranging an alternative time. Best way to prepare for final: CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 2 / 32

Announcements Final will be Wednesday, 20 December, 9am to 11am. For those with a final at the same time (e.g. PHILO 101 & POLSC 100 students), we are arranging an alternative time. Best way to prepare for final: Do the programming problems & labs. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 2 / 32

Announcements Final will be Wednesday, 20 December, 9am to 11am. For those with a final at the same time (e.g. PHILO 101 & POLSC 100 students), we are arranging an alternative time. Best way to prepare for final: Do the programming problems & labs. Do the sample final problems (in lecture & full sample exam come December). CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 2 / 32

Announcements Final will be Wednesday, 20 December, 9am to 11am. For those with a final at the same time (e.g. PHILO 101 & POLSC 100 students), we are arranging an alternative time. Best way to prepare for final: Do the programming problems & labs. Do the sample final problems (in lecture & full sample exam come December). Attend lecture & review the lecture notes. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 2 / 32

Announcements Final will be Wednesday, 20 December, 9am to 11am. For those with a final at the same time (e.g. PHILO 101 & POLSC 100 students), we are arranging an alternative time. Best way to prepare for final: Do the programming problems & labs. Do the sample final problems (in lecture & full sample exam come December). Attend lecture & review the lecture notes. Do the associated reading. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 2 / 32

Announcements Final will be Wednesday, 20 December, 9am to 11am. For those with a final at the same time (e.g. PHILO 101 & POLSC 100 students), we are arranging an alternative time. Best way to prepare for final: Do the programming problems & labs. Do the sample final problems (in lecture & full sample exam come December). Attend lecture & review the lecture notes. Do the associated reading. Today s lecturers include: Genady Maryash (adjunct coordinator) & Katherine Howitt (tutor coordinator). CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 2 / 32

Today s Topics Folium Recap Indefinite Loops Searching Data Random Numbers CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 3 / 32

folium A module for making HTML maps. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 4 / 32

folium A module for making HTML maps. It s a Python interface to the popular leaflet.js. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 4 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 4 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 4 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 4 / 32

From Last Time: folium example What does this code do? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 5 / 32

From Last Time: folium example What does this code do? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 6 / 32

From Last Time: folium example What does this code do? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 6 / 32

From Last Time: koalas CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 7 / 32

From Last Time: koalas CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 7 / 32

From Last Time: koalas CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 7 / 32

From Last Time: koalas http://koalastothemax.com CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 7 / 32

From Last Time: koalas CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 8 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 8 / 32

From Last Time: koalas CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 9 / 32

From Last Time: koalas CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 9 / 32

From Last Time: koalas CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 9 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 9 / 32

From Last Time: koalas CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 10 / 32

From Last Time: koalas The main() is written for you. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 10 / 32

From Last Time: koalas The main() is written for you. Only fill in two functions: average() and setregion(). CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 10 / 32

From Last Time: koalas Process: Get template Fill in missing Test locally Submit to from github functions idle3/python3 Gradescope CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 11 / 32

In Pairs or Triples: Predict what the code will do: CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 12 / 32

Python Tutor (Demo with pythontutor) CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 13 / 32

Indefinite Loops CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 14 / 32

Indefinite Loops CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 14 / 32

Indefinite Loops Indefinite loops repeat as long as the condition is true. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 15 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 15 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 15 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 15 / 32

In Pairs or Triples: Answer the following questions on your lecture slip (paper or tinyurl.com/yamkjh96): Of the students in the room, Whose name comes first alphabetically? Whose name comes last alphabetically? Is there someone in the room with your initials? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 16 / 32

In Pairs or Triples: While we tabulate results: Design a program that takes a CSV file and a set of initials: Whose name comes first alphabetically? Whose name comes last alphabetically? Is there someone in the room with your initials? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 17 / 32

Results: Lecture Slip Question (Show tabulated results...) CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 18 / 32

Design Question: Find first alphabetically In Pandas, lovely built-in functions: CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 19 / 32

Design Question: Find first alphabetically In Pandas, lovely built-in functions: df.sort values( First Name ) and df[ First Name ].min() CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 19 / 32

Design Question: Find first alphabetically In Pandas, lovely built-in functions: df.sort values( First Name ) and df[ First Name ].min() What if you don t have a CSV and DataFrame, or data not ordered? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 19 / 32

Design Question: Find first alphabetically In Pandas, lovely built-in functions: df.sort values( First Name ) and df[ First Name ].min() What if you don t have a CSV and DataFrame, or data not ordered? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 19 / 32

Design Question: Find first alphabetically What if you don t have a CSV and DataFrame, or data not ordered? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 20 / 32

Design Question: Find first alphabetically What if you don t have a CSV and DataFrame, or data not ordered? Useful Design Pattern: min/max CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 20 / 32

Design Question: Find first alphabetically What if you don t have a CSV and DataFrame, or data not ordered? Useful Design Pattern: min/max Set a variable to worst value (i.e. maxn = 0 or first = "ZZ"). CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 20 / 32

Design Question: Find first alphabetically What if you don t have a CSV and DataFrame, or data not ordered? Useful Design Pattern: min/max Set a variable to worst value (i.e. maxn = 0 or first = "ZZ"). For each item, X, in the list: CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 20 / 32

Design Question: Find first alphabetically What if you don t have a CSV and DataFrame, or data not ordered? Useful Design Pattern: min/max Set a variable to worst value (i.e. maxn = 0 or first = "ZZ"). For each item, X, in the list: Compare X to your variable. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 20 / 32

Design Question: Find first alphabetically What if you don t have a CSV and DataFrame, or data not ordered? Useful Design Pattern: min/max Set a variable to worst value (i.e. maxn = 0 or first = "ZZ"). For each item, X, in the list: Compare X to your variable. If better, update your variable to be X. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 20 / 32

Design Question: Find Matching Initials How do we stop, if we find a match? CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 21 / 32

Design Question: Find Matching Initials How do we stop, if we find a match? Change the loop to be indefinite (i.e. while loop): Set a variable to found = False CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 21 / 32

Design Question: Find Matching Initials How do we stop, if we find a match? Change the loop to be indefinite (i.e. while loop): Set a variable to found = False while there are items in the list and not found CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 21 / 32

Design Question: Find Matching Initials How do we stop, if we find a match? Change the loop to be indefinite (i.e. while loop): Set a variable to found = False while there are items in the list and not found If item matches your value, set found = True CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 21 / 32

In Pairs or Triples: Predict what the code will do: Write a function that asks a user for number after 2000 but before 2018. The function should repeatedly ask the user for a number until they enter one within the range and return the number. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 22 / 32

Python Tutor (Demo with pythontutor) CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 23 / 32

Coding Write a function that asks a user for number after 2000 but before 2018. The function should repeatedly ask the user for a number until they enter one within the range and return the number.. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 24 / 32

Coding Write a function that asks a user for number after 2000 but before 2018. The function should repeatedly ask the user for a number until they enter one within the range and return the number. def getyear(): CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 25 / 32

Coding Write a function that asks a user for number after 2000 but before 2018. The function should repeatedly ask the user for a number until they enter one within the range and return the number. def getyear(): return(num) CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 26 / 32

Coding Write a function that asks a user for number after 2000 but before 2018. The function should repeatedly ask the user for a number until they enter one within the range and return the number. def getyear(): num = 0 return(num) CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 27 / 32

Coding Write a function that asks a user for number after 2000 but before 2018. The function should repeatedly ask the user for a number until they enter one within the range and return the number. def getyear(): num = 0 while num <= 2000 or num >= 2018: return(num) CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 28 / 32

Coding Write a function that asks a user for number after 2000 but before 2018. The function should repeatedly ask the user for a number until they enter one within the range and return the number. def getyear(): num = 0 while num <= 2000 or num >= 2018: num = int(input( Enter a number > 2000 & < 2018 )) return(num) CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 29 / 32

Python s random package Python has a built-in package for generating pseudo-random numbers. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 30 / 32

Python s random package Python has a built-in package for generating pseudo-random numbers. To use: import random CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 30 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 30 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 30 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 30 / 32

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 10: tinyurl.com/yamkjh96 8 November 2017 30 / 32

Trinket (Demo turtle random walk) CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 31 / 32

Recap: Indefinite Loops & Random Numbers Indefinite (while) loops allow you to repeat a block of code as long as a condition holds. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 32 / 32

Recap: Indefinite Loops & Random Numbers Indefinite (while) loops allow you to repeat a block of code as long as a condition holds. Very useful for checking user input for correctness. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 32 / 32

Recap: Indefinite Loops & Random Numbers Indefinite (while) loops allow you to repeat a block of code as long as a condition holds. Very useful for checking user input for correctness. Python s built-in random package has useful methods for generating random whole numbers and real numbers. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 32 / 32

Recap: Indefinite Loops & Random Numbers Indefinite (while) loops allow you to repeat a block of code as long as a condition holds. Very useful for checking user input for correctness. Python s built-in random package has useful methods for generating random whole numbers and real numbers. To use, must include: import random. CSci 127 (Hunter) Lecture 10: tinyurl.com/yamkjh96 8 November 2017 32 / 32