CSci 127: Introduction to Computer Science

Size: px
Start display at page:

Download "CSci 127: Introduction to Computer Science"

Transcription

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

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

3 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 / 32

4 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 / 32

5 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 / 32

6 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 / 32

7 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 / 32

8 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 / 32

9 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 / 32

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

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

12 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 / 32

13 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 / 32

14 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 / 32

15 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 / 32

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

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

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

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

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

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

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

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

24 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 / 32

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

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

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

28 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 / 32

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

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

31 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 / 32

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 / 32

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

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

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

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

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

38 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 / 32

39 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 / 32

40 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 / 32

41 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 / 32

42 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 / 32

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

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

45 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 / 32

46 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 / 32

47 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 / 32

48 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 / 32

49 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 / 32

50 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 / 32

51 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 / 32

52 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 / 32

53 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 / 32

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

55 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 / 32

56 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 / 32

57 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 / 32

58 In Pairs or Triples: Predict what the code will do: Write a function that asks a user for number after 2000 but before 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 / 32

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

60 Coding Write a function that asks a user for number after 2000 but before 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 / 32

61 Coding Write a function that asks a user for number after 2000 but before 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 / 32

62 Coding Write a function that asks a user for number after 2000 but before 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 / 32

63 Coding Write a function that asks a user for number after 2000 but before 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 / 32

64 Coding Write a function that asks a user for number after 2000 but before 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 / 32

65 Coding Write a function that asks a user for number after 2000 but before 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 / 32

66 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 / 32

67 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 / 32

68 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 / 32

69 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 / 32

70 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 / 32

71 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 / 32

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

73 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 / 32

74 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 / 32

75 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 / 32

76 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 / 32

CSci 127: Introduction to Computer Science

CSci 127: Introduction to Computer Science 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:

More information

CSci 127: Introduction to Computer Science

CSci 127: Introduction to Computer Science CSci 127: Introduction to Computer Science hunter.cuny.edu/csci CSci 127 (Hunter) Lecture 12: tinyurl.com/ycrcn3k6 22 November 2017 1 / 36 Lecture Slips: tinyurl.com/ycrcn3k6 CSci 127 (Hunter) Lecture

More information

CSci 127: Introduction to Computer Science

CSci 127: Introduction to Computer Science CSci 127: Introduction to Computer Science hunter.cuny.edu/csci CSci 127 (Hunter) Lecture 11: tinyurl.com/yb8lcvl7 15 November 2017 1 / 48 Lecture Slip: tinyurl.com/yb8lcvl7 CSci 127 (Hunter) Lecture 11:

More information

CSci 127: Introduction to Computer Science

CSci 127: Introduction to Computer Science CSci 127: Introduction to Computer Science hunter.cuny.edu/csci CSci 127 (Hunter) Lecture 1 30 August 2017 1 / 19 Welcome Prof. Sakas, Department Chair and Co-Instructor CSci 127 (Hunter) Lecture 1 30

More information

Final Exam, Version 2 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 2 CSci 127: Introduction to Computer Science Hunter College, City University of New York 13 December 2017 Exam Rules Show all your work. Your grade will be based on the work shown.

More information

Mock Final Exam 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 Mock Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York 6 December 2017 Exam Rules Show all your work. Your grade will be based on the work shown. The exam

More information

Final Exam, Version 3 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 3 CSci 127: Introduction to Computer Science Hunter College, City University of New York 22 May 2018 Exam Rules Show all your work. Your grade will be based on the work shown. The exam

More information

Exam 2. Name: UVa ID:

Exam 2. Name: UVa  ID: University of Virginia Out: 28 November 2011 cs1120: Introduction of Computing Due: 11:01 am, Wednesday, 30 November Explorations in Language, Logic, and Machines Exam 2 Name: UVa Email ID: Directions

More information

Mock Final Exam 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 Mock Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York 15 May 2018 1. (a) What will the following Python code print: i. s = "Ada:)Lovelace:)Grace:)Hopper"

More information

Final Exam, Version 3 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 3 CSci 127: Introduction to Computer Science Hunter College, City University of New York 22 May 2018 1. (a) What will the following Python code print: i. a = "one+two+three+four+five+six"

More information

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

Today. An Animated Introduction to Programming. Prerequisites. Computer programming Today 1 2 3 4 Computer programming What is this course about? We re making several assumptions about you as a student. In particular, we assume that you have: Never taken a programming course before. Have

