CSc 110, Autumn 2017 Lecture 2: Functions.

Slides:



Advertisements
Similar presentations
Building Java Programs Chapter 1 Lecture 1-2: Static Methods reading:
Advertisements

Building Java Programs Chapter 1 Introduction to Java Programming.
Java Programs + Algorithms
Mr. Wortzman INTRO. TO COMPUTER SCIENCE. UNIT 1 – CUSTOM BLOCKS.
Basic Java programs with println statements. 2 Compile/run a program 1.Write it –code or source code: the set of instructions in a program 2.Compile it.
1 Building Java Programs Introduction to Java Programming Dept. of Computer Science - SSBN Vishnuvardhan.M.
Copyright 2006 by Pearson Education 1 Building Java Programs Chapter 1: Introduction to Java Programming.
1 Procedural decomposition using static methods suggested reading:1.4.
1 Procedural decomposition using static methods. 2 Algorithms Recall: An algorithm is a list of steps for solving a problem. What is the algorithm to.
Copyright 2006 by Pearson Education 1 Building Java Programs Chapter 1: Introduction to Java Programming.
Building Java Programs Chapter 1 Introduction to Java Programming.
Copyright 2010 by Pearson Education Building Java Programs Chapter 1 Lecture 1-2: Static Methods reading:
Copyright 2006 by Pearson Education 1 Building Java Programs Chapter 1: Introduction to Java Programming.
Building Java Programs
Copyright 2008 by Pearson Education Building Java Programs Chapter 1 Lecture 1-2: Static Methods, Avoiding Redundancy reading: self-check:
Copyright 2008 by Pearson Education Building Java Programs Chapter 1: Introduction to Java Programming.
1 Building Java Programs Chapter 1: Introduction to Java Programming These lecture notes are copyright (C) Marty Stepp and Stuart Reges, They may.
Copyright 2008 by Pearson Education Building Java Programs Chapter 1 Lecture 1-2: Static Methods reading:
Topic 3 static Methods and Structured Programming "The cleaner and nicer the program, the faster it's going to run. And if it doesn't, it'll be easy to.
Copyright 2006 by Pearson Education 1 Building Java Programs Chapter 1: Introduction to Java Programming.
Static methods. 2 Algorithms algorithm: a list of steps for solving a problem Example algorithm: "Bake sugar cookies" –Mix the dry ingredients. –Cream.
BUILDING JAVA PROGRAMS CHAPTER 1 INTRODUCTION TO JAVA PROGRAMMING.
Building Java Programs Chapter 1 Introduction to Java Programming Copyright (c) Pearson All rights reserved.
CS 112 Introduction to Programming Lecture 3: Java Methods Yang (Richard) Yang Computer Science Department Yale University 308A Watson, Phone:
1 CSE 142 Lecture Notes Introduction These lecture notes are copyright (C) Marty Stepp May not be rehosted, copied, sold, or modified without Marty.
Copyright 2010 by Pearson Education Building Java Programs Chapter 1 Lecture 1-2: Static Methods reading:
Warm Up As you enter get out a half sheet of loose paper. Write the HelloWorld program on it. Be prepared to correct your code.
Building Java Programs Chapter 1 Introduction to Java Programming Copyright (c) Pearson All rights reserved.
Building Java Programs Chapter 1 Introduction to Java Programming.
Drawing complex figures with static methods. 2 Static methods question Write a program to print these figures using methods ______ / \ \ / \______/ \
1 WELCOME TO CSE 142! host: benson limketkai University of Washington, Summer 2007.
Building Java Programs Chapter 1 Introduction to Java Programming Copyright (c) Pearson All rights reserved.
CS 112 Introduction to Programming Lecture 3: Java Methods Yang (Richard) Yang Computer Science Department Yale University 308A Watson, Phone:
1 WELCOME TO CSE 142! host: benson limketkai University of Washington, Spring 2008.
Building Java Programs Chapter 1 Introduction to Java Programming Copyright (c) Pearson All rights reserved.
CSc 110, Autumn 2016 Lecture 2: Functions. Review What is the output of the following print statements? print("this class\tis' the \"best\"") Write a.
CSc 127a/110, Autumn 2016 Lecture 1: Introduction; Basic Python Programs.
Lecture 1: Basic Java Syntax
Building Java Programs
Static Methods and Method Calls
Adapted from slides by Marty Stepp and Stuart Reges
Lecture 1: Introduction; Basic Python Programs
Lecture 2: Static Methods Expressions reading: 1.4 – 2.1
CSc 110, Autumn 2017 Lecture 3: Functions.
Building Java Programs
CSE 190D, Winter 2013 Building Java Programs Chapter 1
AP Computer Science Mr. Wortzman.
Adapted from slides by Marty Stepp and Stuart Reges
Topic 3 static Methods and Structured Programming
Lecture 1: Basic Java Syntax
Building Java Programs
CSc 110, Spring 2018 Lecture 3: Functions.
Building Static Methods
Building Java Programs
CSc 110, Spring 2018 Lecture 2: Functions.
Lecture 2: Static Methods Expressions reading: 1.4 – 2.1
Building Java Programs
Building Java Programs
Building Java Programs
Building Java Programs
Building Java Programs Chapter 1
Building Java Programs
Chapter 1 Lecture 1-2: Static Methods reading:
Lecture 1: Introduction; Basic Python Programs
Building Java Programs
Building Java Programs
Building Java Programs
host: benson limketkai University of Washington, Spring 2007
Building Java Programs
Consult America Technology Consulting Services
Presentation transcript:

