CS1 Lecture 9 Feb. 5, 2018
|
|
- John Lloyd
- 6 years ago
- Views:
Transcription
1 CS1 Lecture 9 Feb. 5, 2018 HW 3 available today 5pm, due 9am Monday. Discussion sections this week: loop and string practice HW1 grading done scores posted by noon toeay Common errors: 1) hotel nights, lunch, breakfast, dinner logic not quite right TEST your code thoroughly 2) copy/paste 3) unnecessary use of small number for comparision: floor(time ). This is not safe, doesn t always work. Sometimes use of small values/ epsilon s is necessary but not here; don t use when you don t need to A few cases of academic honesty violation. Don t do it we will follow CLAS rules for violations. Please don t use spaces, hyphens, punctuation in.py filenames just letters (numbers at end okay too).
2 Last time Comments on HW2 Two while examples, with advice on design finished printfirstnprimes that we started last timehw2 printstuff
3 Top-down design of printfirstnprimes Express algorithm in comments, like an outline. Incrementally refine and implement steps. def printfirstnprimes(n): candidate = 2 numprimesprinted = 0 while (numprimesprinted!= n): isprime = numisprime(candidate) if isprime: print(candidate) # stub like this VERY # USEFUL for testing!! # def numisprime(n): isprime = True return isprime numprimesprinted = numprimesprinted + 1 candidate = candidate + 1 Now, just need to implement numisprime() BUT first test this code using stub numisprime()!
4 Top-down design of printfirstnprimes Now develop isnumprime in similar fashion: def isnumprime(n): # presume number is prime isprime = True # check potential divisors 2.. n-1. If any evenly divides n potentialdivisor = 2 while potentialdivisor < n: # check if potential divisor evenly divides n, # upddating isprime if it does if (n % potentialdivisor) == 0: isprime = False potentialdivisor = potentialdivisor + 1 return isprime lec9primes.py shows how basic and improved versions can be compared using timing functions (This is not required, for now. We ll discuss efficiency analysis more carefully later in the course) Note: this can be improved: 1) When find divisor, stop searching, return False 2) Search doesn t need to go to n-1. Can stop when potential divisor reaches square root of n (if n has divisor bigger than its square root, it must also have one smaller) BUT general rule: worry about correctness before working on optimizations like this
5 Today Chapter 8: Strings and for, including string methods
6 Ch 8: Strings and for strings in Python are our first example of a sequence type. (We ll see another later this week lists). As shown last week and used in HW2, you can access individual items in strings (or any sequence) using the [] operator >>> word = hello >>> word[1] e The len functions returns the number of items in a sequence for strings, the number of characters >>> len( hello ) 5
7 Intro to Ch8: Strings and for As you should know now from HW2, using [] and len, you can write while loops that do things with each character in a string: currentindex = 0 while currentindex < len(mystring): currentchar = mystring[currentindex].. (loop body typically does something. with character, currentchar). currentindex = currentindex + 1
8 Intro to Ch8: for Python provides a more concise way to do the same thing as the while-loop-with-index-incrementing of the previous slide for currentchar in mystring:.. (loop body typically does something. with character, currentchar). The body of the for loop gets executed once for each character in the string, mystring. On the first iteration, currentchar is bound to the first (i.e. index 0) character of mystring. On the second iteration, currentchar is bound to the second (i.e. index 1) character, etc. This loop and the one on the previous page are equivalent! You need to be able to convert for loops to equivalent while loop! (often tested on exam)
9 Ch 8: string slices We ve seen [] used to access one character of a string It can also be extract a series of elements from a string. This is called slicing. >>> abcdefghij [4:7] yields a new string consisting efg of the index 4, 5, and 6 chars abcdefghij [:5] is the same as abcdefghij [0:5] mystring[3:] is the same as mystring[3:len(mystring)]
10 Ch 8: strings are immutable! You might want to do: >>> mystring = fun >>> mystring[0] = s ß ERROR hoping to change fun to sun You cannot do this in Python. Strings cannot be modified! (this is different than several other popular programming languages) You can easily build new strings but you can t directly modify strings. >>> mystring = fun >>> mystring = s + mystring[1:] >>> mystring sun ß THIS A NEW STRING. fun didn t change. Remember: mystring is just a name
11 Looping on strings def findchar(chartofind, stringtosearch): for char in stringtosearch: if char == chartofind: print( found it ) return quits loop and function immediately But what if spec is instead to return index of character if found, and length of given string if not?
12 Looping on strings def findchar(chartofind, stringtosearch): indexofcharsought = len(stringtosearch) currentindex = 0 for char in stringtosearch: if char == chartofind: indexofcharsought = currentindex break exits loop immediately* currentindex = currentindex + 1 return indexofcharsought What is different if we remove break? Is result different/still correct? * Be careful; if not used well break can yield confusing code
13 Ch 8: string methods We use strings a lot in Python. Python provides many special built-in functions, called methods, for strings. Methods are called/invoked using a different syntax, dot notation (some people find it confusing): >>> abcd.upper() invokes the built-in string ABCD upper function NOTE: You can think of it as upper( abcd ) There are a quite a few: Look them up I won t go over many of them in detail.
14 Ch 8: string methods >>> mystring = hello >>> mystring.count( l ) Again, you can think of it 2 as: count(mystring, l ) >>> ababcab.count( ab ) 3 >>> eeeeeee.count( ee )? >>> mystring.index( l ) 2 index and find nearly the same >>> mystring.find( l ) but look up in docs! (give 2 different result when not found)
15 Ch 8: string methods >>> 'This is a sentence.'.split() ['This', 'is', 'a', 'sentence. ] a list (we ll study next) >>> '1,2,104,7,12'.split(',') ['1', '2', '104', '7', '12'] >>> ' non-whitespace '.strip() 'non-whitespace >>> '.'.join(['www', 'uiowa', 'edu']) ' Note: these three are very commonly used when reading in data from files
16 Ch 8: string in operator a in mystring returns True if a is in mystring, False otherwise Write function inboth(string1, string2) that prints all characters that appear in both: def inboth(string1, string2): for c in string1: if c in string2: print(c)
17 Ch 8: Debugging section and exercises Read the debugging section for pretty good example of debugging loop errors 8-4 is a good exercise Make sure you understand which functions are correct/incorrect. You should be able to do this without executing the code. lec9ex84.py Ch 9: good string exercises Several string exercises in the form of word puzzles Simple introduction to opening and reading in text from files. filestream = fopen( words.txt ) for line in filestream: word = line.strip() print(word) Tomorrow and Wednesday s discussion sections cover a bit of Ch 9. But you should do more of the exercises than discussion section time allows. Do them all if you can very good practice!
18 Some of Chapter 9. Next time Start Chapter 10 important topic of lists
CS1 Lecture 12 Feb. 11, 2019
CS1 Lecture 12 Feb. 11, 2019 HW4 available tomorrow, due next Wed. Discussion sections this week will be closely tied to one of the homework problems. Exam 1, Thursday evening, 2/21, 6:30-8:00pm HW2 scores
More informationCS1 Lecture 4 Jan. 23, 2019
CS1 Lecture 4 Jan. 23, 2019 First graded discussion sections this week yesterday/today 10 DS assignments worth 2 points each everyone gets one free 2-pointer. I.e. your lowest DS grade will be replaced
More informationCS1 Lecture 5 Jan. 25, 2019
CS1 Lecture 5 Jan. 25, 2019 HW1 due Monday, 9:00am. Notes: Do not write all the code at once before starting to test. Take tiny steps. Write a few lines test... add a line or two test... add another line
More informationCS1 Lecture 11 Feb. 9, 2018
CS1 Lecture 11 Feb. 9, 2018 HW3 due Monday morning, 9:00am for #1 I don t care if you use 1, 2, or 3 loops. Most important is clear correct code for #3, make sure all legal situations are handled. Think
More informationCS1 Lecture 13 Feb. 13, 2019
CS1 Lecture 13 Feb. 13, 2019 Exam 1, Thursday evening, 2/21, 6:30-8:00pm, W290 CB Email about make-ups will be sent tomorrow HW4 Q1 available. Q2 Q4 tomorrow. For Q1 only, Academic Honesty policy does
More informationCS1 Lecture 4 Jan. 24, 2018
CS1 Lecture 4 Jan. 24, 2018 First homework due Mon., 9:00am Meet specifications precisely. Functions only. Use a file editor! Don t type functions/long sections of code directly into Python interpreter.
More informationCS1 Lecture 5 Jan. 26, 2018
CS1 Lecture 5 Jan. 26, 2018 HW1 due Monday, 9:00am. Notes: Do not write all the code at once (for Q1 and 2) before starting to test. Take tiny steps. Write a few lines test... add a line or two test...
More informationCS 100: Computability, Python Lists
CS 100: Computability, Python Lists Chris Kauffman Week 6 Logistics Homework 4 A few Python list exercises Due next Thursday Reading Pattern Ch 5: Algorithms And Heuristics Think Ch 11: Lists (link) Mini-Exam
More informationProblem Solving for Intro to Computer Science
Problem Solving for Intro to Computer Science The purpose of this document is to review some principles for problem solving that are relevant to Intro to Computer Science course. Introduction: A Sample
More informationCS1 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 informationCS1 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 informationCS 1110, LAB 10: ASSERTIONS AND WHILE-LOOPS 1. Preliminaries
CS 0, LAB 0: ASSERTIONS AND WHILE-LOOPS http://www.cs.cornell.edu/courses/cs0/20sp/labs/lab0.pdf. Preliminaries This lab gives you practice with writing loops using invariant-based reasoning. Invariants
More informationCMSC 201 Spring 2019 Lab 06 Lists
CMSC 201 Spring 2019 Lab 06 Lists Assignment: Lab 06 Lists Due Date: Thursday, March 7th by 11:59:59 PM Value: 10 points This week s lab will put into practice the concepts you learned about lists: indexing,
More informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 08 Lists Constants Last Class We Covered More on while loops Sentinel loops Boolean flags 2 Any Questions from Last Time? 3 Today s Objectives To learn about
More informationC10552: Intro to Computation. Lecture 2 July 17, 2016
C10552: Intro to Computation Lecture 2 July 17, 2016 Lecture 1 Recap Loops are useful for repeating code for i in range(10): print i If statements are useful for conditional code if current_temp > 80:
More informationPython for Everybody. Exploring Data Using Python 3. Charles R. Severance
Python for Everybody Exploring Data Using Python 3 Charles R. Severance 8.14. DEBUGGING 103 In this example you could also use the built-in function sorted, which returns a new, sorted list and leaves
More informationAdministrativia. CS107 Introduction to Computer Science. Readings. Algorithms. Expressing algorithms
CS107 Introduction to Computer Science Lecture 2 An Introduction to Algorithms: and Conditionals Administrativia Lab access Searles 128: Mon-Friday 8-5pm (unless class in progress) and 6-10pm Sat, Sun
More informationAddis Ababa University, Amist Kilo July 5, 2011 Algorithms and Programming for High Schoolers. Lab 2
Addis Ababa University, Amist Kilo July 5, 2011 Algorithms and Programming for High Schoolers Lab 2 Exercise 1: In my high school, students were given letter grades based on their numerical scores. Here
More informationCS1210 Lecture 28 Mar. 27, 2019
CS1210 Lecture 28 Mar. 27, 2019 Discussion section exam scores posted score # people 0-5 6-10 11-15 16-20 21-25 26-30 28 48 39 37 30 9 median: 13 Some words about overall grades more detail next Wednesday
More informationCS1 Lecture 2 Jan. 16, 2019
CS1 Lecture 2 Jan. 16, 2019 Contacting me/tas by email You may send questions/comments to me/tas by email. For discussion section issues, sent to TA and me For homework or other issues send to me (your
More informationProperties and Definitions
Section 0.1 Contents: Operations Defined Multiplication as an Abbreviation Visualizing Multiplication Commutative Properties Parentheses Associative Properties Identities Zero Product Answers to Exercises
More informationComputer Science 210: Data Structures
Computer Science 210: Data Structures Welcome to Data Structures! Data structures are fundamental building blocks of algorithms and programs Csci 210 is a study of data structures design efficiency implementation
More informationThe second statement selects character number 1 from and assigns it to.
Chapter 8 Strings 8.1 A string is a sequence A string is a sequence of characters. You can access the characters one at a time with the bracket operator: The second statement selects character number 1
More informationPython lab session 1
Python lab session 1 Dr Ben Dudson, Department of Physics, University of York 28th January 2011 Python labs Before we can start using Python, first make sure: ˆ You can log into a computer using your username
More informationCMSC 201 Spring 2017 Lab 05 Lists
CMSC 201 Spring 2017 Lab 05 Lists Assignment: Lab 05 Lists Due Date: During discussion, February 27th through March 2nd Value: 10 points (8 points during lab, 2 points for Pre Lab quiz) This week s lab
More informationCS Lecture 19: Loop invariants
CS 1110 Lecture 19: Loop invariants Announcements Prelim 2 conflicts Today (April 2) is two weeks before the prelim, and the deadline for submitting prelim conflicts. Instructor travel This week and the
More informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 08 Lists Constants Last Class We Covered More on while loops Sentinel loops Priming Reads Boolean flags 2 Any Questions from Last Time? 3 Today s Objectives
More informationCS 115 Lecture 13. Strings. Neil Moore. Department of Computer Science University of Kentucky Lexington, Kentucky
CS 115 Lecture 13 Strings Neil Moore Department of Computer Science University of Kentucky Lexington, Kentucky 40506 neil@cs.uky.edu 29 October 2015 Strings We ve been using strings for a while. What can
More informationProgramming with Python
Programming with Python Dr Ben Dudson Department of Physics, University of York 21st January 2011 http://www-users.york.ac.uk/ bd512/teaching.shtml Dr Ben Dudson Introduction to Programming - Lecture 2
More informationCMSC 201 Computer Science I for Majors
CMSC 201 Computer Science I for Majors Lecture 02 Intro to Python Syllabus Last Class We Covered Grading scheme Academic Integrity Policy (Collaboration Policy) Getting Help Office hours Programming Mindset
More informationCS 1803 Pair Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 29th, before 6 PM Out of 100 points
CS 1803 Pair Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 29th, before 6 PM Out of 100 points Files to submit: 1. HW4.py This is a PAIR PROGRAMMING Assignment: Work with your partner!
More informationCS1 Lecture 15 Feb. 18, 2019
CS1 Lecture 15 Feb. 18, 2019 HW4 due Wed. 2/20, 5pm Q2 and Q3: it is fine to use a loop as long as the function is also recursive. Exam 1, Thursday evening, 2/21, 6:30-8:00pm, W290 CB You must bring ID
More informationCSC209. Software Tools and Systems Programming. https://mcs.utm.utoronto.ca/~209
CSC209 Software Tools and Systems Programming https://mcs.utm.utoronto.ca/~209 What is this Course About? Software Tools Using them Building them Systems Programming Quirks of C The file system System
More informationWorking with Sequences: Section 8.1 and 8.2. Bonita Sharif
Chapter 8 Working with Sequences: Strings and Lists Section 8.1 and 8.2 Bonita Sharif 1 Sequences A sequence is an object that consists of multiple data items These items are stored consecutively Examples
More informationDivisibility Rules and Their Explanations
Divisibility Rules and Their Explanations Increase Your Number Sense These divisibility rules apply to determining the divisibility of a positive integer (1, 2, 3, ) by another positive integer or 0 (although
More information6.189 Project 1. Readings. What to hand in. Project 1: The Game of Hangman. Get caught up on all the readings from this week!
6.189 Project 1 Readings Get caught up on all the readings from this week! What to hand in Print out your hangman code and turn it in Monday, Jaunary 10 at 2:10 PM. Be sure to write your name and section
More informationIf Statements, For Loops, Functions
Fundamentals of Programming If Statements, For Loops, Functions Table of Contents Hello World Types of Variables Integers and Floats String Boolean Relational Operators Lists Conditionals If and Else Statements
More informationCMSC201 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 informationLecture 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 informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 09 For Loops All materials copyright UMBC unless otherwise noted Last Class We Covered Lists and what they are used for Operations a list can perform Including
More informationWorking with Strings. Husni. "The Practice of Computing Using Python", Punch & Enbody, Copyright 2013 Pearson Education, Inc.
Working with Strings Husni "The Practice of Computing Using Python", Punch & Enbody, Copyright 2013 Pearson Education, Inc. Sequence of characters We've talked about strings being a sequence of characters.
More informationCS 1803 Pair Homework 3 Calculator Pair Fun Due: Wednesday, September 15th, before 6 PM Out of 100 points
CS 1803 Pair Homework 3 Calculator Pair Fun Due: Wednesday, September 15th, before 6 PM Out of 100 points Files to submit: 1. HW3.py This is a PAIR PROGRAMMING Assignment: Work with your partner! For pair
More information#4: While Loop Reading: Chapter3
CS 130R: Programming in Python #4: While Loop Reading: Chapter3 Contents Constants While loop Infinite loop Break Continue Constants Similar to variables, but their names are with capital letters and their
More informationSequence of Characters. Non-printing Characters. And Then There Is """ """ Subset of UTF-8. String Representation 6/5/2018.
Chapter 4 Working with Strings Sequence of Characters we've talked about strings being a sequence of characters. a string is indicated between ' ' or " " the exact sequence of characters is maintained
More informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 09 Strings Last Class We Covered Lists and what they are used for Getting the length of a list Operations like append() and remove() Iterating over a list
More informationMore About WHILE Loops
More About WHILE Loops http://people.sc.fsu.edu/ jburkardt/isc/week04 lecture 07.pdf... ISC3313: Introduction to Scientific Computing with C++ Summer Semester 2011... John Burkardt Department of Scientific
More informationCS 126 Lecture P1: Introduction to C
CS 126 Lecture P1: Introduction to C Administrivia Background Syntax Libraries Algorithms Outline CS126 2-1 Randy Wang To Get Started Visit course web page: - http://www.cs.princeton.edu/courses/cs126
More informationIntro to Programming. Unit 7. What is Programming? What is Programming? Intro to Programming
Intro to Programming Unit 7 Intro to Programming 1 What is Programming? 1. Programming Languages 2. Markup vs. Programming 1. Introduction 2. Print Statement 3. Strings 4. Types and Values 5. Math Externals
More informationNotes slides from before lecture. CSE 21, Winter 2017, Section A00. Lecture 9 Notes. Class URL:
Notes slides from before lecture CSE 21, Winter 2017, Section A00 Lecture 9 Notes Class URL: http://vlsicad.ucsd.edu/courses/cse21-w17/ Notes slides from before lecture Notes February 8 (1) HW4 is due
More informationCoding Workshop. Learning to Program with an Arduino. Lecture Notes. Programming Introduction Values Assignment Arithmetic.
Coding Workshop Learning to Program with an Arduino Lecture Notes Table of Contents Programming ntroduction Values Assignment Arithmetic Control Tests f Blocks For Blocks Functions Arduino Main Functions
More informationDesigning Loops and General Debug Pre-Defined Functions in C++ CS 16: Solving Problems with Computers I Lecture #6
Designing Loops and General Debug Pre-Defined Functions in C++ CS 16: Solving Problems with Computers I Lecture #6 Ziad Matni Dept. of Computer Science, UCSB Announcements Homework #5 due today Lab #3
More informationThe Practice of Computing Using PYTHON. Chapter 4. Working with Strings. Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
The Practice of Computing Using PYTHON William Punch Richard Enbody Chapter 4 Working with Strings 1 Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Sequence of Characters We
More informationNumerical Conversions Intro to Strings in C/C++ CS 16: Solving Problems with Computers I Lecture #8
Numerical Conversions Intro to Strings in C/C++ CS 16: Solving Problems with Computers I Lecture #8 Ziad Matni Dept. of Computer Science, UCSB Announcements We are grading your midterms this week! Grades
More informationLOOPS. Repetition using the while statement
1 LOOPS Loops are an extremely useful feature in any programming language. They allow you to direct the computer to execute certain statements more than once. In Python, there are two kinds of loops: while
More informationCS1 Lecture 22 Mar. 6, 2019
CS1 Lecture 22 Mar. 6, 2019 HW 5 due Friday Questions? In discussion exams next week Last time Ch 12. Zip, lambda, etc Default/keyword function parameters Ch 19 conditional expresssions, list comprehensions
More informationIntro. Scheme Basics. scm> 5 5. scm>
Intro Let s take some time to talk about LISP. It stands for LISt Processing a way of coding using only lists! It sounds pretty radical, and it is. There are lots of cool things to know about LISP; if
More informationCS 2316 Individual Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 18th, before 11:55 PM Out of 100 points
CS 2316 Individual Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 18th, before 11:55 PM Out of 100 points Files to submit: 1. HW4.py This is an INDIVIDUAL assignment! Collaboration at a
More informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 09 Strings Last Class We Covered Lists and what they are used for Getting the length of a list Operations like append() and remove() Iterating over a list
More informationCS 051 Homework Laboratory #2
CS 051 Homework Laboratory #2 Dirty Laundry Objective: To gain experience using conditionals. The Scenario. One thing many students have to figure out for the first time when they come to college is how
More informationFoundations, Reasoning About Algorithms, and Design By Contract CMPSC 122
Foundations, Reasoning About Algorithms, and Design By Contract CMPSC 122 I. Logic 101 In logic, a statement or proposition is a sentence that can either be true or false. A predicate is a sentence in
More informationLecture Transcript While and Do While Statements in C++
Lecture Transcript While and Do While Statements in C++ Hello and welcome back. In this lecture we are going to look at the while and do...while iteration statements in C++. Here is a quick recap of some
More informationCS61C Machine Structures. Lecture 3 Introduction to the C Programming Language. 1/23/2006 John Wawrzynek. www-inst.eecs.berkeley.
CS61C Machine Structures Lecture 3 Introduction to the C Programming Language 1/23/2006 John Wawrzynek (www.cs.berkeley.edu/~johnw) www-inst.eecs.berkeley.edu/~cs61c/ CS 61C L03 Introduction to C (1) Administrivia
More informationCS1102: Macros and Recursion
CS1102: Macros and Recursion Kathi Fisler, WPI October 5, 2009 This lecture looks at several more macro examples. It aims to show you when you can use recursion safely with macros and when you can t. 1
More informationCMSC 201 Fall 2015 Lab 12 Tuples and Dictionaries
CMSC 201 Fall 2015 Lab 12 Tuples and Dictionaries Assignment: Lab 12 Tuples and Dictionaries Due Date: During discussion, November 30 th through December 3 rd Value: 1% of final grade Part 1: Data Types
More informationCISC 181 Lab 2 (100 pts) Due: March 7 at midnight (This is a two-week lab)
CISC 181 Lab 2 (100 pts) Due: March 7 at midnight (This is a two-week lab) This lab may be done individually or with a partner. Working with a partner DOES NOT mean, you do the evens, and I ll do the odds.
More informationCMSC 201 Fall 2018 Lab 04 While Loops
CMSC 201 Fall 2018 Lab 04 While Loops Assignment: Lab 04 While Loops Due Date: During discussion, September 24 th through September 27 th Value: 10 points (8 points during lab, 2 points for Pre Lab quiz)
More informationSCHEME 8. 1 Introduction. 2 Primitives COMPUTER SCIENCE 61A. March 23, 2017
SCHEME 8 COMPUTER SCIENCE 61A March 2, 2017 1 Introduction In the next part of the course, we will be working with the Scheme programming language. In addition to learning how to write Scheme programs,
More informationCS150 - Assignment 5 Data For Everyone Due: Wednesday Oct. 16, at the beginning of class
CS10 - Assignment Data For Everyone Due: Wednesday Oct. 16, at the beginning of class http://dilbert.com/fast/2008-0-08/ For this assignment we re going to implement some initial data analysis functions
More informationCS1 Lecture 27 Mar. 26, 2018
CS1 Lecture 27 Mar. 26, 2018 HW6 due Thurs. Q1: think carefully about overlaps draw pictures Q2 ---------------- Ensure legal moves i.e. if user enters an illegal choice, print something appropriate and
More informationfor loops Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas
for loops Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas Reminders use if - elif - else statements for conditional code blocks code blocks share the same indentation
More informationPhysics 2660: Fundamentals of Scientific Computing. Lecture 5 Instructor: Prof. Chris Neu
Physics 2660: Fundamentals of Scientific Computing Lecture 5 Instructor: Prof. Chris Neu (chris.neu@virginia.edu) Reminder I am back! HW04 due Thursday 22 Feb electronically by noon HW grades are coming.
More informationStatements 2. a operator= b a = a operator b
Statements 2 Outline Note: i=i+1 is a valid statement. Don t confuse it with an equation i==i+1 which is always false for normal numbers. The statement i=i+1 is a very common idiom: it just increments
More informationCSCI-1200 Data Structures Fall 2009 Lecture 25 Concurrency & Asynchronous Computing
CSCI-1200 Data Structures Fall 2009 Lecture 25 Concurrency & Asynchronous Computing Final Exam General Information The final exam will be held Monday, Dec 21st, 2009, 11:30am-2:30pm, DCC 308. A makeup
More informationCISC 181 Lab 2 (100 pts) Due: March 4 at midnight (This is a two-week lab)
CISC 181 Lab 2 (100 pts) Due: March 4 at midnight (This is a two-week lab) This lab should be done individually. Labs are to be turned in via Sakai by midnight on Tuesday, March 4 (the midnight between
More informationRecall that strings and tuples are immutable datatypes, while lists are mutable datatypes. What does this mean?
6.189 Day 4 Readings How To Think Like A Computer Scientist, chapters 7 and 8 6.01 Fall 2009 Course Notes page 27-29 ( Lists and Iterations over lists ; List Comprehensions is optional); sections 3.2-3.4
More informationCSC209. Software Tools and Systems Programming. https://mcs.utm.utoronto.ca/~209
CSC209 Software Tools and Systems Programming https://mcs.utm.utoronto.ca/~209 What is this Course About? Software Tools Using them Building them Systems Programming Quirks of C The file system System
More informationCMSC 341 Lecture 16/17 Hashing, Parts 1 & 2
CMSC 341 Lecture 16/17 Hashing, Parts 1 & 2 Prof. John Park Based on slides from previous iterations of this course Today s Topics Overview Uses and motivations of hash tables Major concerns with hash
More informationPROBLEM SOLVING 11. July 24, 2012
PROBLEM SOLVING 11 COMPUTER SCIENCE 61A July 24, 2012 Today s section will be a kind of Meta-Section, we are going to walk through some medium to hard-ish problems in Scheme, and we will discuss some methods
More informationCS2304: Python for Java Programmers. CS2304: Sequences and Collections
CS2304: Sequences and Collections Sequences In Python A sequence type in python supports: The in membership operator. The len() function. Slicing like we saw with strings, s[1:3]. And is iterable (for
More informationBASIC COMPUTATION. public static void main(string [] args) Fundamentals of Computer Science I
BASIC COMPUTATION x public static void main(string [] args) Fundamentals of Computer Science I Outline Using Eclipse Data Types Variables Primitive and Class Data Types Expressions Declaration Assignment
More informationFunctions 3.6. Fall Math (Math 1010) M / 13
Functions 3.6 Fall 2013 - Math 1010 (Math 1010) M 1010 3.6 1 / 13 Roadmap 3.6 - Functions: Relations, Functions 3.6 - Evaluating Functions, Finding Domains and Ranges (Math 1010) M 1010 3.6 2 / 13 3.6
More informationStepwise Refinement. Lecture 12 COP 3014 Spring February 2, 2017
Stepwise Refinement Lecture 12 COP 3014 Spring 2017 February 2, 2017 Top-Down Stepwise Refinement Top down stepwise refinement is a useful problem-solving technique that is good for coming up with an algorithm.
More information: Intro Programming for Scientists and Engineers Assignment 1: Turtle Graphics
Assignment 1: Turtle Graphics Page 1 600.112: Intro Programming for Scientists and Engineers Assignment 1: Turtle Graphics Peter H. Fröhlich phf@cs.jhu.edu Joanne Selinski joanne@cs.jhu.edu Due Date: Wednesdays
More information61A 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 informationStrings in Python 1 Midterm#1 Exam Review CS 8: Introduction to Computer Science Lecture #6
Strings in Python 1 Midterm#1 Exam Review CS 8: Introduction to Computer Science Lecture #6 Ziad Matni Dept. of Computer Science, UCSB Administrative Turn in Homework #2 today Homework #3 is assigned and
More informationCS1 Lecture 15 Feb. 19, 2018
CS1 Lecture 15 Feb. 19, 2018 HW4 due Wed. 2/21, 5pm (changed from original 9am so people in Wed. disc. sections can get help) Q2: find *any* solution. Don t try to find the best/optimal solution or all
More informationfor loops Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas
for loops Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas Reminders use if - elif - else statements for conditional code blocks memorize the logical operators (==,!=,
More informationECS15, Lecture 13. Midterm solutions posted. Topic 4: Programming in Python, cont. Staying up to speed with Python RESOURCES. More Python Resources
Midterm solutions posted ECS15, Lecture 13 Topic 4: Programming in Python, cont. Don t forget, you have one week since the material returned to request a re-grade for whatever reason. We will re-evaluate
More informationENCM 335 Fall 2018 Lab 6 for the Week of October 22 Complete Instructions
page 1 of 5 ENCM 335 Fall 2018 Lab 6 for the Week of October 22 Complete Instructions Steve Norman Department of Electrical & Computer Engineering University of Calgary October 2018 Lab instructions and
More informationIntroduction to Scientific Python, CME 193 Jan. 9, web.stanford.edu/~ermartin/teaching/cme193-winter15
1 LECTURE 1: INTRO Introduction to Scientific Python, CME 193 Jan. 9, 2014 web.stanford.edu/~ermartin/teaching/cme193-winter15 Eileen Martin Some slides are from Sven Schmit s Fall 14 slides 2 Course Details
More informationBasic Data Types and Operators CS 8: Introduction to Computer Science, Winter 2019 Lecture #2
Basic Data Types and Operators CS 8: Introduction to Computer Science, Winter 2019 Lecture #2 Ziad Matni, Ph.D. Dept. of Computer Science, UCSB Your Instructor Your instructor: Ziad Matni, Ph.D(zee-ahd
More informationCS 302: INTRODUCTION TO PROGRAMMING. Lectures 7&8
CS 302: INTRODUCTION TO PROGRAMMING Lectures 7&8 Hopefully the Programming Assignment #1 released by tomorrow REVIEW The switch statement is an alternative way of writing what? How do you end a case in
More informationSummer 2017 Discussion 10: July 25, Introduction. 2 Primitives and Define
CS 6A Scheme Summer 207 Discussion 0: July 25, 207 Introduction In the next part of the course, we will be working with the Scheme programming language. In addition to learning how to write Scheme programs,
More informationCSCI-1200 Data Structures Spring 2018 Lecture 14 Associative Containers (Maps), Part 1 (and Problem Solving Too)
CSCI-1200 Data Structures Spring 2018 Lecture 14 Associative Containers (Maps), Part 1 (and Problem Solving Too) HW6 NOTE: Do not use the STL map or STL pair for HW6. (It s okay to use them for the contest.)
More informationCS 4349 Lecture October 18th, 2017
CS 4349 Lecture October 18th, 2017 Main topics for #lecture include #minimum_spanning_trees. Prelude Homework 6 due today. Homework 7 due Wednesday, October 25th. Homework 7 has one normal homework problem.
More informationLECTURE 7: STUDENT REQUESTED TOPICS
1 LECTURE 7: STUDENT REQUESTED TOPICS Introduction to Scientific Python, CME 193 Feb. 20, 2014 Please download today s exercises from: web.stanford.edu/~ermartin/teaching/cme193-winter15 Eileen Martin
More informationCS150 - Sample Final
CS150 - Sample Final Name: Honor code: You may use the following material on this exam: The final exam cheat sheet which I have provided The matlab basics handout (without any additional notes) Up to two
More informationCS 134 Programming Exercise 2:
CS 134 Programming Exercise 2: Dirty Laundry Objective: To gain experience using conditionals. The Scenario. One thing some students have to figure out for the first time when they come to college is how
More informationPROGRAMMING FUNDAMENTALS
PROGRAMMING FUNDAMENTALS TESTING, MAIN, GLOBAL VARIABLES João Correia Lopes INESC TEC, FEUP 23 October 2018 FPRO/MIEIC/2018-19 23/10/2018 1 / 24 INTRODUCTION GOALS By the end of this class, the student
More informationLesson 1A - First Java Program HELLO WORLD With DEBUGGING examples. By John B. Owen All rights reserved 2011, revised 2015
Lesson 1A - First Java Program HELLO WORLD With DEBUGGING examples By John B. Owen All rights reserved 2011, revised 2015 Table of Contents Objectives Hello World Lesson Sequence Compile Errors Lexical
More information