More information

Mock Final Exam 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 Mock Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York 15 May 2018 Exam Rules Show all your work. Your grade will be based on the work shown. The exam is

More information

Lecture 10. Daily Puzzle

Lecture 10. Daily Puzzle Lecture 10 Daily Puzzle Imagine there is a ditch, 10 feet wide, which is far too wide to jump. Using only eight narrow planks, each no more than 9 feet long, construct a bridge across the ditch. Daily

More information

Unit 10: Data Structures CS 101, Fall 2018

Unit 10: Data Structures CS 101, Fall 2018 Unit 10: Data Structures CS 101, Fall 2018 Learning Objectives After completing this unit, you should be able to: Define and give everyday examples of arrays, stacks, queues, and trees. Explain what a

More information

Iteration and For Loops

Iteration and For Loops CS 1110: Introduction to Computing Using Python Lecture 11 Iteration and For Loops [Andersen, Gries, Lee, Marschner, Van Loan, White] Rooms: Announcements: Prelim 1 aa200 jjm200 Baker Laboratory 200 jjm201

More information

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

Sample Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York Sample Final Exam CSci 127: Introduction to Computer Science Hunter College, City University of New York Fall 2017 Exam Rules Show all your work. Your grade will be based on the work shown. The exam is

More information

Final Exam, Version 2 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 2 CSci 127: Introduction to Computer Science Hunter College, City University of New York 22 May 2018 Exam Rules Show all your work. Your grade will be based on the work shown. The exam

More information

CS150 Sample Final. Name: Section: A / B

CS150 Sample Final. Name: Section: A / B CS150 Sample Final Name: Section: A / B Date: Start time: End time: Honor Code: Signature: This exam is closed book, closed notes, closed computer, closed calculator, etc. You may only use (1) the final

More information

Lecture 13. For-Loops

Lecture 13. For-Loops Lecture 3 For-Loops Announcements for This Lecture Reading Assignments/Lab Today: Chapters 8, 0 Thursday: Chapter Prelim, 0/ 5:5 OR 7:30 Material up to TUESDAY Study guide is posted Times/rooms by last

More information

Introduction to Web Design & Computer Principles

Introduction to Web Design & Computer Principles Introduction to Web Design & Computer Principles CSCI-UA.0004-007 Instructor: Adam Scher Tuesday/Thursday 8:00am - 9:15am Warren Weaver Hall Room 101 What s in store today... Who Am I? Course Overview

More information

CSC207 Week 3. Larry Zhang

CSC207 Week 3. Larry Zhang CSC207 Week 3 Larry Zhang 1 Announcements Readings will be posted before the lecture Lab 1 marks available in your repo 1 point for creating the correct project. 1 point for creating the correct classes.

More information

CS1 Lecture 3 Jan. 18, 2019

CS1 Lecture 3 Jan. 18, 2019 CS1 Lecture 3 Jan. 18, 2019 Office hours for Prof. Cremer and for TAs have been posted. Locations will change check class website regularly First homework assignment will be available Monday evening, due

More information

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

Lesson Plan #001. Class: Geometry Date: Wednesday September 9 th, 2015 Lesson Plan #001 1 Class: Geometry Date: Wednesday September 9 th, 2015 Topic: Points, lines, and planes Aim: What are points, lines and planes? Objectives: 1) Students will be able to describe what is

More information

CS1110. Lecture 6: Function calls

CS1110. Lecture 6: Function calls CS1110 Lecture 6: Function calls Announcements Additional space in labs: We have added some space and staffing to the 12:20 and 1:25 labs on Tuesday. There is still space to move into these labs. Printed

More information

K-Nearest Neighbour (Continued) Dr. Xiaowei Huang

K-Nearest Neighbour (Continued) Dr. Xiaowei Huang K-Nearest Neighbour (Continued) Dr. Xiaowei Huang https://cgi.csc.liv.ac.uk/~xiaowei/ A few things: No lectures on Week 7 (i.e., the week starting from Monday 5 th November), and Week 11 (i.e., the week

More information

Lecture 17: Hash Tables, Maps, Finish Linked Lists