CSc 110, Autumn 2017 Lecture 2: Functions

Escape sequences escape sequence: A special sequence of characters used to represent certain special characters in a string. \t tab character \n new line character \" quotation mark character \' quotation mark character \\ backslash character Example: print("\\hello\nhow\tare \"you\"?\\\\") Output: \hello how are "you"?\\

Questions What is the output of the following print statements? print("\ta\tb\tc") print("\\\\") print("'") print("\"\"\"") print("C:\nin\the downward spiral") Write a print statement to produce this output: / \ // \\ /// \\\

Answers Output of each print statement: a b c \\ ' """ C: in he downward spiral print statement to produce the line of output: print("/ \\ // \\\\ /// \\\\\\")

Creating a Python Program File

Creating a Python Program File When Run -> Run Module is selected:

5/1/2018 Comments comment: A note written in source code by the programmer to describe or clarify the code. Comments are not executed when your program runs. Syntax: # comment text Examples: # This is a one-line comment. # This is a very long # multi-line comment.

Comments example # Suzy Student, # CSc 110, Fall 2019 5/1/2018 Comments example # Suzy Student, # CSc 110, Fall 2019 # Displays lyrics # first line print("When I first got into magic") print("it was an underground phenomenon") print() # second line print("Now everybody's like") print("pick a card, any card")

functions

Algorithms algorithm: A list of steps for solving a problem. 5/1/2018 Algorithms algorithm: A list of steps for solving a problem. Example algorithm: "Bake sugar cookies" Mix the dry ingredients. Cream the butter and sugar. Beat in the eggs. Stir in the dry ingredients. Set the oven temperature. Set the timer for 10 minutes. Place the cookies into the oven. Allow the cookies to bake. Spread frosting and sprinkles onto the cookies. ...

Problems with algorithms lack of structure: Many steps; tough to follow. redundancy: Consider making a double batch... Mix the dry ingredients. Cream the butter and sugar. Beat in the eggs. Stir in the dry ingredients. Set the oven temperature. Set the timer for 10 minutes. Place the first batch of cookies into the oven. Allow the cookies to bake. Place the second batch of cookies into the oven. Mix ingredients for frosting. ...

Structured algorithms 5/1/2018 Structured algorithms structured algorithm: Split into coherent tasks. 1 Make the batter. Mix the dry ingredients. Cream the butter and sugar. Beat in the eggs. Stir in the dry ingredients. 2 Bake the cookies. Set the oven temperature. Set the timer for 10 minutes. Place the cookies into the oven. Allow the cookies to bake. 3 Decorate the cookies. Mix the ingredients for the frosting. Spread frosting and sprinkles onto the cookies. ...

Removing redundancy A well-structured algorithm can describe repeated tasks with less redundancy. 1 Make the cookie batter. Mix the dry ingredients. ... 2a Bake the cookies (first batch). Set the oven temperature. Set the timer for 10 minutes. 2b Bake the cookies (second batch). Repeat Step 2a 3 Decorate the cookies.

functions function: A named group of statements. 5/1/2018 functions function: A named group of statements. denotes the structure of a program eliminates redundancy by code reuse procedural decomposition: dividing a problem into functions Writing a function is like adding a new command to Python. Function A statement Function B Function C

Gives your function a name so it can be executed 5/1/2018 Declaring a function Gives your function a name so it can be executed Syntax: def name(): statement statement ... statement Example: def print_warning(): print("This product causes cancer") print("in lab rats and humans.")

