6.009 Fundamentals of Programming
|
|
- Mitchell Armstrong
- 5 years ago
- Views:
Transcription
1 6.009 Fundamentals of Programming Lecture 5: Custom Types Adam Hartz
2 6.009: Goals Our goals involve helping you develop as a programmer, in multiple aspects: Programming: Analyzing problems, developing plans Coding: Translating plans into Python Debugging: Developing test cases, verifying correctness, finding and fixing errors So we will spend time discussing (and practicing!): High-level design strategies Ways to manage complexity Details and goodies of Python A mental model of Python s operation Testing and debugging strategies Fundamentals of Programming Lecture 5 (slide 2) 20 Mar 2018
3 The Power of Abstraction Thinking about complicated systems is complicated Fundamentals of Programming Lecture 5 (slide 3) 20 Mar 2018
4 The Power of Abstraction Thinking about complicated systems is complicated. Thinking about simpler systems is often simpler Fundamentals of Programming Lecture 5 (slide 4) 20 Mar 2018
5 The Power of Abstraction Thinking about complicated systems is complicated. Thinking about simpler systems is often simpler. Framework for thinking about complicated systems: Primitives Means of Combination Means of Abstraction Recognizing meaningful Patterns Fundamentals of Programming Lecture 5 (slide 5) 20 Mar 2018
6 The Power of Abstraction Thinking about complicated systems is complicated. Thinking about simpler systems is often simpler. Framework for thinking about complicated systems: Primitives Means of Combination Means of Abstraction Recognizing meaningful Patterns Example: Primitives: +, *, ==,!=,... Combination: if, while, f(g(x)),... Abstraction: def Fundamentals of Programming Lecture 5 (slide 6) 20 Mar 2018
7 Custom Types très classy! Python also provides a means of creating custom types: the class keyword. Today: Extending our notional machine to include classes What is self? Examples of creating new types and integrating them into Python Fundamentals of Programming Lecture 5 (slide 7) 20 Mar 2018
8 pass Fundamentals of Programming Lecture 5 (slide 8) 20 Mar 2018
9 pass v = Vec2D() Fundamentals of Programming Lecture 5 (slide 9) 20 Mar 2018
10 pass v = Vec2D() v.x = 3 v.y = Fundamentals of Programming Lecture 5 (slide 10) 20 Mar 2018
11 pass v = Vec2D() v.x = 3 v.y = 4 def mag(vec): return (vec.x**2 + vec.y**2) ** Fundamentals of Programming Lecture 5 (slide 11) 20 Mar 2018
12 pass v = Vec2D() v.x = 3 v.y = 4 def mag(vec): return (vec.x**2 + vec.y**2) ** 0.5 print(mag(v)) Fundamentals of Programming Lecture 5 (slide 12) 20 Mar 2018
13 ndims = 2 def mag(vec): return (vec.x**2 + vec.y**2) ** Fundamentals of Programming Lecture 5 (slide 13) 20 Mar 2018
14 ndims = 2 def mag(vec): return (vec.x**2 + vec.y**2) ** 0.5 v = Vec2D() v.x = 3 v.y = 4 print(v.x) print(v.ndims) Fundamentals of Programming Lecture 5 (slide 14) 20 Mar 2018
15 ndims = 2 def mag(vec): return (vec.x**2 + vec.y**2) ** 0.5 v = Vec2D() v.x = 3 v.y = 4 print(v.x) print(v.ndims) print(vec2d.mag(v)) Fundamentals of Programming Lecture 5 (slide 15) 20 Mar 2018
16 ndims = 2 def mag(vec): return (vec.x**2 + vec.y**2) ** 0.5 v = Vec2D() v.x = 3 v.y = 4 print(v.x) print(v.ndims) print(vec2d.mag(v)) print(v.mag()) Fundamentals of Programming Lecture 5 (slide 16) 20 Mar 2018
17 ndims = 2 def init (self, x, y): self.x = x self.y = y def mag(self): return (self.x**2 + self.y**2) ** Fundamentals of Programming Lecture 5 (slide 17) 20 Mar 2018
18 ndims = 2 def init (self, x, y): self.x = x self.y = y def mag(self): return (self.x**2 + self.y**2) ** 0.5 v = Vec2D(3, 4) Fundamentals of Programming Lecture 5 (slide 18) 20 Mar 2018
19 ndims = 2 def init (self, x, y): self.x = x self.y = y def mag(self): return (self.x**2 + self.y**2) ** 0.5 v = Vec2D(3, 4) print(v.mag()) Fundamentals of Programming Lecture 5 (slide 19) 20 Mar 2018
20 Integrating More Closely With Python Python offers ways to integrate things more tightly into the language: magic methods or dunder methods. For example: print(x) is translated implicitly to print(x. str ()) abs(x) is translated implicitly to x. abs () x + y is translated implicitly to x. add (y) x - y is translated implicitly to x. sub (y) x[y] is translated implicitly to x. getitem (y) x[y] = z is translated implicitly to x. setitem (y, z) For a full list, see: Section 3.3 Let s add a couple of these to Vec2D and see the effects Fundamentals of Programming Lecture 5 (slide 20) 20 Mar 2018
21 The Rest of Today: More Examples We ll see how many we have time for... Linked List Polynomial Infinite List Memoized Function Fundamentals of Programming Lecture 5 (slide 21) 20 Mar 2018
Fundamentals of Programming (Python) Object-Oriented Programming. Ali Taheri Sharif University of Technology Spring 2018
Fundamentals of Programming (Python) Object-Oriented Programming Ali Taheri Sharif University of Technology Outline 1. Python Data Types 2. Classes and Objects 3. Defining Classes 4. Working with Objects
More informationIterators & Generators
Iterators & Generators Sequences A sequence is something that you can: Index into Get the length of What are some examples of sequences? Sequences We ve been working with sequences all semester! Examples:
More informationObject Oriented Programming in Python 3
Object Oriented Programming in Python 3 Objects Python 3 Objects play a central role in the Python data model All the types we ve seen until now are in-fact objects Numeric types, strings, lists, tuples,
More informationCSc 110, Autumn Lecture 30: Methods. Adapted from slides by Marty Stepp and Stuart Reges
CSc 110, Autumn 2016 Lecture 30: Methods Adapted from slides by Marty Stepp and Stuart Reges Why objects? Primitive types don't model complex concepts well Cost is a float. What's a person? Classes are
More informationOBJECT ORIENTED PROGRAMMING
OBJECT ORIENTED PROGRAMMING (download slides and.py files follow along!) 6.0001 LECTURE 8 6.0001 LECTURE 8 1 OBJECTS Python supports many different kinds of data 1234 3.14159 "Hello" [1, 5, 7, 11, 13]
More informationLecture #3: Environments
Lecture #3: Environments Substitution is not as simple as it might seem. For example: def f(x): def g(x): return x + 10 return g(5) f(3) When we call f(3), we should not substitute 3 for the xs in g! And
More informationCSCA08 Winter 2018 Week 2: Variables & Functions. Marzieh Ahmadzadeh, Brian Harrington University of Toronto Scarborough
CSCA08 Winter 2018 Week 2: Variables & Functions Marzieh Ahmadzadeh, Brian Harrington University of Toronto Scarborough Administrative Detail Tutorials and practicals start this week Inverted lecture starts
More informationPYTHON. Cheat Sheet.
PYTHON Cheat Sheet @moshhamedani Primitive Types Variables a = 1 (integer) b = 1.1 (float) c = 1 + 2j (complex) d = a (string) e = True (boolean) Strings x = Python len(x) x[0] x[-1] x[0:3] Formatted strings
More informationWeek 8 Lecture: Programming
Week 8 Lecture: Introduction to Object Oriented Programming Introduction to Programming for GIS & Remote Sensing GEO6938 1469 GEO4938 147A Objects: You ve Been Exposed! Modularization, you know about it
More informationUser Defined Types. Babes-Bolyai University Lecture 06. Lect Phd. Arthur Molnar. User defined types. Python scope and namespace
? User Defined Types Babes-Bolyai University arthur@cs.ubbcluj.ro Overview? 1? 2 3 ? NB! Types classify values. A type denotes a domain (a set of values) operations on those values. ? Object oriented programming
More informationLecture #15: Generic Functions and Expressivity. Last modified: Wed Mar 1 15:51: CS61A: Lecture #16 1
Lecture #15: Generic Functions and Expressivity Last modified: Wed Mar 1 15:51:48 2017 CS61A: Lecture #16 1 Consider the function find: Generic Programming def find(l, x, k): """Return the index in L of
More informationWhat is Recursion? 21. Recursion. The Concept of Recursion Is Hard But VERY Important. Recursive Graphics. Tiling a Triangle.
. Recursion Recursive Tiling Recursive Evaluation of n! Tracking a Recursive Function Call Random Mondrian What is Recursion? A function is recursive if it calls itself. A pattern is recursive if it is
More informationAdvanced Python Subjects. By Imri Goldberg plnnr.com
Advanced Python Subjects By Imri Goldberg www.algorithm.co.il plnnr.com Introduction Many people I know come to Python from C/C++. Including me! They bring with them many unpythonic idioms: inheritance
More informationLecture 19: Subclasses & Inheritance (Chapter 18)
http://www.cs.cornell.edu/courses/cs1110/2018sp Lecture 19: Subclasses & Inheritance (Chapter 18) CS 1110 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner,
More information! The simplest building blocks of a language. ! Compound elements are built from simpler ones
The Elements of Programming Primitive Expressions and Statements! The simplest building blocks of a language 61 Lecture Monday, ugust 9 Means of Combination! Compound elements are built from simpler ones
More informationMath 4242 Fibonacci, Memoization lecture 13
Math 4242 Fibonacci, Memoization lecture 13 Today we talk about a problem that sometimes occurs when using recursion, and a common way to fix it. Recall the Fibonacci sequence (F 1, F 2,...) that occurs
More informationCIS192 Python Programming
CIS192 Python Programming Introduction Robert Rand University of Pennsylvania September 16, 2015 Robert Rand (University of Pennsylvania) CIS 192 September 16, 2015 1 / 21 Outline 1 Object Orientation
More informationCSC148-Section:L0301
CSC148-Section:L0301 Week#1-Wednesday Instructed by AbdulAziz Al-Helali a.alhelali@mail.utoronto.ca Office hours: Wednesday 11-1, BA2230. Slides adapted from Professor Danny Heap and Jacqueline Smith slides
More informationCS Lecture 18: Card Tricks. Announcements. Slides by D. Gries, L. Lee, S. Marschner, W. White
CS 1110 Lecture 18: Card Tricks Announcements Slides by D. Gries, L. Lee, S. Marschner, W. White Quick poker primer Basic (straight) version: 5 random cards in your hand 2 of same rank: pair (e.g., 3C
More informationCIS192 Python Programming
CIS192 Python Programming Object-Oriented Programming Robert Rand University of Pennsylvania February 10, 2016 Robert Rand (University of Pennsylvania) CIS 192 February 10, 2016 1 / 25 Outline 1 Object
More informationReview 2. Classes and Subclasses
Review 2 Classes and Subclasses Class Definition class (): """Class specification""" class variables (format: Class.variable) initializer ( init ) special method definitions
More informationWhat is a class? Responding to messages. Short answer 7/19/2017. Code Listing 11.1 First Class. chapter 11. Introduction to Classes
chapter 11 Code Listing 11.1 First Class Introduction to Classes What is a class? If you have done anything in computer science before, you likely will have heard the term object oriented programming (OOP)
More informationS206E Lecture 21, 5/26/2016, Python classes
S206E057 Spring 2016 Copyright 2016, Chiu-Shui Chan. All Rights Reserved. Python has the notions of classes and objects from using dictionaries and modules to facilitate repetitious tasks. Information
More informationLecture #7: Recursion (and a data structure)
Lecture #7: Recursion (and a data structure) Announcements: A message from the AWE: The Association of Women in EECS is hosting a 61A party this Sunday (2/9) from 1 3PM in the Woz! Come hang out, befriend
More informationAnnouncements for This Lecture
Lecture 16 Classes Announcements for This Lecture Prelim and Regrades Still have some prelims Apparently were misfiled Pick them up in office hours Regrades in CMS next week Only for MAJOR mistakes We
More informationPython for Finance. Advanced Features. Andras Niedermayer
Python for Finance Advanced Features Andras Niedermayer Objects of Interest object oriented programming (Wikipedia) Definition (Object-oriented Programming) Object-oriented programming (OOP) is a programming
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 informationCS558 Programming Languages Winter 2013 Lecture 8
OBJECT-ORIENTED PROGRAMMING CS558 Programming Languages Winter 2013 Lecture 8 Object-oriented programs are structured in terms of objects: collections of variables ( fields ) and functions ( methods ).
More informationDECOMPOSITION, ABSTRACTION, FUNCTIONS
DECOMPOSITION, ABSTRACTION, FUNCTIONS (download slides and.py files follow along!) 6.0001 LECTURE 4 6.0001 LECTURE 4 1 LAST TIME while loops vs for loops should know how to write both kinds should know
More information# track total function calls using a global variable global fibcallcounter fibcallcounter +=1
Math 4242 Fibonacci, Memoization lecture 13 Today we talk about a problem that sometimes occurs when using recursion, and a common way to fix it. Recall the Fibonacci sequence (F 0, F 1, F 2,...) that
More informationObjects and Classes APRIL 23 RD 2012
Objects and Classes APRIL 23 RD 2012 Object-Oriented Programming: Example Suppose your program needs to maintain millions of polygons. This is something that graphics programs might have to do because
More informationAnnouncements for This Lecture
Lecture 17 Classes Announcements for This Lecture Assignments A4 Thursday at midnight Hopefully you are on Task 4 Minor extension for reasons Will post A5 on Wednesday Written assignment like A2 Needs
More informationCS61A Lecture 21. Amir Kamil UC Berkeley March 11, 2013
CS61A Lecture 21 Amir Kamil UC Berkeley March 11, 2013 Announcements HW7 due on Wednesday Ants project out Looking Up Names Name expressions look up names in the environment Dot expressions look
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 informationCS 11 python track: lecture 4
CS 11 python track: lecture 4 Today: More odds and ends assertions "print >>" syntax more on argument lists functional programming tools list comprehensions More on exception handling More on object-oriented
More information1 State, objects, and abstraction
6.01, Spring Semester, 2008 Course notes for Week 4 1 MASSACHVSETTS INSTITVTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.01 Introduction to EECS I Spring Semester, 2008 Course
More informationStructure and Interpretation of Computer Programs Spring 2014 Final (with corrections)
CS 61A Structure and Interpretation of Computer Programs Spring 2014 Final (with corrections) INSTRUCTIONS You have 3 hours to complete the exam. The exam is open book and open notes. You may not use a
More information27. Means and Medians. What? What? Three Instructive Problems: The Apportionment Problem The Polygon Averaging Problem The Median Filtering Problem
2. Means and Medians What? Three Instructive Problems: The Apportionment Problem The Polygon Averaging Problem The Median Filtering Problem The Apportionment Problem How to fairly distribute 435 Congressional
More informationTTIC 31230, Fundamentals of Deep Learning David McAllester, April Backpropagation. The Educational Framework (EDF)
TTIC 31230, Fundamentals of Deep Learning David McAllester, April 2017 Backpropagation The Educational Framework (EDF) Feed-Forward Computation Graphs l is a scalar loss. v k+1 = f 1 (v 0,..., v k ) v
More informationCSE : Python Programming. Decorators. Announcements. The decorator pattern. The decorator pattern. The decorator pattern
CSE 399-004: Python Programming Lecture 12: Decorators April 9, 200 http://www.seas.upenn.edu/~cse39904/ Announcements Projects (code and documentation) are due: April 20, 200 at pm There will be informal
More informationProgramming Languages
CSE 130 : Fall 2011 Programming Languages Lecture 14: Objects, Classes, Inheritance Ranjit Jhala UC San Diego News PA 6 Out Due after Thanksgiving Today: Objects Namespace == Object What ways have we seen
More informationLecture #16: Generic Functions and Expressivity. Last modified: Fri Feb 26 19:16: CS61A: Lecture #16 1
Lecture #16: Generic Functions and Expressivity Last modified: Fri Feb 26 19:16:38 2016 CS61A: Lecture #16 1 Consider the function find: Generic Programming def find(l, x, k): """Return the index in L
More informationPython. Tutorial Lecture for EE562 Artificial Intelligence for Engineers
Python Tutorial Lecture for EE562 Artificial Intelligence for Engineers 1 Why Python for AI? For many years, we used Lisp, because it handled lists and trees really well, had garbage collection, and didn
More informationFundamentals of Programming. Week 1 - Lecture 3: Loops
15-112 Fundamentals of Programming Week 1 - Lecture 3: Loops May 18, 2016 Basic Building Blocks Statements Tells the computer to do something. Data Types Data is divided into different types. Variables
More informationFinal Exam(sample), Fall, 2014
Final Exam(sample), Fall, 2014 Date: Dec 4 th, 2014 Time: 1.25 hours (1.00 a.m. 2:15 p.m.) Total: 100 points + 20 bonus Problem 1 T/F 2 Choice 3 Output Points 16 16 48 4 Programming 20 5 Bonus 20 Total
More informationWelcome to CSC148! Introduction to Computer Science
Welcome to CSC148! Introduction to Computer Science Amir H. Chinaei, Summer 2016 ahchinaei@cs.toronto.edu http://www.cs.toronto.edu/~ahchinaei/ Office hours: R 10 BA4222 Today Course Outline (bird s-eye
More informationFundamentals of Python: First Programs. Chapter 4: Text Files
Fundamentals of Python: First Programs Chapter 4: Text Files Objectives After completing this section, you will be able to Open a text file for output and write strings or numbers to the file Open a text
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 informationSTATS 507 Data Analysis in Python. Lecture 2: Functions, Conditionals, Recursion and Iteration
STATS 507 Data Analysis in Python Lecture 2: Functions, Conditionals, Recursion and Iteration Functions in Python We ve already seen examples of functions: e.g., type()and print() Function calls take the
More informationCOMP519 Web Programming Lecture 21: Python (Part 5) Handouts
COMP519 Web Programming Lecture 21: Python (Part 5) Handouts Ullrich Hustadt Department of Computer Science School of Electrical Engineering, Electronics, and Computer Science University of Liverpool Functions
More informationLecture 38: Python. CS 51G Spring 2018 Kim Bruce
Lecture 38: Python CS 51G Spring 2018 Kim Bruce Announcements Test program 2 Academic Honesty Guidelines! Quiz Friday (Strings & Streams) Lecture Friday will be in lab Write searches and sorts in Python
More informationProgramming for Engineers in Python
Programming for Engineers in Python Lecture 5: Object Oriented Programming Autumn 2011-12 1 Lecture 4 Highlights Tuples, Dictionaries Sorting Lists Modular programming Data analysis: text categorization
More informationHashing. So what we do instead is to store in each slot of the array a linked list of (key, record) - pairs, as in Fig. 1. Figure 1: Chaining
Hashing Databases and keys. A database is a collection of records with various attributes. It is commonly represented as a table, where the rows are the records, and the columns are the attributes: Number
More informationSelection statements. CSE 1310 Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington
Selection s CSE 1310 Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington 1 Book reference Book: The practice of Computing Using Python 2-nd edition Second hand book
More informationIntroduction to Python (All the Basic Stuff)
Introduction to Python (All the Basic Stuff) 1 Learning Objectives Python program development Command line, IDEs, file editing Language fundamentals Types & variables Expressions I/O Control flow Functions
More informationAnnouncements. Lab 11 is due tomorrow. Quiz 6 is on Monday. Ninja session tonight, 7-9pm. The final is in two weeks!
Linked Lists Announcements Lab 11 is due tomorrow Quiz 6 is on Monday - Emphasis on sorting and recursion Ninja session tonight, 7-9pm The final is in two weeks! - Will cover class definitions and linked
More informationCSE 115. Introduction to Computer Science I
CSE 115 Introduction to Computer Science I Announcements Graded TopHat questions starts Fri. Sign up soon (& talk to us for help) Calling Function & Defining Function May need both lectures for UBInfinite
More information61A 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 informationVisTrails Introduction
VisTrails Introduction Bela Bauer (bauerb@phys.ethz.ch) Vistrails windows Views Input ports Modules Important for source modules! Ports: Input/Output Name Type: VT module class Connects only matching types
More informationPython Basics. Nakul Gopalan With help from Cam Allen-Lloyd
Python Basics Nakul Gopalan ngopalan@cs.brown.edu With help from Cam Allen-Lloyd 1 Introduction to the idea Readable, easy to learn programming language. Created by Guido van Rossum Named after the BBC
More informationInequalities and you 3
Inequalities and you 3 NAME: This worksheet will provide practice for solving absolute value, polynomial, and rational inequalities. We will also work on understanding why the procedures work. We will
More informationLearning from Bad Examples. CSCI 5828: Foundations of Software Engineering Lecture 25 11/18/2014
Learning from Bad Examples CSCI 5828: Foundations of Software Engineering Lecture 25 11/18/2014 1 Goals Demonstrate techniques to design for shared mutability Build on an example where multiple threads
More informationLecture 13: Expression Evaluation
The University of North Carolina at Chapel Hill Spring 2002 Lecture 13: Expression Evaluation Feb 8 1 Control Flow Control flow refers to the order in which a program executes This is fundamental in the
More informationExceptions. raise type(message) raise Exception(message)
Classes Special thanks to Roy McElmurry, Scott Shawcroft, Ryan Tucker, and Paul Beck for their work on these slides. Except where otherwise noted, this work is licensed under: http://creativecommons.org/licenses/by-nc-sa/.0
More informationCS 1110, Spring 2018: Prelim 1 study guide Prepared Tuesday March 6, 2018
CS 1110, Spring 2018: Prelim 1 study guide Prepared Tuesday March 6, 2018 Administrative info Time and locations of the regular exam listed at http://www.cs.cornell.edu/courses/cs1110/2018sp/exams What
More informationIn new OpenMDAO, we just need the definition of Component, but it now lives in a different location.
Purpose of This Document The purpose behind the OpenMDAO Conversion Guide is to help users of previous versions of OpenMDAO (versions up to and including 0.13.0) to change their models over to the new
More informationMEMOIZATION, RECURSIVE DATA, AND SETS
MEMOIZATION, RECURSIVE DATA, AND SETS 4b COMPUTER SCIENCE 61A July 18, 2013 1 Memoization Later in this class, you ll learn about orders of growth and how to analyze exactly how efficient (or inefficient)
More informationLecture 16: Static Semantics Overview 1
Lecture 16: Static Semantics Overview 1 Lexical analysis Produces tokens Detects & eliminates illegal tokens Parsing Produces trees Detects & eliminates ill-formed parse trees Static semantic analysis
More informationClasses and Objects 1 / 13
Classes and Objects 1 / 13 Python is Object-Oriented Every value in Python is an object, meaning an instance of a class. Even values that are considered "primitive" in some other languages. >>> type(1)
More informationCP215 Application Design
CP215 Application Design New ATLAS humanoid robot: https://youtu.be/rvlhmgqgdky Tech News! Tech News! New ATLAS humanoid robot: https://youtu.be/rvlhmgqgdky Spotify moving data to Google Cloud Hacker's
More informationExceptions. raise type(message) raise Exception(message)
Built-In Functions Special thanks to Scott Shawcroft, Ryan Tucker, and Paul Beck for their work on these slides. Except where otherwise noted, this work is licensed under: http://creativecommons.org/licenses/by-nc-sa/.0
More informationCS108 Lecture 16: User Defined Classes. Overview/Questions
CS108 Lecture 16: User Defined Classes Aaron Stevens 23 February 2009 1 Overview/Questions Review: the function of functions Thinking about program structure Review: objects and classes How do we design
More information6.01, Spring Semester, 2008 Assignment 3, Issued: Tuesday, February 19 1
6.01, Spring Semester, 2008 Assignment 3, Issued: Tuesday, February 19 1 MASSACHVSETTS INSTITVTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.01 Introduction to EECS I Spring
More informationIntroduction to Programming in C Department of Computer Science and Engineering. Lecture No. #23 Loops: Precedence of Operators
Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #23 Loops: Precedence of Operators This one more concept that we have to understand, before we really understand
More informationLinked Structures Chapter John Wiley & Sons, Data Structures and Algorithms Using Python, by Rance D. Necaise.
Linked Structures Chapter 6 Linked Structure Constructed using a collection of objects called nodes. Each node contains data and at least one reference or link to another node. Linked list a linked structure
More informationThe Pyth Language. Administrivia
Administrivia The Pyth Language Lecture 5 Please make sure you have registered your team, created SSH keys as indicated on the admin page, and also have electronically registered with us as well. Prof.
More informationClass Design (Section 9 of 17)
the architects themselves came in to explain the advantages of both designs Class Design (Section 9 of 17) In the previous sections we have used existing classes that enable us to be able to write functions
More informationINTERPRETERS 8. 1 Calculator COMPUTER SCIENCE 61A. November 3, 2016
INTERPRETERS 8 COMPUTER SCIENCE 61A November 3, 2016 1 Calculator We are beginning to dive into the realm of interpreting computer programs that is, writing programs that understand other programs. In
More informationHave classes that describe the format of objects. Create objects by stating the class of the object to be created.
Class-based model Have classes that describe the format of objects Create objects by stating the class of the object to be created. The created object is called an instance of the class Class-based model
More informationMITOCW watch?v=flgjisf3l78
MITOCW watch?v=flgjisf3l78 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high-quality educational resources for free. To
More informationRLISTS AND THE ENVIRONMENT MODEL 9
RLISTS AND THE ENVIRONMENT MODEL 9 COMPUTER SCIENCE 61A July 17, 2012 1 Recursive Lists (RLists) Earlier in the course, we worked with the Immutable Recursive List (IRList), which is an abstract data type
More informationTeaching London Computing
Teaching London Computing A Level Computer Science Topic 1: GCSE Python Recap William Marsh School of Electronic Engineering and Computer Science Queen Mary University of London Aims What is programming?
More informationVariables: Objects in R
Variables: Objects in R Basic R Functionality Introduction to R for Public Health Researchers Common new users frustations 1. Different versions of software 2. Data type problems (is that a string or a
More informationLecture 4. while and for loops if else test Tuples Functions. Let us start Python Ssh (putty) to UNIX/Linux computer puccini.che.pitt.
Lecture 4 while and for loops if else test Tuples Functions Let us start Python Ssh (putty) to UNIX/Linux computer puccini.che.pitt.edu Launching Python > python Quick Reminder: while Loop Example >>>
More informationDangerously Advanced Python
Dangerously Advanced Python Mike Verdone for Protospace, Calgary May 2009 http://mike.verdone.ca/ Introspection and Metaprogramming Introspection: Programs that can interrogate their own data structures
More informationWeek 2. Classes and Objects
Week 2 Classes and Objects Special thanks to Scott Shawcroft, Ryan Tucker, and Paul Beck for their work on these slides. Except where otherwise noted, this work is licensed under: http://creativecommons.org/licenses/by-nc-sa/3.0
More informationPIC 16: Iterators and Generators
PIC 16: Iterators and Generators Assigned 10/9/2018. To be completed before lecture 10/12/2018. Intended Learning Outcomes. By the end of this preparatory assignment, students should be able to: implement
More informationCS1110 Lab 5: Practice for A4 (Mar 8-9, 2016) First Name: Last Name: NetID:
CS1110 Lab 5: Practice for A4 (Mar 8-9, 2016) First Name: Last Name: NetID: The lab assignments are very important. Remember this: The lab problems feed into the assignments and the assignments define
More informationIteration Part 1. Motivation for iteration. How does a for loop work? Execution model of a for loop. What is Iteration?
Iteration Part 1 Motivation for iteration Display time until no more time left Iteration is a problemsolving strategy found in many situations. Keep coding until all test cases passed CS111 Computer Programming
More informationLesson 18: Animation. Computer Programming is Fun!
Lesson 18: Animation So how do you make your drawings move and change? That's what this section is about. I'd like to introduce you to your new friend, Mr. Timer. A timer gives you the ability to tell
More informationLecture Notes, CSE 232, Fall 2014 Semester
Lecture Notes, CSE 232, Fall 2014 Semester Dr. Brett Olsen Week 11 - Number Theory Number theory is the study of the integers. The most basic concept in number theory is divisibility. We say that b divides
More informationCS154. Streaming Algorithms and Communication Complexity
CS154 Streaming Algorithms and Communication Complexity 1 Streaming Algorithms 2 Streaming Algorithms 01 42 3 L = {x x has more 1 s than 0 s} Initialize: C := 0 and B := 0 When the next symbol x is read,
More informationArtificial Intelligence Lecture 1
Artificial Intelligence Lecture 1 istrative Matters Webpage: www.aass.oru.se/~mbl/ai Examiner: Mathias Broxvall Assistant: Lia Susana d.c. Silva Lopez Schedule 20 hours/week on this course. 4 hours lectures,
More informationComputational Mathematics with Python
Computational Mathematics with Python Classes Claus Führer, Jan Erik Solem, Olivier Verdier Spring 2010 Claus Führer, Jan Erik Solem, Olivier Verdier Computational Mathematics with Python Spring 2010 1
More informationUNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division. P. N. Hilfinger
UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division CS 164 Spring 2005 P. N. Hilfinger Project #2: Static Analyzer for Pyth Due: Wednesday, 6 April
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 informationJython. secondary. memory
2 Jython secondary memory Jython processor Jython (main) memory 3 Jython secondary memory Jython processor foo: if Jython a
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 informationLecture 17: Classes (Chapter 15)
http://www.cs.cornell.edu/courses/cs1110/018sp Lecture 17: Classes (Chapter 15) CS 1110 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner, C. Van Loan, W. White]
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 information