Defining Classes. CS Recitation 11
|
|
|
- Anis Harris
- 5 years ago
- Views:
Transcription
1 Defining Classes CS Recitation 11
2 Recap Previous week
3 We know how to define functions Define a function: Call a function: def function(value): temp = value * value return temp def main(): result = function(10) print(result) main()
4 We also used some other classes and objects How we used classes in Graphics: mycircle = Circle(Point(0,10), 200) Circle is class mycircle is object But we did not define any classes yet. We will learn how to define classes today.
5 Define & use a class How to define a class: class Point: def init (self, x, y): self.x = x self.y = y def printpoint(self): print('(', self.x, ',', self.y, ')') How to use the class: def main(): p = Point(10, 50) p.printpoint() main()
6 Define & use a class How to define a class: class Point: def init (self, x, y): self.x = x self.y = y def printpoint(self): print('(', self.x, ',', self.y, ')') How to use the class: def main(): p = Point(10, 50) p.printpoint() main() constructor function
7 Define & use a class How to define a class: class Point: def init (self, x, y): self.x = x self.y = y def printpoint(self): print('(', self.x, ',', self.y, ')') How to use the class: def main(): p = Point(10, 50) p.printpoint() constructor function main() pointer to the object itself
8 Define & use a class other input parameters How to define a class: class Point: def init (self, x, y): self.x = x self.y = y def printpoint(self): print('(', self.x, ',', self.y, ')') How to use the class: def main(): p = Point(10, 50) p.printpoint() constructor function main() pointer to the object itself
9 Define & use a class other input parameters How to define a class: class Point: def init (self, x, y): self.x = x self.y = y def printpoint(self): print('(', self.x, ',', self.y, ')') How to use the class: def main(): p = Point(10, 50) p.printpoint() constructor function object, instance main() pointer to the object itself
10 Define & use a class How to define a class: class Point: def init (self, x, y): self.x = x self.y = y def printpoint(self): print('(', self.x, ',', self.y, ')') How to use the class: def main(): p = Point(10, 50) p.printpoint() main() Prints: ( 10, 50 )
11 Matrix example
12 Matrix example class Matrix: def init (self, m, n, character): self.m = m self.n = n self.character = character def printmatrix(self): for i in range(self.m): for j in range(self.n): print(self.character, end=' ') print() def main(): m = Matrix(4, 5, '*') m.printmatrix() main() Prints: * * * * * new line print without new line * * * * * * * * * * * * * * *
13 Matrix example class Matrix: def init (self, m, n, character): self.m = m self.n = n self.character = character def printmatrix(self): for i in range(self.m): for j in range(self.n): print(self.character, end=' ') print() def main(): m = Matrix(3, 7, '0') m.printmatrix() main() Prints:
14 Matrix example class Matrix: def init (self, m, n, character): self.m = m self.n = n self.character = character def main(): m = Matrix(3, 7, '0') print(m.m) print(m.n) print(m.character) def printmatrix(self): for i in range(self.m): for j in range(self.n): print(self.character, end=' ') print() main() Prints: 3 7 0
15 Matrix example class Matrix: def init (self, m, n, character): self.m = m self.n = n self.character = character def printmatrix(self): for i in range(self.m): for j in range(self.n): print(self.character, end=' ') print() def main(): m = Matrix(3, 7, '0') print(m.value) main() Error: Traceback (most recent call last): File "a.py", line 16, in <module> print(m.value) AttributeError: 'Matrix' object has no attribute 'value'
16 Matrix example class Matrix: def init (self, m, n, character): self.m = m self.n = n self.character = character def printmatrix(self): for i in range(self.m): for j in range(self.n): print(self.character, end=' ') print() def main(): m = Matrix(3, 7, '0') m.print() main() Error: Traceback (most recent call last): File "a.py", line 15, in <module> m.print() AttributeError: 'Matrix' object has no attribute 'print'
17 Multi-side Dice Example
18 Multi-side Dice Example from random import randrange class MSDice: def init (self, sides): self.sides = sides self.value = 1 def roll(self): self.value = randrange(1, self.sides+1) def getvalue(self): return self.value def setvalue(self, value): self.value = value
19 Multi-side Dice Example from random import randrange class MSDice: def init (self, sides): self.sides = sides self.value = 1 def roll(self): self.value = randrange(1, self.sides+1) def getvalue(self): return self.value def setvalue(self, value): self.value = value def main(): dice = MSDice(6) dice.roll() print(dice.getvalue()) main() Prints:?
20 Multi-side Dice Example from random import randrange class MSDice: def init (self, sides): self.sides = sides self.value = 1 def roll(self): self.value = randrange(1, self.sides+1) def getvalue(self): return self.value def setvalue(self, value): self.value = value def main(): dice = MSDice(6) dice.roll() print(dice.getvalue()) main() Prints: 5
21 Multi-side Dice Example from random import randrange class MSDice: def init (self, sides): self.sides = sides self.value = 1 def roll(self): self.value = randrange(1, self.sides+1) def getvalue(self): return self.value def setvalue(self, value): self.value = value def main(): dice = MSDice(6) dice.roll() print(dice.getvalue()) dice.roll() print(dice.getvalue()) main() Prints:?
22 Multi-side Dice Example from random import randrange class MSDice: def init (self, sides): self.sides = sides self.value = 1 def roll(self): self.value = randrange(1, self.sides+1) def main(): dice = MSDice(6) dice.roll() print(dice.getvalue()) dice.roll() print(dice.getvalue()) main() def getvalue(self): return self.value def setvalue(self, value): self.value = value Prints: 5 4
23 Multi-side Dice Example from random import randrange class MSDice: def init (self, sides): self.sides = sides self.value = 1 def roll(self): self.value = randrange(1, self.sides+1) def getvalue(self): return self.value def setvalue(self, value): self.value = value def main(): dice = MSDice(6) dice.roll() dice.setvalue(11) print(dice.getvalue()) main() Prints:?
24 Multi-side Dice Example from random import randrange class MSDice: def init (self, sides): self.sides = sides self.value = 1 def roll(self): self.value = randrange(1, self.sides+1) def main(): dice = MSDice(6) dice.roll() dice.setvalue(11) print(dice.getvalue()) main() def getvalue(self): return self.value def setvalue(self, value): self.value = value Prints: 11
25 Card example
26 Card example class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', 7', '8', '9', '10', 'J', 'Q', 'K', 'A' ] print(typechars[self.cardtype], end=' ') print(numberchars[self.number])
27 Card example class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A' ] print(typechars[self.cardtype], end=' ') print(numberchars[self.number]) card = Card(0) card.printcard() card = Card(51) card.printcard() Output??
28 Card example class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A' ] print(typechars[self.cardtype], end=' ') print(numberchars[self.number]) card = Card(0) card.printcard() card = Card(51) card.printcard() Output: 2 A
29 Card example class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A' ] print(typechars[self.cardtype], end=' ') print(numberchars[self.number]) for i in range(7, 17): card = Card(i) card.printcard() Output??
30 Card example class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', '7', '7', '8', '8', '9', '10', 'J', 'Q', 'K', 'A' ] print(typechars[self.cardtype], end=' ') print(numberchars[self.number]) for i in range(7, 17): card = Card(i) card.printcard() Output: 9 10 J Q K A
31 Card example class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', '7', '7', '8', '8', '9', '10', 'J', 'Q', 'K', 'A' ] for i in range(5): temp = randrange(52) card = Card(temp) card.printcard() Output:? print(typechars[self.cardtype], end=' ') print(numberchars[self.number])
32 Card example class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 for i in range(5): temp = randrange(52) card = Card(temp) card.printcard() def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A' ] print(typechars[self.cardtype], end=' ') print(numberchars[self.number]) Output: J 6
33 Card example class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 for i in range(5): temp = randrange(52) card = Card(temp) card.printcard() def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A' ] print(typechars[self.cardtype], end=' ') print(numberchars[self.number]) 3 runs: J 6
34 from random import randrange class Card: def init (self, value): self.cardtype = int(value/13) self.number = value % 13 def printcard(self): typechars = ['\u2664', # spades '\u2661', # hearts '\u2662', # diamonds '\u2667'] # clubs numberchars = [ '2', '3', '4', '5', '6', 7', '8', '9', '10', 'J', 'Q', 'K', 'A' ] self self new function print(typechars[self.cardtype], end=' ') print(numberchars[self.number]) def getrandomcard(): temp = randrange(52) return Card(temp) no self card = Card.getRandomCard() card.printcard()
35 Card example for i in range(5): card = Card.getRandomCard() card.printcard() What is the probability of having at least one card twice?
36 Card example for i in range(5): card = Card.getRandomCard() card.printcard() What is the probability of having at least one card twice? = 1 - probability of having all cards different = 1 - ( 52/52 * 51/52 * 50/52 * 49/52 * 48/52) =
37 Card example for i in range(5): card = Card.getRandomCard() card.printcard() What is the probability of having at least one card twice? 1st trial: 2nd trial: 3rd trial: 4th trial: 5th trial: J Q J 9 9 Q 6 K Voila!
38 Card example Using our Card class, how to pick 5 unique cards? But first card1 = Card(30) card2 = Card(30) if card1 == card2: print('yes') else: print('no') Output??
39 Card example Using our Card class, how to pick 5 unique cards? But first card1 = Card(30) card2 = Card(30) if card1 == card2: print('yes') else: print('no') Output? no
40 Card example Using our Card class, how to pick 5 unique cards? Let s create a Deck!
41 Card example Using our Card class, how to pick 5 unique cards? deck = [] for i in range(52): card = Card(i) deck.append(card) Output?? for i in range(5): card = random.choice(deck) card.printcard() deck.remove(card)
42 Card example Using our Card class, how to pick 5 unique cards? deck = [] for i in range(52): card = Card(i) deck.append(card) for i in range(5): card = random.choice(deck) card.printcard() deck.remove(card) Output: Q 2
43 Card example Using our Card class, how to pick 5 unique cards? deck = [] print(len(deck)) Output? for i in range(52): card = Card(i) deck.append(card) print(len(deck)) for i in range(5): card = random.choice(deck) card.printcard() deck.remove(card) print(len(deck))
![Card example Using our Card class, how to pick 5 unique cards? deck = [] print(len(deck)) for i in range(52): card = Card(i) deck.](/docs-images/95/123282106/images/44-0.jpg "append(card) print(len(deck)) for i in range(5): card = random.choice(deck) card.printcard() deck.remove(card) print(len(deck)) Output?")
44 Card example Using our Card class, how to pick 5 unique cards? deck = [] print(len(deck)) for i in range(52): card = Card(i) deck.append(card) print(len(deck)) for i in range(5): card = random.choice(deck) card.printcard() deck.remove(card) print(len(deck)) Output? Q 9 47
45 Card example Using our Card class, how to pick 5 unique cards? deck = [] print(len(deck)) for i in range(52): card = Card(i) deck.append(card) print(len(deck)) for i in range(5): card = random.choice(deck) card.printcard() deck.remove(card) print(len(deck)) Q 9 47
46 Questions Thanks
Professor Hugh C. Lauer CS-1004 Introduction to Programming for Non-Majors
Objects (again) Professor Hugh C. Lauer CS-1004 Introduction to Programming for Non-Majors (Slides include materials from Python Programming: An Introduction to Computer Science, 2 nd edition, by John
Example: Class MSDie Introduction to Graphs and NetworkX
Example: Class MSDie Introduction to Graphs and NetworkX Monday, March 30, 2009 1 Be careful whose random number generator you trust http://xkcd.com/221/ 2 1 Reminders Sample exam questions have been posted
Introduction to Computer Programming for Non-Majors
Introduction to Computer Programming for Non-Majors CSC 2301, Fall 2016 Chapter 10 Part 1 Instructor: Long Ma The Department of Computer Science Top-Down Design 2 In top-down design, a complex problem
Introduction. We've seen Python useful for. This lecture discusses Object Oriented Programming. Simple scripts Module design
Introduction We've seen Python useful for Simple scripts Module design This lecture discusses Object Oriented Programming Better program design Better modularization What is an object? An object is an
Outline: Defining objects (Ch10)
Defining objects Michael Mandel Lecture 10 Methods in Computational Linguistics I The City University of New York, Graduate Center https://github.com/ling78100/lectureexamples/blob/master/lecture10final.ipynb
Lecture. Classes. Richard E Sarkis CSC 161: The Art of Programming
Lecture Classes Richard E Sarkis CSC 161: The Art of Programming Class Administrivia Agenda Formalize our understanding of objects To appreciate how defining new classes and using objects can provide structure
CS 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
ComS 207: Programming I Homework 7 Out: Wed. Oct 11, 2006 Due: Fri. Oct 20, 2006 (Online submission *ONLY*) Student Name: Recitation Section:
ComS 207: Programming I Homework 7 Out: Wed. Oct 11, 2006 Due: Fri. Oct 20, 2006 (Online submission *ONLY*) Student Name: Recitation Section: Some of these problems came from your textbook. The text is
Pointers and Strings Chapters 10, Pointers and Arrays (10.3) 3.2 Pointers and Arrays (10.3) An array of ints can be declared as
Pointers and Strings Chapters 10, 12 2/5/07 CS250 Introduction to Computer Science II 1 3.1 Pointers and Arrays (10.3) An array of ints can be declared as o int numbers[] = 1, 2, 3, 4, 5; numbers is also
CS 11 python track: lecture 2
CS 11 python track: lecture 2 Today: Odds and ends Introduction to object-oriented programming Exception handling Odds and ends List slice notation Multiline strings Docstrings List slices (1) a = [1,
Outline. Outline. 1 Chapter 2: Data Abstraction
Outline Outline 1 Chapter 2: Data Abstraction From Data Type to ADT Values A value is a unit of information used in a program. It can be associated with a constant or variable (a name) by an assignment
Introduction to Computer Programming for Non-Majors
Introduction to Computer Programming for Non-Majors CSC 2301, Fall 2014 Chapter 10 Part 2 The Department of Computer Science Cannonball Program Specification Let s try to write a program that simulates
Week 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
TTIC 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
Last Name: UTION First Name: SOL Cornell NetID: CS1110. Solution: CS 1110 Prelim 2 April 26, 2016
Last Name: UTION First Name: SOL Cornell NetID: CS1110 CS 1110 Prelim 2 April 26, 2016 1. [6 points] What is the output if the following module is run: def F1(x): y = [] # empty list n = len(x) for k in
Random Numbers; Object-Oriented Programming 11/14/2017
Random Numbers; Object-Oriented Programming 11/14/2017 1 Announcements PS 5 is ready Today: Random Numbers; Object-Oriented Programming Reading: Chapter 7 of Conery Acknowledgement: Some of this lecture
Introduction to Computer Programming for Non-Majors
Introduction to Computer Programming for Non-Majors CSC 2301, Fall 2015 Chapter 10 The Department of Computer Science Objectives Chapter 10 Part 1 To know how defining new classes can provide structure
CS 11 Ocaml track: lecture 2
Today: CS 11 Ocaml track: lecture 2 comments algebraic data types more pattern matching records polymorphic types ocaml libraries exception handling Previously... ocaml interactive interpreter compiling
Sample file. Practice Exam One COMPUTER SCIENCE A SECTION I. Directions: Determine the answer to each of the following questions or incomplete
Practice Exam One / Level A Diagnostic Test 5 Practice Exam One COMPUTER SCIENCE A SECTION I Time 1 hour and 15 minutes Number of questions 40 Percent of total grade 50 Directions: Determine the answer
Lecture 21. Topics: Chapter 10. Defining Classes 10.4 Data processing with class 10.5 Objects and encapsulation 10.6 Widgets
Lecture 21 Topics: Chapter 10. Defining Classes 10.4 Data processing with class 10.5 Objects and encapsulation 10.6 Widgets 1 10.4 Data processing with class Example with dice from the previous meeting
Python Programming: An Introduction To Computer Science
Python Programming: An Introduction To Computer Science Chapter 10 Defining Classes Python Programming, 2/e 1 Objectives æ To appreciate how defining new classes can provide structure for a complex program.
Programming in Lua Objects
Programming in Lua Objects Fabio Mascarenhas http://www.dcc.ufrj.br/~fabiom/lua Methods and : In most object oriented languages, a method has an implicit receiver, usually called self or this, in addition
Lists in Python. >>> chinese_suits = ['coin', 'string', 'myriad'] # A list literal >>> suits = chinese_suits # Two names refer to the same list
![Lists in Python. >>> chinese_suits = ['coin', 'string', 'myriad'] # A list literal >>> suits = chinese_suits # Two names refer to the same list](/thumbs/87/96960951.jpg "Lists in Python. >>> chinese_suits = ['coin', 'string', 'myriad'] # A list literal >>> suits = chinese_suits # Two names refer to the same list")
Lists in Python The List is Python's most useful and flexible sequence type. A list is similar to a tuple, but it is mutable: Method calls and assignment statements can change the contents of a list. We
Scripting and Visualization
Scripting and Visualization Scripting Python basics IDL basics (GDL) Visualization (Peter Teuben) (Mark Vogelsberger) Python::Matplotlib, tvtk, mayavi (Matthew Turk) Vis5d, IDL widgets (Anatoly Spitkovsky)
mith College Computer Science Week 9 CSC111 - Fall 2018 Dominique Thiébaut
mith College Computer Science Week 9 CSC111 - Fall 2018 Dominique Thiébaut dthiebaut@smith.edu Dealing with Exceptions (Chapter 7.4) Defining Classes (Chapter 10) # getinput: returns an integer larger
CS 234. Module 3. September 29, CS 234 Module 3 Data structures, ADTs with no order of any kind, Python review 1 / 19
CS 234 Module 3 September 29, 2016 CS 234 Module 3 Data structures, ADTs with no order of any kind, Python review 1 / 19 Recipe for provider/plan Choosing among data structures (provider/plan): 1. Create
CSC148-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
CP215 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
Fun with Python Descriptors
Fun with Python Descriptors Author: Jeff Rush Date: 2006-11-25 include directive disabled... include:: Overview What are descriptors? Implementation: attribute watcher Implementation: property()
CMSC330 Spring 2017 Midterm #1 9:30am/11:00am/12:30pm/5:00pm
CMSC330 Spring 2017 Midterm #1 9:30am/11:00am/12:30pm/5:00pm Name (PRINT YOUR NAME as it appears on gradescope ): Discussion Time (circle one) 10am 11am 12pm 1pm 2pm 3pm Discussion TA (circle one) Aaron
03 Pyro. Python Remote Objects. Distributed Object Technology. 100% pure Python Naming Service Mobile objects Exceptions transports
03 Pyro Python Remote Objects Pyro3 - https://pythonhosted.org/pyro/ Pyro4 - https://pythonhosted.org/pyro4/ Distributed Object Technology RMI Mobile code 100% pure Python Naming Service Mobile objects
CS1 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
Structures. Today s Goals. Structure Operations. Structure Type Declaration. Struct Instance. typedef. CS246 Lec12. Structures
Today s Goals Section 1 Structures Structures Types and variables typedef structs and pointers Unions Enumerations To group multiple (heterogeneous) variables Similar to Java classes, but not as powerful
6.009 Fundamentals of Programming
6.009 Fundamentals of Programming Lecture 5: Custom Types Adam Hartz hz@mit.edu 6.009: Goals Our goals involve helping you develop as a programmer, in multiple aspects: Programming: Analyzing problems,
CS 1110 Prelim 2 April 26th, 2016
Circle your lab/situation: CS 1110 Prelim 2 April 26th, 2016 ACCEL: Tue 12:20 Tue 1:25 Tue 2:30 Tue 3:35 ACCEL : Wed 10:10 Wed 11:15 Wed 12:20 Wed 1:25 Wed 2:30 Wed 3:35 PHILLIPS : Tue 12:20 Tue 1:25 Wed
CS 112 Introduction to Programming
CS 112 Introduction to Programming (Spring 2012) Lecture #9: Arrays Zhong Shao Department of Computer Science Yale University Office: 314 Watson http://flint.cs.yale.edu/cs112 Acknowledgements: some slides
! 52 playing cards in a deck. ! 5 thousand undergrads at Princeton. ! 1 million characters in a book. ! 10 million audio samples in an MP3 file.
Arrays 1.4 Arrays This lecture. Store and manipulate huge quantities of data. Array. Indexed sequence of values of the same type. Examples.! 52 playing cards in a deck.! 5 thousand undergrads at Princeton.!
Objects 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
20. More Complicated Classes. A Class For Manipulating Fractions. A Class For Manipulating Fractions 4/19/2016. Let s Define a Class to Do This Stuff
4/9/26 2. More Complicated Classes Class For Manipulating Fractions Topics: Example: The class Fraction Operator Overloading Class Invariants Example: The class SimpleDate Class Variables deepcopy You
Algorithmic Approaches for Biological Data, Lecture #15
Algorithmic Approaches for Biological Data, Lecture #15 Katherine St. John City University of New York American Museum of Natural History 23 March 2016 Outline Sorting by Keys K. St. John (CUNY & AMNH)
Inf1-OOP. Arrays. Many Variables of the Same Type. Arrays Introduction to Arrays Arrays in Java Shuffling a Deck Multidimensional Arrays Summary/Admin
Inf1-OOP Arrays 1 Perdita Stevens, adapting earlier version by Ewan Klein School of Informatics Arrays Introduction to Arrays Arrays in Java Shuffling a Deck Multidimensional Arrays Summary/Admin January
Lecture 18. Using Classes Effectively
Lecture 18 Using Classes Effectively Announcements for This Lecture Assignments A4 Due Thursday at midnight Hopefully you are on Task 4 Extra consultants available Will post A5 on Thursday Written assignment
CSE115 Introduction to Computer Science for Majors I Spring 2008 Final Exam. First/Given Name (PRINT) May 6, 2008
CSE115 Introduction to Computer Science for Majors I Spring 2008 Final Exam First/Given Name (PRINT) May 6, 2008 Last/Family Name (PRINT) Person #: Recitation Section: B1: T 2:00pm B2: W 10:00am (Circle
FINAL EXAM May 2017 CSC /02: Introduction to Computer Science
FINAL EXAM May 2017 CSC 111 01/02: Introduction to Computer Science Instructor: Sara Mathieson This is a self-scheduled exam to be completed during one of the final exam periods. Please write all your
Programming for Engineers Pointers
Programming for Engineers Pointers ICEN 200 Spring 2018 Prof. Dola Saha 1 Pointers Pointers are variables whose values are memory addresses. A variable name directly references a value, and a pointer indirectly
Inf1-OOP. Arrays 1. Perdita Stevens, adapting earlier version by Ewan Klein. January 11, School of Informatics
Inf1-OOP Arrays 1 Perdita Stevens, adapting earlier version by Ewan Klein School of Informatics January 11, 2015 1 Thanks to Sedgewick&Wayne for much of this content Arrays Introduction to Arrays Arrays
CS5000: Foundations of Programming. Mingon Kang, PhD Computer Science, Kennesaw State University
CS5000: Foundations of Programming Mingon Kang, PhD Computer Science, Kennesaw State University Generating random numbers Obtain a random double value between 0.0 and 1.0, excluding 1.0 Math.random() Random
Classes and Objects. Inheritance
Copyright Software Carpentry 2010 This work is licensed under the Creative Commons Attribution License See http://software-carpentry.org/license.html for more information. Interpolating time series signals
1.4 Arrays. A Foundation for Programming. Arrays. Many Variables of the Same Type. This lecture. Store and manipulate huge quantities of data.
A Foundation for Programming 1.4 Arrays any program you might want to write objects functions and modules graphics, sound, and image I/O arrays store and manipulate huge quantities of data conditionals
CMSC330 Spring 2017 Midterm #1 Solution
CMSC330 Spring 2017 Midterm #1 Solution Name (PRINT YOUR NAME as it appears on gradescope ): Discussion Time (circle one) 10am 11am 12pm 1pm 2pm 3pm Discussion TA (circle one) Aaron Alex Austin Ayman Daniel
CS 1110 Final Exam, May 2018
Last Name: First Name: Cornell NetID, all caps: CS 1110 Final Exam, May 2018 This 150-minute exam has 7 questions worth a total of 79 points. You may tear the pages apart; we have staplers. You may use
Lecture 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,
Fundamentals of Programming Session 20
Fundamentals of Programming Session 20 Instructor: Reza Entezari-Maleki Email: entezari@ce.sharif.edu 1 Fall 2013 These slides have been created using Deitel s slides Sharif University of Technology Outlines
Welcome 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
Objects and Classes Continued. Engineering 1D04, Teaching Session 10
Objects and Classes Continued Engineering 1D04, Teaching Session 10 Recap: HighScores Example txtname1 txtname2 txtscore1 txtscore2 Copyright 2006 David Das, Ryan Lortie, Alan Wassyng 1 recap: HighScores
How Many Sorts? if( list[j] < list[small]) small = j; double temp = list[i]; list[i] = list[small]; list[small] = temp; } // end of i loop
![How Many Sorts? if( list[j] < list[small]) small = j; double temp = list[i]; list[i] = list[small]; list[small] = temp; } // end of i loop](/thumbs/74/70549552.jpg "How Many Sorts? if( list[j] < list[small]) small = j; double temp = list[i]; list[i] = list[small]; list[small] = temp; } // end of i loop")
Topic 7 Interfaces I once attended a Java user group meeting where James Gosling (one of Java's creators) was the featured speaker. During the memorable Q&A session, someone asked him: "If you could do
All program statements you write should be syntactically correct. Partial credit is not guaranteed with incorrect use of syntax.
With Solutions in Red CS110 Introduction to Computing Fall 2012 Section 2 Exam 1 This is an open notes exam. Computers are not permitted. Your work on this exam must be your own. Answer all questions in
Arrays. Inf1-OP. Arrays. Many Variables of the Same Type. Arrays 1. Volker Seeker, adapting earlier version by Perdita Stevens and Ewan Klein
Inf1-OP Arrays 1 Volker Seeker, adapting earlier version by Perdita Stevens and Ewan Klein Arrays School of Informatics February 26, 2018 1 Thanks to Sedgewick&Wayne for much of this content Arrays Arrays:
CSC/MAT-220: Lab 6. Due: 11/26/2018
CSC/MAT-220: Lab 6 Due: 11/26/2018 In Lab 2 we discussed value and type bindings. Recall, value bindings bind a value to a variable and are intended to be static for the life of a program. Type bindings
Inf1-OP. Arrays 1. Volker Seeker, adapting earlier version by Perdita Stevens and Ewan Klein. February 26, School of Informatics
Inf1-OP Arrays 1 Volker Seeker, adapting earlier version by Perdita Stevens and Ewan Klein School of Informatics February 26, 2018 1 Thanks to Sedgewick&Wayne for much of this content Arrays Arrays Arrays:
Announcements. 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
Recap: Pointers. int* int& *p &i &*&* ** * * * * IFMP 18, M. Schwerhoff
Recap: Pointers IFMP 18, M. Schwerhoff int* int& *p &i &*&* ** * * * * A 0 A 1 A 2 A 3 A 4 A 5 A 0 A 1 A 2 A 3 A 4 A 5 5 i int* p; A 0 A 1 A 2 A 3 A 4 A 5 5 i p int* p; p = &i; A 0 A 1 A 2 A 3 A 4 A 5
Python 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
Inf1-OP. Arrays 1. Timothy Hospedales, adapting earlier version by Perdita Stevens and Ewan Klein. January 30, School of Informatics
Inf1-OP Arrays 1 Timothy Hospedales, adapting earlier version by Perdita Stevens and Ewan Klein School of Informatics January 30, 2017 1 Thanks to Sedgewick&Wayne for much of this content Arrays Arrays:
Today. CSE341: Programming Languages. Late Binding in Ruby Multiple Inheritance, Interfaces, Mixins. Ruby instance variables and methods
Today CSE341: Programming Languages Late Binding in Ruby Multiple Inheritance, Interfaces, Mixins Alan Borning Spring 2018 Dynamic dispatch aka late binding aka virtual method calls Call to self.m2() in
CS 1110 Final Exam Solutions May 2018
Last Name: First Name: Cornell NetID, all caps: CS 1110 Final Exam Solutions May 2018 1. Object Diagramming and Terminology. (a) [10 points] The questions on the right pertain to the code on the left.
Scientific Programming. Trees
Scientific Programming Trees Alberto Montresor Università di Trento 2018/11/30 This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. Table of contents 1 Introduction
CSCE121: Introduction to Program Design and Concepts Practice Questions for Midterm 1
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING CSCE121: Introduction to Program Design and Concepts Practice Questions for Midterm 1 March 11, 2018 Question 1: Identify the common elements of two sorted
Review Questions II KEY
CS 102 / ECE 206 Spring 2011 Review Questions II KEY The following review questions are similar to the kinds of questions you will be expected to answer on Exam II (April 7), which will focus on LCR, chs.
PIC 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
Test 2 Practice Problems for the Paper-and-Pencil portion SOLUTION
Page 1 of 19 Test 2 Practice Problems for the Paper-and-Pencil portion SOLUTION Test 2 will assess material covered in Sessions 1 through 14 (but NOT material from Session 15). It will draw problems especially
Relationship between Pointers and Arrays
Relationship between Pointers and Arrays Arrays and pointers are intimately related in C and often may be used interchangeably. An array name can be thought of as a constant pointer. Pointers can be used
Lecture 18. Methods and Operations
Lecture 18 Methods and Operations Announcements for This Lecture Assignments A4 Due Thursday at midnight Hopefully you are on Task 4 Extra consultants available Will post A5 on Thursday Written assignment
1.4 Arrays. A Foundation for Programming. Many Variables of the Same Type. Arrays. !!! any program you might want to write
A Foundation for Programming 1.4 Arrays any program you might want to write objects functions and modules graphics, sound, and image I/O arrays store and manipulate huge quantities of data conditionals
Chapter 6 - Pointers
Chapter 6 - Pointers Outline 1 Introduction 2 Pointer Variable Declarations and Initialization 3 Pointer Operators 4 Calling Functions by Reference 5 Using the const Qualifier with Pointers 6 Bubble Sort
CS132 Algorithm. Instructor: Jialiang Lu Office: Information Center 703
CS132 Algorithm Instructor: Jialiang Lu Email: jialiang.lu@sjtu.edu.cn Office: Information Center 703 Chapter 3 STRUCTURES IN C 2 Structures Introduction Collections of related variables (aggregates) under
VisTrails 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
Linked Structures - Review Chapter 13. Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013
Linked Structures - Review Chapter 13 Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013 2 Scope Introduction to Linked Structures: Object references as links Linked vs. array-based structures
FILE HANDLING AND EXCEPTIONS
FILE HANDLING AND EXCEPTIONS INPUT We ve already seen how to use the input function for grabbing input from a user: input() >>> print(input('what is your name? ')) What is your name? Spongebob Spongebob
Review 2. Classes and Subclasses
Review 2 Classes and Subclasses Class Definition class (): """Class specification""" class variables (format: Class.variable) initializer ( init ) special method definitions
Object Oriented Programming #10
Object Oriented Programming #10 Serdar ARITAN Biomechanics Research Group, Faculty of Sports Sciences, and Department of Computer Graphics Hacettepe University, Ankara, Turkey 1 Simple programming tasks
Workshop #11: Custom Movers & Energy Methods
Workshop #11: Custom Movers & Energy Methods You may have noticed that every mover we have introduced in the preceding chapters has shared an apply() method, which takes a pose as its argument. One of
COSC 236 Section 101 Computer Science 1 -- Prof. Michael A. Soderstrand
COSC 236 Section 101 Computer Science 1 -- Prof. Michael A. Soderstrand COSC 236 Web Site You will always find the course material at: http://www.class-notes.us or http://www.class-notes.info or http://www.lecture-notes.tripod.com
Lecture 15: Intro to object oriented programming (OOP); Linked lists
Extended Introduction to Computer Science CS1001.py Lecture 15: Intro to object oriented programming (OOP); Linked lists Instructors: Daniel Deutch, Amir Rubinstein Teaching Assistants: Michal Kleinbort,
Announcements 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
Object 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,
Strings(2) CS 201 String. String Constants. Characters. Strings(1) Initializing and Declaring String. Debzani Deb
CS 201 String Debzani Deb Strings(2) Two interpretations of String Arrays whose elements are characters. Pointer pointing to characters. Strings are always terminated with a NULL characters( \0 ). C needs
MYcsvtu Notes LECTURE 34. POINTERS
LECTURE 34 POINTERS Pointer Variable Declarations and Initialization Pointer variables Contain memory addresses as their values Normal variables contain a specific value (direct reference) Pointers contain
CS108 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
CS558 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 ).
Debugging [continued]
![Debugging [continued]](/thumbs/92/109562294.jpg "Debugging [continued]")
Debugging [continued] Admiral Grace Murray Hopper http://www.history.navy.mil/photos/images/h96000/h96566kc.htm 1 2 Debugging Your Program Debugging: Where we left off Debugging Your Program. [summary]
Programación de Computadores. Cesar Julio Bustacara M. Departamento de Ingeniería de Sistemas Facultad de Ingeniería Pontificia Universidad Javeriana
POINTERS Programación de Computadores Cesar Julio Bustacara M. Departamento de Ingeniería de Sistemas Facultad de Ingeniería Pontificia Universidad Javeriana 2018-01 Pointers A pointer is a reference to
Constraint Systems. Lab 06 - Customizing Search
Constraint Systems Lab 06 - Customizing Search CP Search in Google or-tools Search in or-tools is implemented via two main entities: A DecisionBuilderobject A stack of Decisionobjects The DecisionBuilderobject
Debugging [continued]
![Debugging [continued]](/thumbs/93/114063657.jpg "Debugging [continued]")
1 Debugging [continued] Admiral Grace Murray Hopper http://www.history.navy.mil/photos/images/h96000/h96566kc.htm 2 Debugging Your Program Debugging Your Program. [summary] 1. Edit the program (type in
Object-Oriented Python
Object-Oriented Python Everything is an object. Every object has a value. a type. an identity. a namespace. CS105 Python def initstudent(student, eid): global A class is like a namespace. CS105 Python
15 211: RECITATION7, SECTION M. Hui Han Chin,
15 211: RECITATION7, SECTION M Hui Han Chin, hchin@cmu.edu NOTICE! Homework theory is due tomorrow Lab 3 review Make sure your code compiles. Will provide a dummy test harness. You should try compressing
Object-oriented programming in Python (2)
Programming Languages Week 9 Object-oriented programming in Python (2) College of Information Science and Engineering Ritsumeikan University plan last week: dictionaries vs. objects classes, instances,
Manual_implementation_of_the_Mersenne_twister_PseudoRandom_N
Manual_implementation_of_the_Mersenne_twister_PseudoRandom_N May 4, 2017 1 Table of Contents 1 Manual implementation of the Mersenne twister PseudoRandom Number Generator (PRNG) 1.1 Common API for the
Question 2. [5 points] State a big-o upper bound on the worst case running time of the given
![Question 2. [5 points] State a big-o upper bound on the worst case running time of the given](/thumbs/94/121064441.jpg "Question 2. [5 points] State a big-o upper bound on the worst case running time of the given")
CS 201, Fall 2015 Dec 4th Exam 3 Name: Question 1. [5 points] State a big-o upper bound on the worst case running time of the given method, where the problem size N is the number of elements in the list
Lecture 05 POINTERS 1
Lecture 05 POINTERS 1 Pointers Powerful, but difficult to master Simulate call-by-reference Close relationship with arrays and strings Pointer Variable vs. Normal Variable Normal variables contain a specific