Executes the function’s code 5/1/2018 Calling a function Executes the function’s code Syntax: name() You can call the same function many times if you like. Example: print_warning() #separate multiple words with underscores Output: This product causes cancer in lab rats and humans.

Using functions 1. Design (think about) the algorithm. Look at the structure, and which commands are repeated. Decide what are the important overall tasks. 2. Declare (write down) the functions. Arrange statements into groups and give each group a name. 3. Call (run) the function.

Program with functions rap() # Calling (running) the rap function print() rap() # Calling the rap function again # This function prints the lyrics to my favorite song. def rap(): print("Now this is the story all about how") print("My life got flipped turned upside-down") Output: Now this is the story all about how My life got flipped turned upside-down

Functions calling functions 5/1/2018 Functions calling functions def message1(): print("This is message1.") def message2(): print("This is message2.") message1() print("Done with message2.") message2() print("Done with everything.") Output: This is message1. This is message2. Done with message2. Done with main.

Control flow When a function is called, the program's execution... 5/1/2018 Control flow When a function is called, the program's execution... "jumps" into that function, executing its statements, then "jumps" back to the point where the function was called. message1() message2() print("Done with main.") ... def message1(): print("This is message1.") def message2(): print("This is message2.") message1() print("Done with message2.") def message1(): print("This is message1.")

Structure of a program No code should be placed outside a function. Instead use a main function. The one exception is a call to your main function def main(): message1() message2() print("Done with everything.") def message1(): print("This is message1.") def message2(): print("This is message2.") print("Done with message2.") main()

When to use functions (besides main) Place statements into a function if: The statements are related structurally, and/or The statements are repeated. You should not create functions for: An individual print statement. Only blank lines. Unrelated or weakly related statements. (Consider splitting them into two smaller functions.)

Drawing complex figures with functions

Functions question Write a program to print these figures using functions. ______ / \ / \ \ / \______/ +--------+ | STOP |

Development strategy First version (unstructured): ______ / \ / \ \ / \______/ +--------+ | STOP | First version (unstructured): Create an empty program. Copy the expected output into it, surrounding each line with print syntax. Run it to verify the output.

Program version 1 def main(): print(" ______") print(" / \\") print("| STOP |") main()

Development strategy 2 Second version (structured, with redundancy): ______ / \ / \ \ / \______/ +--------+ | STOP | Second version (structured, with redundancy): Identify the structure of the output. Divide the code into functions based on this structure.

Output structure The structure of the output: initial "egg" figure ______ / \ / \ \ / \______/ +--------+ | STOP | The structure of the output: initial "egg" figure second "teacup" figure third "stop sign" figure fourth "hat" figure This structure can be represented by functions: egg tea_cup stop_sign hat

Program version 2 def stop_sign(): print(" ______") print(" / \\") def main(): egg() tea_cup() stop_sign() hat() def egg(): print(" ______") print(" / \\") print("/ \\") print("\\ /") print(" \\______/") print() def tea_cup(): print("+--------+") def stop_sign(): print(" ______") print(" / \\") print("/ \\") print("| STOP |") print("\\ /") print(" \\______/") print() def hat(): print("+--------+")

Development strategy 3 Third version (structured, without redundancy): ______ / \ / \ \ / \______/ +--------+ | STOP | Third version (structured, without redundancy): Identify redundancy in the output, and create functions to eliminate as much as possible. Add comments to the program.

Output redundancy The redundancy in the output: ______ / \ / \ \ / \______/ +--------+ / | STOP | The redundancy in the output: egg top: reused on stop sign, hat egg bottom: reused on teacup, stop sign divider line: used on teacup, hat This redundancy can be fixed by functions: egg_top egg_bottom line

Program version 3 # Draws a teacup figure. def tea_cup(): egg_bottom() line() print() # Draws a stop sign figure. def stop_sign(): eggTop() print("| STOP |") # Draws a figure that looks sort of like a hat. def hat(): egg_top() # Draws a line of dashes. def line(): print("+--------+") # Suzy Student, CSc 110, Spring 2094 # Prints several figures, with methods for structure and redundancy. def main(): egg() tea_cup() stop_sign() hat() # Draws the top half of an an egg figure. def egg_top(): print(" ______") print(" / \\") print("/ \\") # Draws the bottom half of an egg figure. def egg_bottom(): print("\\ /") print(" \\______/") # Draws a complete egg figure. def egg(): egg_top() egg_bottom() print()