Lecture 17: Hash Tables, Maps, Finish Linked Lists ....... \ \ \ / / / / \ \ \ \ / \ / \ \ \ V /,----' / ^ \ \.--..--. / ^ \ `--- ----` / ^ \. ` > < / /_\ \. ` / /_\ \ / /_\ \ `--' \ /. \ `----. / \ \ '--' '--' / \ / \ \ / \ / / \ \ (_ ) \ (_ ) / / \ \

More information

CS1 Lecture 3 Jan. 22, 2018

CS1 Lecture 3 Jan. 22, 2018 CS1 Lecture 3 Jan. 22, 2018 Office hours for me and for TAs have been posted, locations will change check class website regularly First homework available, due Mon., 9:00am. Discussion sections tomorrow

More information

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

Finding Pi: Applications of Loops, Random Numbers, Booleans CS 8: Introduction to Computer Science, Winter 2018 Lecture #6 Finding Pi: Applications of Loops, Random Numbers, Booleans CS 8: Introduction to Computer Science, Winter 2018 Lecture #6 Ziad Matni Dept. of Computer Science, UCSB Administrative New Homework (#3) is

More information

Computer and Programming: Lab 1

Computer and Programming: Lab 1 01204111 Computer and Programming: Lab 1 Name ID Section Goals To get familiar with Wing IDE and learn common mistakes with programming in Python To practice using Python interactively through Python Shell

More information

CS 112: Intro to Comp Prog

CS 112: Intro to Comp Prog CS 112: Intro to Comp Prog Importing modules Branching Loops Program Planning Arithmetic Program Lab Assignment #2 Upcoming Assignment #1 Solution CODE: # lab1.py # Student Name: John Noname # Assignment:

More information

CSCI 1101B. While Loops

CSCI 1101B. While Loops CSCI 1101B While Loops Today s Outline Iteration (review) When Can We Not Use For-Each Loops? While Loops Controlling Loops The Break Statement The Continue Statement Example - First, Recall The Turtle

More information

Lecture 7. Memory in Python

Lecture 7. Memory in Python Lecture 7 Memory in Python Announcements For This Lecture Readings Reread Chapter 3 No reading for Thursday Lab Work on Assignment Credit when submit A Nothing else to do Assignment Moved to Fri, Sep.

More information

Lecture 11: Iteration and For-Loops

Lecture 11: Iteration and For-Loops http://www.cs.cornell.edu/courses/cs0/08sp Lecture : Iteration and For-Loops (Sections 4. and 0.3) CS 0 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner, C.

More information

Lecture 13. For-Loops

Lecture 13. For-Loops Lecture 3 For-Loops Announcements for This Lecture Reading Today: Chapters 8, 0 Thursday: Chapter Prelim, Oct th 7:30-9:00 Material up to TODAY Study guide is posted Review next Wednesday Room/Time are

More information

Computer Science Technology Department

Computer Science Technology Department Computer Science Technology Department Houston Community College Department Phone Number: ab Houston Community College ITMT 2301 - Windows Server 2008 Network Infrastructure Configuration Administering

More information

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

Elementary Computing CSC /01/2015 M. Cheng, Computer Science 1 Elementary Computing CSC 100 03/01/2015 M. Cheng, Computer Science 1 Welcome! 03/01/2015 M. Cheng, Computer Science 2 Is CSC 100 For You? CSC 105 is similar to CSC 100, but is designed primarily for students

More information

Lecture 26: Sorting CS 1110 Introduction to Computing Using Python

Lecture 26: Sorting CS 1110 Introduction to Computing Using Python http://www.cs.cornell.edu/courses/cs1110/2018sp Lecture 26: Sorting CS 1110 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner, C. Van Loan, W. White] Academic

More information

CSC 443: Web Programming

CSC 443: Web Programming 1 CSC 443: Web Programming Haidar Harmanani Department of Computer Science and Mathematics Lebanese American University Byblos, 1401 2010 Lebanon Today 2 Course information Course Objectives A Tiny assignment

More information

Lecture 5. Defining Functions

Lecture 5. Defining Functions Lecture 5 Defining Functions Announcements for this Lecture Last Call Quiz: About the Course Take it by tomorrow Also remember the survey Readings Sections 3.5 3.3 today Also 6.-6.4 See online readings

More information

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

CS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, Good Luck! CS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, 2011 Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer

More information

You must pass the final exam to pass the course.

You must pass the final exam to pass the course. Computer Science Technology Department Houston Community College System Department Website: http://csci.hccs.cc.tx.us CRN: 46876 978-1-4239-0146-4 1-4239-0146-0 Semester: Fall 2010 Campus and Room: Stafford

More information

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

Individual research task. You should all have completed the research task set last week. Please make sure you hand it in today. Lecture 6 Individual research task. You should all have completed the research task set last week. Please make sure you hand it in today. Previously Decision structures with flowcharts Boolean logic UML

More information

Sorting. Introduction. Classification

Sorting. Introduction. Classification Sorting Introduction In many applications it is necessary to order give objects as per an attribute. For example, arranging a list of student information in increasing order of their roll numbers or arranging

More information

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

Today. CISC101 Reminders & Notes. Searching in Python - Cont. Searching in Python. From last time CISC101 Reminders & Notes Test 3 this week in tutorial USATs at the beginning of next lecture Please attend and fill out an evaluation School of Computing First Year Information Session Thursday, March

More information

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

Lecture 11: while loops CS1068+ Introductory Programming in Python. for loop revisited. while loop. Summary. Dr Kieran T. Herley Lecture 11: while loops CS1068+ Introductory Programming in Python Dr Kieran T. Herley Python s while loop. Summary Department of Computer Science University College Cork 2017-2018 KH (24/10/17) Lecture

More information

Computer Science Department

Computer Science Department California State University, Dominguez Hills Computer Science Department Syllabus CS255 Dynamic Web Programming Dr. Jason Isaac Halasa Office Hours: MW 12:45-2:30 and 3:45-5:30 and by Appointment Office

More information

Final Exam, Version 1 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 Final Exam, Version 1 CSci 127: Introduction to Computer Science Hunter College, City University of New York 17 May 2018 1. (a) What will the following Python code print: i. a = "Jan&Feb&Mar&Apr&May&Jun"

More information

TREES Lecture 12 CS2110 Spring 2019

TREES Lecture 12 CS2110 Spring 2019 TREES Lecture 12 CS2110 Spring 2019 Announcements 2 Submit P1 Conflict quiz on CMS by end of day Wednesday. We won t be sending confirmations; no news is good news. Extra time people will eventually get

More information

COSC 115A: Introduction to Web Authoring Fall 2014

COSC 115A: Introduction to Web Authoring Fall 2014 COSC 115A: Introduction to Web Authoring Fall 2014 Instructor: David. A. Sykes Class meetings: TR 1:00-2:20PM in Daniel Building, Room 102 Office / Hours: Olin 204E / TR 8:00-10:45AM, MWF 9:00 10:20AM,

More information

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

Introduction to: Computers & Programming: Review prior to 2 nd Midterm Introduction to: Computers & Programming: Review prior to 2 nd Midterm Adam Meyers New York University Summary Procedural Matters Types of Test Questions and Sample Questions Summary of what you need to

More information

INFS 2150 (Section A) Fall 2018

INFS 2150 (Section A) Fall 2018 INFS 2150 (Section A) Fall 2018 Introduction to Web Development Class meets TUE & THU: 12:30am-1:45pm: in Wheatley 114 Instructor: Peter Y. Wu Office: Wheatley 309 Office Hours: Tuesday 9:00 am-12:00 noon;

More information

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

What is sorting? Lecture 36: How can computation sort data in order for you? Why is sorting important? What is sorting? 11/30/10 // CS Introduction to Computation " UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department Professor Andrea Arpaci-Dusseau Fall Lecture : How can computation sort data in order for you? What is sorting?

More information

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

61A LECTURE 1 FUNCTIONS, VALUES. Steven Tang and Eric Tzeng June 24, 2013 61A LECTURE 1 FUNCTIONS, VALUES Steven Tang and Eric Tzeng June 24, 2013 Welcome to CS61A! The Course Staff - Lecturers Steven Tang Graduated L&S CS from Cal Back for a PhD in Education Eric Tzeng Graduated

More information

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

15-388/688 - Practical Data Science: Relational Data. J. Zico Kolter Carnegie Mellon University Spring 2018 15-388/688 - Practical Data Science: Relational Data J. Zico Kolter Carnegie Mellon University Spring 2018 1 Announcements Piazza etiquette: Changing organization of threads to be easier to search (starting

More information

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

Credit: The lecture slides are created based on previous lecture slides by Dan Zingaro. CSC148 2018 Here 1 Credit: The lecture slides are created based on previous lecture slides by Dan Zingaro. 2 Larry Zhang Office: DH-3042 Email: ylzhang@cs.toronto.edu 3 The teaching team Dan Zingaro: LEC0103

More information

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

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 Recommended Readings Chapter 5 Topic 5: Repetition Are you saying that I am redundant? That I repeat myself? That I say the same thing over and over again? 1 2 Repetition So far, we have learned How to

More information

Technical University of Denmark

Technical University of Denmark page 1 of 12 pages Technical University of Denmark Written exam, December 11, 2015. Course name: Algorithms and data structures. Course number: 02110. Aids allowed: All written materials are permitted.

More information

61A Lecture 2. Wednesday, September 4, 2013

61A Lecture 2. Wednesday, September 4, 2013 61A Lecture 2 Wednesday, September 4, 2013 Names, Assignment, and User-Defined Functions (Demo) Types of Expressions Primitive expressions: 2 add 'hello' Number or Numeral Name String Call expressions:

More information

Final Exam, Version 1 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 Final Exam, Version 1 CSci 127: Introduction to Computer Science Hunter College, City University of New York 17 May 2018 Exam Rules Show all your work. Your grade will be based on the work shown. The exam

More information

Final Exam, Version 4 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 4 CSci 127: Introduction to Computer Science Hunter College, City University of New York 20 December 2017 Exam Rules Show all your work. Your grade will be based on the work shown.

More information

CS 4230 Java Application Development Syllabus

CS 4230 Java Application Development Syllabus General Information Semester: Fall 2018 Textbook: Core Java Volume II, 9th Edition, by Horstmann & Cornell, 2013, Prentice Hall, ISBN 978-0-1370-8160-8 Location: SLCC BB 330 Instructor Info: Website: Trevor

More information

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

UCD School of Information and Library Studies. IS30020: Web Publishing UCD School of Information and Library Studies IS30020: Web Publishing Module Coordinator: Dr Judith Wusteman Office: SILS 110, Email: judith.wusteman@ucd.ie, Tel: 716 7612 Office hour Semester 1 (Sept

More information

CS150 Sample Final Solution

CS150 Sample Final Solution CS150 Sample Final Solution Name: Section: A / B Date: Start time: End time: Honor Code: Signature: This exam is closed book, closed notes, closed computer, closed calculator, etc. You may only use (1)

More information

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

Lab 4: NetLogo Experiments in the Random Walk and Wiggle Walk Lab 4: NetLogo Experiments in the Random Walk and Wiggle Walk In this lab, you will be writing program that lets you experiment with two different types of turtle movement: the random walk and the wiggle

More information

Data Structures and Algorithms

Data Structures and Algorithms Data Structures and Algorithms Lecture 1: Course Overview Lilia Georgieva 2004 Goodrich, Tamassia What is this course about? We will study moderately complex data structures and algorithms that are essential

More information

CS 3030 Scripting Languages Syllabus

CS 3030 Scripting Languages Syllabus General Information CS 3030 Scripting Languages Semester: Fall 2017 Textbook: Location: Instructor Info: None. We will use freely available resources from the Internet. Online Ted Cowan tedcowan@weber.edu

More information

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

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 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 1 Instructor David Hung-Chang Du Email: du@cs.umn.edu Office:

More information

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

Wrap up indefinite loops Text processing, manipula7on. Broader Issue: Self-driving cars. How do write indefinite loops in Python? Objec7ves Wrap up indefinite loops Text processing, manipula7on Ø String opera7ons, processing, methods Broader Issue: Self-driving cars Feb 16, 2018 Sprenkle - CSCI111 1 Review How do write indefinite

More information

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

CS61A Lecture 1. Amir Kamil UC Berkeley January 23, 2013 CS61A Lecture 1 Amir Kamil UC Berkeley January 23, 2013 Welcome to CS61A! The Course Staff I ve been at Berkeley a long time, and took CS61A a while back. Read the course info to find out when! TAs essentially

More information

Human-Computer Interaction Design

Human-Computer Interaction Design Human-Computer Interaction Design COGS120/CSE170 - Intro. HCI Instructor: Philip Guo Lab 1 - Version control and HTML (2018-10-03) by Michael Bernstein, Scott Klemmer, Philip Guo, and Sean Kross [Announce

More information

Frequently asked questions on the Exam Period

Frequently asked questions on the Exam Period Frequently asked questions on the Exam Period - Autumn 2018/2019-1. What can I do if I passed the exam, but I am not satisfied with my mark? You can take a grade improvement examination: retaking a successful

More information

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

Introduction to: Computers & Programming: Review prior to 1 st Midterm Introduction to: Computers & Programming: Review prior to 1 st Midterm Adam Meyers New York University Summary Some Procedural Matters Summary of what you need to Know For the Test and To Go Further in

More information

Uninformed Search Strategies

Uninformed Search Strategies Uninformed Search Strategies Alan Mackworth UBC CS 322 Search 2 January 11, 2013 Textbook 3.5 1 Today s Lecture Lecture 4 (2-Search1) Recap Uninformed search + criteria to compare search algorithms - Depth

More information

Lecture 1. Course Overview, Python Basics

Lecture 1. Course Overview, Python Basics Lecture 1 Course Overview, Python Basics We Are Very Full! Lectures and Labs are at fire-code capacity We cannot add sections or seats to lectures You may have to wait until someone drops No auditors are

More information

Lecture 27: Learning from relational data

Lecture 27: Learning from relational data Lecture 27: Learning from relational data STATS 202: Data mining and analysis December 2, 2017 1 / 12 Announcements Kaggle deadline is this Thursday (Dec 7) at 4pm. If you haven t already, make a submission

More information

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

CSCI 201L Written Exam #1 Fall % of course grade Name Final Score /15 ID Extra Credit /0.5 Lecture Section (circle one): TTh 8:00-9:20 TTh 9:30-10:50 TTh 11:00-12:20 CSCI 201L Fall 2017 15% of course grade The exam is one hour and 50 minutes and is closed

More information

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

Department of Electrical Engineering and Computer Sciences Spring 2001 Instructor: Dan Garcia CS 3 Midterm #2. Personal Information University of California, Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Spring 2001 Instructor: Dan Garcia 2001-04-09 CS 3 Midterm #2 Personal Information Last

More information

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

Computer Technology Division. Course Syllabus for: COMT Spring Instructor: Joe Bolen Computer Technology Division Course Syllabus for: COMT 11009 Spring 2013 Instructor: Joe Bolen Course: Computer Assembly & Configuration COMT 11009 Spring 2013 / Tuscarawas / Call # 12133 / Section 800

More information

Parameters and Objects

Parameters and Objects Parameters and Objects CS + ENGLISH Enrich your computer science skills with the understanding of human experiences, critical thinking, and creativity taught in English. More info: english.stanford.edu/csenglish

More information

61A Lecture 4. Monday, September 9

61A Lecture 4. Monday, September 9 61A Lecture 4 Monday, September 9 Announcements Homework 1 due Tuesday 9/10 at 5pm; Late homework is not accepted! Quiz on Wednesday 9/11 released at 1pm, due Thursday 9/12 at 11:59pm Open-computer: You

More information

CMSC201 Computer Science I for Majors

CMSC201 Computer Science I for Majors CMSC201 Computer Science I for Majors Lecture 07 While Loops (cont) Last Class We Covered Using while loops Syntax of a while loop Interactive loops Infinite loops and other problems Practice with while

More information

Math 152: Applicable Mathematics and Computing

Math 152: Applicable Mathematics and Computing Math 152: Applicable Mathematics and Computing April 10, 2017 April 10, 2017 1 / 12 Announcements Don t forget, first homework is due on Wednesday. Each TA has their own drop-box. Please provide justification

More information

CS100 Spring 2017 Final

CS100 Spring 2017 Final CS100 Spring 2017 Final May 11, 2017 There are 13 questions on this test. Record your answers to the first 10 questions by circling a letter below. Answer questions 11, 12 and 13 on the attached pages.

More information

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

COMP 250. Lecture 7. Sorting a List: bubble sort selection sort insertion sort. Sept. 22, 2017 COMP 250 Lecture 7 Sorting a List: bubble sort selection sort insertion sort Sept. 22, 20 1 Sorting BEFORE AFTER 2 2 2 Example: sorting exams by last name Sorting Algorithms Bubble sort Selection sort

More information

Course Syllabus. Course Information

Course Syllabus. Course Information Course Syllabus Course Information Course: MIS 6V99 Special Topics Programming for Data Science Section: 5U1 Term: Summer 2017 Meets: Friday, 6:00 pm to 10:00 pm, JSOM 2.106 Note: Beginning Fall 2017,

More information

CS 241 Data Organization. August 21, 2018

CS 241 Data Organization. August 21, 2018 CS 241 Data Organization August 21, 2018 Contact Info Instructor: Dr. Marie Vasek Contact: Private message me on the course Piazza page. Office: Room 2120 of Farris Web site: www.cs.unm.edu/~vasek/cs241/

More information

Homework: Programming with Abstraction

Homework: Programming with Abstraction Homework: Programming with Abstraction COMP 50 Fall 2013 This homework is due at 11:59PM on Wednesday, November 6. Submit your solutions in a single file using the COMP 50 Handin button on DrRacket; the

More information

Product Backlog Document Template and Example

Product Backlog Document Template and Example Product Backlog Document Template and Example Introduction 1. Client Information (Name(s), Business, Location, contact information) 2. Team Information Team Member Names (contact information) 3. Project

More information

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

COURSE SYLLABUS FOR. COMP-297 Web Page Design: Adobe Dreamweaver Coffeyville Community College COURSE SYLLABUS FOR COMP-297 Web Page Design: Adobe Dreamweaver Mrs. Darla Thornburg Spring 2018 Page 1 of 8 COURSE NUMBER: COURSE TITLE: CREDIT HOURS: INSTRUCTOR: OFFICE

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques (CIS120) Lecture 7 January 29 th, 2016 Binary Search Trees (Lecture notes Chapter 7) let rec height (t:tree) : int = begin match t with Empty -> 0 Node (left, _, right)

More information

Lecture 4. Defining Functions

Lecture 4. Defining Functions Lecture 4 Defining Functions Academic Integrity Quiz Remember: quiz about the course AI policy Have posted grades for completed quizes Right now, missing ~130 enrolled students If did not receive at least

More information

MEIN 50010: Python Recursive Functions

MEIN 50010: Python Recursive Functions : Python Recursive Functions Fabian Sievers Higgins Lab, Conway Institute University College Dublin Wednesday, 2017-11-08 Recursion / Timing On the N-th Day of Christmas... On the 1st day of Christmas

More information

COMP 110 Introduction to Programming. What did we discuss?

COMP 110 Introduction to Programming. What did we discuss? COMP 110 Introduction to Programming Fall 2015 Time: TR 9:30 10:45 Room: AR 121 (Hanes Art Center) Jay Aikat FB 314, aikat@cs.unc.edu Previous Class What did we discuss? COMP 110 Spring 2015 2 1 Today

More information

CSE 115. Introduction to Computer Science I

CSE 115. Introduction to Computer Science I CSE 115 Introduction to Computer Science I Progress In UBInfinite? A. Haven't started B. Earned 3 stars in "Calling Functions" C. Earned 3 stars in "Defining Functions" D. Earned 3 stars in "Conditionals"

More information

61A Lecture 21. Friday, March 13

61A Lecture 21. Friday, March 13 61A Lecture 21 Friday, March 1 Announcements Project is due Thursday 10/2 @ :59pm Please submit two ways: the normal way and using python ok --submit! You can view your ok submission on the ok website:

More information

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

CSci 4211: Introduction to Computer Networks. Time: Monday and Wednesday 2:30 to 3:45 pm Location: Smith Hall 231 Fall 2018, 3 Credits CSci 4211: Introduction to Computer Networks Time: Monday and Wednesday 2:30 to 3:45 pm Location: Smith Hall 231 Fall 2018, 3 Credits 1 Instructor David Hung-Chang Du Email: du@cs.umn.edu Office: Keller

More information

Extegrity Exam4 Take Home Exam Guide

Extegrity Exam4 Take Home Exam Guide Extegrity Exam4 Take Home Exam Guide IMPORTANT NOTE: While students may complete a take-home exam any time during the designated time as set by each faculty member, technology support is only available

More information

Claremont McKenna College Computer Science

Claremont McKenna College Computer Science Claremont McKenna College Computer Science CS 51 Handout 4: Problem Set 4 February 10, 2011 This problem set is due 11:50pm on Wednesday, February 16. As usual, you may hand in yours until I make my solutions

More information

CS 343: Artificial Intelligence

CS 343: Artificial Intelligence CS 343: Artificial Intelligence Informed Search Prof. Scott Niekum University of Texas at Austin [These slides based on ones created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.

More information

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

CSE 167: Introduction to Computer Graphics. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016 CSE 167: Introduction to Computer Graphics Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016 Today Course organization Course overview 2 Course Staff Instructor Jürgen Schulze,

More information