Lecture 13: Jul 5, Functions. Background Asserting Input Debugging Errors. James Balamuta STAT UIUC

Size: px
Start display at page:

Download "Lecture 13: Jul 5, Functions. Background Asserting Input Debugging Errors. James Balamuta STAT UIUC"

Transcription

1 Lecture 13: Jul 5, 2018 Functions Background Asserting Input Debugging Errors James Balamuta STAT UIUC

2 Announcements hw04 will be due Tuesday, July 10th, 2018 Project Proposal is due on Friday, July 13th, 11:59 PM Overview of the Proposal stage Visit OHs in IH 104 for help drafting or reviewing a proposal Quiz 04 covers Week 3 CBTF. Window: Jul 6th Sign up: Demo of CBTF Environment: v=6oapvo4tifk&t=8s

3 Today's Lecture Objectives Describe a function Understand why functions are useful Differentiate between input parameter types Explain the "fail fast" principle of function design Apply the different modes of debugging code

4 Background

5 Definition: Functions are a piece of code that performs a specified task that may or may not depend on parameters and it may or may not return one or more values. Source

6 Previously Addition Function adding values together Function Name Actual name of the function that can be called e.g. add(1, 2) Parameters Variables that receive expressions that can be used in the function s body add = function(a, b) { Body Statements in between {} that are run when the function is called } summed = a + b return(summed) Return Value Result made available from running the body statements

7 Motivation repeated use of a definition Consider: message("hello World!") Translates to: Say "Hello World!" in the console

8 What if we wanted to repeat the phrase elsewhere?

9 Options related to recreating a piece of code 1. Retype 2. Copy and paste 3. Writing a function say_hello_world = function() { } message("hello World!") say_hello_world() # Hello World!

10 Functions are Powerful expressive pieces of code 1. The logic flow is chunked instead of a series of long statements 2. Decrease the probability of an error by applying a common definition 3. Easier to share code with people that you collaborate with.

11 Clarity of Routine Naming Matters Redux What's happening here? set.seed(1115) sample(6, size = 1) # [1] 3 sample(6, size = 1) # [1] 5 sample(6, size = 1) # [1] 5

12 Die Roll! Adding Documentation via Code # Perform a single dice roll roll_die = function(num_sides) { sample(num_sides, size = 1) } # Set seed for reproducibility set.seed(1115) roll_die(6) # [1] 3 Source

13 Default Parameters Function Name Actual name of the function that can be called e.g. roll_die() being proactive roll_die = function(num_sides = 6) { Body Statements in between {} that are run when the function is called } Parameters Variables that receive a specific data type that can be used in the function s body Default Values The initial values used if the parameters are not supplied on function call roll = sample(num_sides, size = 1) return(roll) Return Value Result made available from running the body statements set.seed(1115) roll_die() # [1] 3 set.seed(1115) roll_die(25) # [1] 11 # Anticipate need of user # Allow function to still be dynamic

14 Function Name Actual name of the function that can be called e.g. roll_n_die(2, 10) Generalizing enabling multiple rolls roll_n_die = function(num_rolls, num_sides = 6) { Body Statements in between {} that are run when the function is called } Positional Parameter Variables that must be specified on function call in the order that they appear. Default Parameter Variables that will use prespecified values if not supplied on function call Default Values The initial values used if the parameters are not supplied on function call rolls = sample(num_sides, size = num_rolls, replace = TRUE) return(rolls) Return Value Result made available from running the body statements set.seed(1115) roll_n_die(3, 10) # [1] # Roll the die three times

15 Your Turn Clean up the following code by implementing a function that: 1. Generates data from a normal distribution 2. Applies the mean normalization set.seed(325) x = rnorm(10) y = rnorm(10) x = x_nmu = (x - mean(x)) / (max(x) - min(x)) y_nmu = (y - mean(y)) / (max(y) - min(y)) max x x x ( ) min( x)

16 Asserting Input

17 Logit Function Transforming probabilities to log scale # Define logit function logit = function(p) { log(p / (1 - p)) } logit(.5) # [1] 0 logit(.75) # [1] What is going wrong with 1.5, -.5, and "a"? # The beginning of the end logit(1.5) # [1] NaN logit(-.5) # [1] NaN logit("a") # [1] Error in 1 - p : non-numeric argument to binary operator

18 Types of Input what path to walk on??? Developer Envisioned Path User Preferred Path

19 User Input does it work with xyz??? User Path 2.0

20 Image Source Programming today is a race between software engineers striving to build bigger and better idiot-proof programs, and the universe trying to build bigger and better idiots. So far, the universe is winning. Rick Cook

21 Definition Defensive Programming means creating a situation where the code guards against flaws that might occur when a user acts with a program. # No data x = numeric(0) summed = 0 # Unprotected Loop for(index in 1:length(x)) { summed = summed + x[index] } # Protected loop for(index in seq_along(x)) { summed = summed + x[index] }

22 Fail Fast control the user path Bad User Input Error occurs Bad User Input Statement 1 Statement 1 Specific Error Continuing error Statement 2 Terminal error Statement 3 Generic Error

23 Protecting Input fixing the algorithm logit_safe = function(p) { if(!is.numeric(p)) { stop("`p` must be numeric") } else if (any(p >= 1)) { stop("all `p` values must be less than 1") } else if (any(p <= 0)) { stop("all `p` values must be greater than 0") } log(p/(1 - p)) } * Recall that is.*() functions can be used to verify input types and any() reduces a vector of logical values to just one to work with an if(), which is nonvectorized.

24 Levels of Messaging signal conditions to terminate routine ## Output (STDOUT) cat("working on `x` data set.") # "Working on `x` data set." print("working on `x` data set.") # [1] "Working on `x` data set." ## Diagnostic (STDERR) message("working on `x` data set.") # "Working on `x` data set." # Show contents # Show Vector "as-is" # Status update warning("`x` contains multiple columns only using one.") # Recover code run # "Warning Message: `x` contains multiple columns only using one." stop("`x` must be numeric") # "Error: `x` must be numeric" # End code run

25 Your Turn 1. Identify what is wrong with the following function 2. Propose a fix for it z_score = function(x, mu, std) { } (x - mu) / std

26 Debugging Errors

27 my_function() # Error in my_function() : could not find function "my_function" message "in a bottle" # Error: unexpected string constant in "message "in a bottle"" 3 + "toad" # Error in 3 + "toad" : non-numeric argument to binary operator

28 Errors Happen code will error in predictable ways Syntax Errors relate to ill-formatted commands x # Missing assignment operator y = (4 + 6 # Missing closing parentheses Semantic Errors involve improper use of R commands b = a * c(4, 5) # Use of undefined variable `a` 3 + "toad" # Not supported use of addition Logical Errors lead to unexpected results or bugs add = function(a, b) { a - b } # Not adding but subtracting values! while(true) { x = x + 1} # Never-ending loops

29 What's a Bug? a logical error or flaw associated with program execution * The term bug was popularized by Rear Admiral Grace M. Hopper in 1947, who recounted the tale of the moth being in the Harvard Mark II. Source: Origins of 'bug'

30 Bugs, Bugs, Everywhere at some point errors appear within code 1. This is natural as humans are prone to err. Computers, not so much. 2. It's both a painful and time intensive process to locate and patch bugs. 3. The best offense to lowering bug counts comes from writing clear, concise, and documented code. XKCD: 1403

31 Finding your bug is a process of confirming the many things you believe are true, until you find one which is not true. Norm Matloff in Guide to Faster, Less Frustrating Debugging

32 Steps to Isolate and Fix Bugs 1. Create a reproducible example that captures the bug. Use reprex to generate the issue. 2. Determine the severity of the bug. Show stopping, livable, harmless 3. Try to locate the bug in the code. Breakpoints, tracebacks, and more! 4. Write a patch to prevent this bug from reoccurring. Unit tests and coverage checks with continuous integration

33 Nested Function Error running into an error f = function(x) { g(x + 2) } g = function(x) { h(x - 2) } h = function(x) { val = log(x) if(val < 0) { return(val^2) } val } f(-4) # Error in if (val < 0) { : missing value where TRUE/FALSE needed # In addition: Warning message: # In log(x) :

34 Traceback following the bread crumbs back f(-4) # Error in if (val < 0) { : missing value where TRUE/FALSE needed # In addition: Warning message: # In log(x) : # Where's the error? traceback() # 3: h(x) at #2 # 2: g(x) at #2 # 1: f(-4)

35 Examining the State ways to figure out what is happening 1. Print out the contents of variables. 2. Enter into an interactive "debug" mode Set debug(func) and then call func(). Remove debug with undebug(func) to return function to normal. 3. Insert a browser() statement at fixed points in the function. 4. Use breakpoints.

36 Print Statements manually looking at output f = function(x) { message(x) g(x + 2) } g = function(x) { message(x) h(x - 2) } h = function(x) { message(x) val = log(x) message(val) if(val < 0) { return(val^2) } val } # Call function again f(-4) # -4 # -2 # -4 # NaN

37 Interactive Debug Mode surfin' through code without modify it debug(f). # Enter debug mode f(-4) # Call function, escape browser with Q undebug(f) # Remove debug from function Command Shortcut Description n or Enter F10 Execute next statement s Shift+F4 Step into function f Shift+F6 Finish function/loop c Shift+F5 Continue running Q Shift+F8 Stop debugging

38 Breakpoints require the use of an R Scripts instead of RMarkdown

39 Previously Create an R Script keeping a record of your R commands Click the White Plus in top-left Select R Script Opens a new R Script in the top-left Script Editor [Cmd / Cntrl + Shift + N]

40 Breakpoints stopping code in its tracks

41 Breakpoints matrix-style stopping of code Image Source

42 Recap Background Functions allow for dynamic input and output Provide a way to standardize and share code Asserting Input Users will supply odd data Catch their errors as quickly as possible Debugging Errors Types of Programming Errors Use breakpoints, tracebacks, and more!

43 Acknowledgements Bob Rudis' minimalist gestalt C++ function diagram

44 This work is licensed under the Creative Commons Attribution-NonCommercial- ShareAlike 4.0 International License

Lecture 06: Feb 04, Transforming Data. Functions Classes and Objects Vectorization Subsets. James Balamuta STAT UIUC

Lecture 06: Feb 04, Transforming Data. Functions Classes and Objects Vectorization Subsets. James Balamuta STAT UIUC Lecture 06: Feb 04, 2019 Transforming Data Functions Classes and Objects Vectorization Subsets James Balamuta STAT 385 @ UIUC Announcements hw02 is will be released Tonight Due on Wednesday, Feb 13th,

More information

Lecture 11: Sept 26, Loop-the-Loops. Iteration while, for, and repeat. James Balamuta STAT UIUC

Lecture 11: Sept 26, Loop-the-Loops. Iteration while, for, and repeat. James Balamuta STAT UIUC Lecture 11: Sept 26, 2018 Loop-the-Loops Iteration while, for, and repeat James Balamuta STAT 385 @ UIUC Announcements hw04 is due Friday, Sep 21th, 2018 at 6:00 PM Quiz 05 covers Week 4 contents @ CBTF.

More information

Lecture 27: Nov 26, S3 Programming. OOP S3 Objects Unpaired (Two Sample) t-test. James Balamuta STAT UIUC

Lecture 27: Nov 26, S3 Programming. OOP S3 Objects Unpaired (Two Sample) t-test. James Balamuta STAT UIUC Lecture 27: Nov 26, 2018 S3 Programming OOP S3 Objects Unpaired (Two Sample) t-test James Balamuta STAT 385 @ UIUC Announcements Group Project Final Report, Demo Video, and Peer Evaluation due Tuesday,

More information

Lecture 09: Feb 13, Data Oddities. Lists Coercion Special Values Missingness and NULL. James Balamuta STAT UIUC

Lecture 09: Feb 13, Data Oddities. Lists Coercion Special Values Missingness and NULL. James Balamuta STAT UIUC Lecture 09: Feb 13, 2019 Data Oddities Lists Coercion Special Values Missingness and NULL James Balamuta STAT 385 @ UIUC Announcements hw03 slated to be released on Thursday, Feb 14th, 2019 Due on Wednesday,

More information

Debugging R Code. Biostatistics

Debugging R Code. Biostatistics Debugging R Code Biostatistics 140.776 Something s Wrong! Indications that something s not right message: A generic notification/diagnostic message produced by the message function; execution of the function

More information

Lecture 21: Oct 26, Web APIs. HTTP(S) Requests Web + APIs httr with REST JSON Resources. James Balamuta STAT UIUC

Lecture 21: Oct 26, Web APIs. HTTP(S) Requests Web + APIs httr with REST JSON Resources. James Balamuta STAT UIUC Lecture 21: Oct 26, 2018 Web APIs HTTP(S) Requests Web + APIs httr with REST JSON Resources James Balamuta STAT 385 @ UIUC Announcements hw07 is due Friday, Nov 2nd, 2018 at 6:00 PM Group project member

More information

Lecture 9: July 14, How to Think About Debugging

Lecture 9: July 14, How to Think About Debugging Lecture 9: July 14, 2011 How to Think About Debugging So, you wrote your program. And, guess what? It doesn t work. L Your program has a bug in it Somehow, you must track down the bug and fix it Need to

More information

Software Design and Analysis for Engineers

Software Design and Analysis for Engineers Software Design and Analysis for Engineers by Dr. Lesley Shannon Email: lshannon@ensc.sfu.ca Course Website: http://www.ensc.sfu.ca/~lshannon/courses/ensc251 Simon Fraser University Slide Set: 9 Date:

More information

CS1110 Lab 6 (Mar 17-18, 2015)

CS1110 Lab 6 (Mar 17-18, 2015) CS1110 Lab 6 (Mar 17-18, 2015) First Name: Last Name: NetID: The lab assignments are very important and you must have a CS 1110 course consultant tell CMS that you did the work. (Correctness does not matter.)

More information

CS 1110, LAB 3: MODULES AND TESTING First Name: Last Name: NetID:

CS 1110, LAB 3: MODULES AND TESTING   First Name: Last Name: NetID: CS 1110, LAB 3: MODULES AND TESTING http://www.cs.cornell.edu/courses/cs11102013fa/labs/lab03.pdf First Name: Last Name: NetID: The purpose of this lab is to help you better understand functions, and to

More information

Regular Expressions. James Balamuta STAT UIUC. Lecture 25: Nov 9, 2018

Regular Expressions. James Balamuta STAT UIUC. Lecture 25: Nov 9, 2018 Lecture 25: Nov 9, 2018 Regular Expressions Regular Expressions Using Regex Literal Characters, Metacharacters, Character Classes, Quantifiers, Groups, Backreferences, Anchors Resources James Balamuta

More information

Announcements. Lab Friday, 1-2:30 and 3-4:30 in Boot your laptop and start Forte, if you brought your laptop

Announcements. Lab Friday, 1-2:30 and 3-4:30 in Boot your laptop and start Forte, if you brought your laptop Announcements Lab Friday, 1-2:30 and 3-4:30 in 26-152 Boot your laptop and start Forte, if you brought your laptop Create an empty file called Lecture4 and create an empty main() method in a class: 1.00

More information

CMSC201 Computer Science I for Majors

CMSC201 Computer Science I for Majors CMSC201 Computer Science I for Majors Lecture 05 Algorithmic Thinking Last Class We Covered Decision structures One-way (using if) Two-way (using if and else) Multi-way (using if, elif, and else) Nested

More information

Reliable programming

Reliable programming Reliable programming How to write programs that work Think about reliability during design and implementation Test systematically When things break, fix them correctly Make sure everything stays fixed

More information

Selection the If Statement Try Catch and Validation

Selection the If Statement Try Catch and Validation Selection the If Statement Try Catch and Validation The main statement used in C# for making decisions depending on different conditions is called the If statement. A second useful structure in a similar

More information

Secure Programming Lecture 13: Static Analysis

Secure Programming Lecture 13: Static Analysis Secure Programming Lecture 13: Static Analysis David Aspinall 10th March 2014 Outline Overview Vulnerabilities and analysis Using static analysis Simple static analysis tasks Type checking Style checking

More information

Numerical Methods in Scientific Computation

Numerical Methods in Scientific Computation Numerical Methods in Scientific Computation Programming and Software Introduction to error analysis 1 Packages vs. Programming Packages MATLAB Excel Mathematica Maple Packages do the work for you Most

More information

Programming Assignment IV Due Monday, November 8 (with an automatic extension until Friday, November 12, noon)

Programming Assignment IV Due Monday, November 8 (with an automatic extension until Friday, November 12, noon) Programming Assignment IV Due Monday, November 8 (with an automatic extension until Friday, November 12, noon) Thus spake the master programmer: A well-written program is its own heaven; a poorly written

More information

COMP390 (Design &) Implementation

COMP390 (Design &) Implementation COMP390 (Design &) Implementation A rough guide Consisting of some ideas to assist the development of large and small projects in Computer Science (With thanks to Dave Shield) Design & Implementation What

More information

Designing 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 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 information

Computer Components. Software{ User Programs. Operating System. Hardware

Computer Components. Software{ User Programs. Operating System. Hardware Computer Components Software{ User Programs Operating System Hardware What are Programs? Programs provide instructions for computers Similar to giving directions to a person who is trying to get from point

More information

Best Practices in Programming

Best Practices in Programming Best Practices in Programming from B. Kernighan & R. Pike, The Practice of Programming Giovanni Agosta Piattaforme Software per la Rete Modulo 2 Outline 1 2 Macros and Comments 3 Algorithms and Data Structures

More information

CS 113: Introduction to

CS 113: Introduction to CS 113: Introduction to Course information MWF 12:20-1:10pm 1/21-2/15, 306 Hollister Hall Add/drop deadline: 1/28 C Instructor: David Crandall See website for office hours and contact information Prerequisites

More information

Computer Vision I. Announcement. Corners. Edges. Numerical Derivatives f(x) Edge and Corner Detection. CSE252A Lecture 11

Computer Vision I. Announcement. Corners. Edges. Numerical Derivatives f(x) Edge and Corner Detection. CSE252A Lecture 11 Announcement Edge and Corner Detection Slides are posted HW due Friday CSE5A Lecture 11 Edges Corners Edge is Where Change Occurs: 1-D Change is measured by derivative in 1D Numerical Derivatives f(x)

More information

Using the Command Line

Using the Command Line 1 Unit 15 Debugging COMPILATION 2 3 Using the Command Line While it has a GUI interface like your Mac or Windows PC much of its power lies in its rich set of utilities that are most easily run at the command

More information

CSE 374 Programming Concepts & Tools

CSE 374 Programming Concepts & Tools CSE 374 Programming Concepts & Tools Hal Perkins Fall 2017 Lecture 11 gdb and Debugging 1 Administrivia HW4 out now, due next Thursday, Oct. 26, 11 pm: C code and libraries. Some tools: gdb (debugger)

More information

Vulnerabilities and analysis. Simple static analysis tasks Type checking Style checking

Vulnerabilities and analysis. Simple static analysis tasks Type checking Style checking Outline Recap Secure Programming Lecture 13: Static Analysis David Aspinall 10th March 2014 Overview Vulnerabilities and analysis Using static analysis Simple static analysis tasks Type checking Style

More information

5/19/2015. Objectives. JavaScript, Sixth Edition. Understanding Syntax Errors. Introduction to Debugging. Handling Run-Time Errors

5/19/2015. Objectives. JavaScript, Sixth Edition. Understanding Syntax Errors. Introduction to Debugging. Handling Run-Time Errors Objectives JavaScript, Sixth Edition Chapter 4 Debugging and Error Handling When you complete this chapter, you will be able to: Recognize error types Trace errors with dialog boxes and the console Use

More information

Frontend II: Javascript and DOM Programming. Wednesday, January 7, 15

Frontend II: Javascript and DOM Programming. Wednesday, January 7, 15 6.148 Frontend II: Javascript and DOM Programming Let s talk about Javascript :) Why Javascript? Designed in ten days in December 1995! How are they similar? Javascript is to Java as hamster is to ham

More information

Pairs and Lists. (cons 1 2) 1 2. (cons 2 nil) 2 nil. Not a well-formed list! 1 > (cdr x) 2 > (cons 1 (cons 2 (cons 3 (cons 4 nil)))) ( ) (Demo)

Pairs and Lists. (cons 1 2) 1 2. (cons 2 nil) 2 nil. Not a well-formed list! 1 > (cdr x) 2 > (cons 1 (cons 2 (cons 3 (cons 4 nil)))) ( ) (Demo) 61A Lecture 25 Announcements Pairs Review Pairs and Lists In the late 1950s, computer scientists used confusing names cons: Two-argument procedure that creates a pair car: Procedure that returns the first

More information

CS2141 Software Development using C/C++ Debugging

CS2141 Software Development using C/C++ Debugging CS2141 Software Development using C/C++ Debugging Debugging Tips Examine the most recent change Error likely in, or exposed by, code most recently added Developing code incrementally and testing along

More information

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.095: Introduction to Computer Science and Programming Quiz I In order to receive credit you must answer

More information

Programming Assignment IV

Programming Assignment IV Programming Assignment IV 1 Introduction In this assignment, you will implement the static semantics of Cool. You will use the abstract syntax trees (AST) built by the parser to check that a program conforms

More information

The Perl Debugger. Avoiding Bugs with Warnings and Strict. Daniel Allen. Abstract

The Perl Debugger. Avoiding Bugs with Warnings and Strict. Daniel Allen. Abstract 1 of 8 6/18/2006 7:36 PM The Perl Debugger Daniel Allen Abstract Sticking in extra print statements is one way to debug your Perl code, but a full-featured debugger can give you more information. Debugging

More information

Fundamentals of Programming (Python) Getting Started with Programming

Fundamentals of Programming (Python) Getting Started with Programming Fundamentals of Programming (Python) Getting Started with Programming Ali Taheri Sharif University of Technology Some slides have been adapted from Python Programming: An Introduction to Computer Science

More information

Unit 13. Linux Operating System Debugging Programs

Unit 13. Linux Operating System Debugging Programs 1 Unit 13 Linux Operating System Debugging Programs COMPILATION 2 3 Editors "Real" developers use editors designed for writing code No word processors!! You need a text editor to write your code Eclipse,

More information

npm run pull npm start

npm run pull npm start 1. Open Visual Studio Code 2. At the top click on View->Integrated Terminal (if not already open) 3. In the terminal, first run: npm run pull 4. After this finishes run: npm start For Loops Lecture 14

More information

Comp 151. Control structures.

Comp 151. Control structures. Comp 151 Control structures. admin quiz this week believe it or not only 2 weeks from exam. one a week each week after that. idle debugger Debugger: program that will let you look at the program as it

More information

A Balanced Introduction to Computer Science, 3/E David Reed, Creighton University 2011 Pearson Prentice Hall ISBN

A Balanced Introduction to Computer Science, 3/E David Reed, Creighton University 2011 Pearson Prentice Hall ISBN A Balanced Introduction to Computer Science, 3/E David Reed, Creighton University 2011 Pearson Prentice Hall ISBN 978-0-13-216675-1 Chapter 5 JavaScript and User Interaction 1 Text Boxes HTML event handlers

More information

Unit Testing as Hypothesis Testing

Unit Testing as Hypothesis Testing Unit Testing as Hypothesis Testing Jonathan Clark September 19, 2012 You should test your code. Why? To find bugs. Even for seasoned programmers, bugs are an inevitable reality. Today, we ll take an unconventional

More information

Secure Programming Lecture 13: Code Review and Static Analysis

Secure Programming Lecture 13: Code Review and Static Analysis Secure Programming Lecture 13: Code Review and Static Analysis David Aspinall 4th March 2016 Outline Overview Vulnerabilities and analysis Using static analysis Simple static analysis tasks Type checking

More information

Statistical Programming with R

Statistical Programming with R Statistical Programming with R Lecture 5: Simple Programming Bisher M. Iqelan biqelan@iugaza.edu.ps Department of Mathematics, Faculty of Science, The Islamic University of Gaza 2017-2018, Semester 1 Functions

More information

Name: Class: Date: 2. Today, a bug refers to any sort of problem in the design and operation of a program.

Name: Class: Date: 2. Today, a bug refers to any sort of problem in the design and operation of a program. Name: Class: Date: Chapter 6 Test Bank True/False Indicate whether the statement is true or false. 1. You might be able to write statements using the correct syntax, but be unable to construct an entire,

More information

6.170 Laboratory in Software Engineering Java Style Guide. Overview. Descriptive names. Consistent indentation and spacing. Page 1 of 5.

6.170 Laboratory in Software Engineering Java Style Guide. Overview. Descriptive names. Consistent indentation and spacing. Page 1 of 5. Page 1 of 5 6.170 Laboratory in Software Engineering Java Style Guide Contents: Overview Descriptive names Consistent indentation and spacing Informative comments Commenting code TODO comments 6.170 Javadocs

More information

Information Science 1

Information Science 1 Information Science 1 Simple Calcula,ons Week 09 College of Information Science and Engineering Ritsumeikan University Topics covered l Terms and concepts from Week 8 l Simple calculations Documenting

More information

15-110: Principles of Computing, Spring 2018

15-110: Principles of Computing, Spring 2018 5-: Principles of Computing, Spring 28 Problem Set 8 (PS8) Due: Friday, March 3 by 2:3PM via Gradescope Hand-in HANDIN INSTRUCTIONS Download a copy of this PDF file. You have two ways to fill in your answers:.

More information

CMSC 330: Organization of Programming Languages. OCaml Expressions and Functions

CMSC 330: Organization of Programming Languages. OCaml Expressions and Functions CMSC 330: Organization of Programming Languages OCaml Expressions and Functions CMSC330 Spring 2018 1 Lecture Presentation Style Our focus: semantics and idioms for OCaml Semantics is what the language

More information

COMMOM OBJECT ORIENTED LISP SYSTEMS

COMMOM OBJECT ORIENTED LISP SYSTEMS COMMOM OBJECT ORIENTED LISP SYSTEMS HISTORY: The following information is derived from the history section of dpans Common Lisp. Lisp is a family of languages with a long history. Early key ideas in Lisp

More information

CSE 20. Lecture 4: Number System and Boolean Function. CSE 20: Lecture2

CSE 20. Lecture 4: Number System and Boolean Function. CSE 20: Lecture2 CSE 20 Lecture 4: Number System and Boolean Function Next Weeks Next week we will do Unit:NT, Section 1. There will be an assignment set posted today. It is just for practice. Boolean Functions and Number

More information

Should you know scanf and printf?

Should you know scanf and printf? C-LANGUAGE INPUT & OUTPUT C-Language Output with printf Input with scanf and gets_s and Defensive Programming Copyright 2016 Dan McElroy Should you know scanf and printf? scanf is only useful in the C-language,

More information

COMP322 - Introduction to C++ Lecture 01 - Introduction

COMP322 - Introduction to C++ Lecture 01 - Introduction COMP322 - Introduction to C++ Lecture 01 - Introduction Robert D. Vincent School of Computer Science 6 January 2010 What this course is Crash course in C++ Only 14 lectures Single-credit course What this

More information

MATLAB provides several built-in statements that allow for conditional behavior if/elseif/else switch menu

MATLAB provides several built-in statements that allow for conditional behavior if/elseif/else switch menu Chapter 3 What we have done so far: Scripts/Functions have executed all commands in order, not matter what What we often need: A piece of code that executes a series of commands, if and only if some condition

More information

Notes 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: 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 information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques () Lecture 5 January 22, 2018 Datatypes and Trees Announcements Homework 1 due tomorrow at 11:59pm! Homework 2 available soon due Tuesday, January 30 th Read Chapters

More information

Unit 7: Algorithms and Python CS 101, Fall 2018

Unit 7: Algorithms and Python CS 101, Fall 2018 Unit 7: Algorithms and Python CS 101, Fall 2018 Learning Objectives After completing this unit, you should be able to: Identify whether a sequence of steps is an algorithm in the strict sense. Explain

More information

Lists, loops and decisions

Lists, loops and decisions Caltech/LEAD Summer 2012 Computer Science Lecture 4: July 11, 2012 Lists, loops and decisions Lists Today Looping with the for statement Making decisions with the if statement Lists A list is a sequence

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques () Lecture 5 September 10, 2018 Datatypes and Trees Announcements Homework 1 due tomorrow at 11:59pm! Homework 2 available soon due Tuesday, September 18 th Read Chapters

More information

Regression testing. Whenever you find a bug. Why is this a good idea?

Regression testing. Whenever you find a bug. Why is this a good idea? Regression testing Whenever you find a bug Reproduce it (before you fix it!) Store input that elicited that bug Store correct output Put into test suite Then, fix it and verify the fix Why is this a good

More information

Lecture 04 FUNCTIONS AND ARRAYS

Lecture 04 FUNCTIONS AND ARRAYS Lecture 04 FUNCTIONS AND ARRAYS 1 Motivations Divide hug tasks to blocks: divide programs up into sets of cooperating functions. Define new functions with function calls and parameter passing. Use functions

More information

Racket. CSE341: Programming Languages Lecture 14 Introduction to Racket. Getting started. Racket vs. Scheme. Example.

Racket. CSE341: Programming Languages Lecture 14 Introduction to Racket. Getting started. Racket vs. Scheme. Example. Racket Next 2+ weeks will use the Racket language (not ML) and the DrRacket programming environment (not emacs) Installation / basic usage instructions on course website CSE34: Programming Languages Lecture

More information

Unit Testing as Hypothesis Testing

Unit Testing as Hypothesis Testing Unit Testing as Hypothesis Testing Jonathan Clark September 19, 2012 5 minutes You should test your code. Why? To find bugs. Even for seasoned programmers, bugs are an inevitable reality. Today, we ll

More information

More Examples Using Functions and Command-Line Arguments in C++ CS 16: Solving Problems with Computers I Lecture #6

More Examples Using Functions and Command-Line Arguments in C++ CS 16: Solving Problems with Computers I Lecture #6 More Examples Using Functions and Command-Line Arguments in C++ CS 16: Solving Problems with Computers I Lecture #6 Ziad Matni Dept. of Computer Science, UCSB Administrative CHANGED T.A. OFFICE/OPEN LAB

More information

Effective R Programming

Effective R Programming Effective R Programming Jacob Colvin February 21, 2009 Jacob Colvin () Effective R Programming February 21, 2009 1 / 21 1 Introduction Motivation 2 R Concepts Language Details 3 Debuging 4 Profiling Tidying

More information

MITOCW watch?v=9h6muyzjms0

MITOCW watch?v=9h6muyzjms0 MITOCW watch?v=9h6muyzjms0 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 information

Steps for project success. git status. Milestones. Deliverables. Homework 1 submitted Homework 2 will be posted October 26.

Steps for project success. git status. Milestones. Deliverables. Homework 1 submitted Homework 2 will be posted October 26. git status Steps for project success Homework 1 submitted Homework 2 will be posted October 26 due November 16, 9AM Projects underway project status check-in meetings November 9 System-building project

More information

https://asd-pa.perfplusk12.com/admin/admin_curric_maps_display.aspx?m=5507&c=618&mo=18917&t=191&sy=2012&bl...

https://asd-pa.perfplusk12.com/admin/admin_curric_maps_display.aspx?m=5507&c=618&mo=18917&t=191&sy=2012&bl... Page 1 of 13 Units: - All - Teacher: ProgIIIJavaI, CORE Course: ProgIIIJavaI Year: 2012-13 Intro to Java How is data stored by a computer system? What does a compiler do? What are the advantages of using

More information

PIC 10A Objects/Classes

PIC 10A Objects/Classes PIC 10A Objects/Classes Ernest Ryu UCLA Mathematics Last edited: November 13, 2017 User-defined types In C++, we can define our own custom types. Object is synonymous to variable, and class is synonymous

More information

CSCI 1100L: Topics in Computing Lab Lab 11: Programming with Scratch

CSCI 1100L: Topics in Computing Lab Lab 11: Programming with Scratch CSCI 1100L: Topics in Computing Lab Lab 11: Programming with Scratch Purpose: We will take a look at programming this week using a language called Scratch. Scratch is a programming language that was developed

More information

Chapter 15 Debugging

Chapter 15 Debugging Chapter 15 Debugging Known, but unfixed errors Just ignore errors at this point. There is nothing we can do except to try to keep going. -A comment in XFS (xfs_vnodeops.c, line 1785) Error, skip block

More information

FUNctions. Lecture 03 Spring 2018

FUNctions. Lecture 03 Spring 2018 FUNctions Lecture 03 Spring 2018 Announcements PS0 Due Tomorrow at 11:59pm WS1 Released soon, due next Friday 2/2 at 11:59pm Not quite understand a topic in lecture this week? Come to Tutoring Tomorrow

More information

function [s p] = sumprod (f, g)

function [s p] = sumprod (f, g) Outline of the Lecture Introduction to M-function programming Matlab Programming Example Relational operators Logical Operators Matlab Flow control structures Introduction to M-function programming M-files:

More information

Programming. We will be introducing various new elements of Python and using them to solve increasingly interesting and complex problems.

Programming. We will be introducing various new elements of Python and using them to solve increasingly interesting and complex problems. Plan for the rest of the semester: Programming We will be introducing various new elements of Python and using them to solve increasingly interesting and complex problems. We saw earlier that computers

More information

CS143 Handout 05 Summer 2011 June 22, 2011 Programming Project 1: Lexical Analysis

CS143 Handout 05 Summer 2011 June 22, 2011 Programming Project 1: Lexical Analysis CS143 Handout 05 Summer 2011 June 22, 2011 Programming Project 1: Lexical Analysis Handout written by Julie Zelenski with edits by Keith Schwarz. The Goal In the first programming project, you will get

More information

Lecture 2. Object Orientation 1 / 51

Lecture 2. Object Orientation 1 / 51 Lecture 2 Object Orientation 1 / 51 Homework 1 Homework 1 was due at noon You will be graded on: Correctness: 15 points (passing all RSpec tests) Style: 5 points (having no Rubocop style offenses) Best

More information

18-642: Unit Testing 9/18/ Philip Koopman

18-642: Unit Testing 9/18/ Philip Koopman 18-642: Unit Testing 9/18/2017 2017 Philip Koopman Unit Testing Anti-Patterns: Only system testing Testing only happy paths Forgetting to test missing code Unit testing Test a single subroutine/procedure/method

More information

Programming Languages

Programming Languages CSE 130 : Fall 2008 Programming Languages Lecture 2: A Crash Course in ML Ranjit Jhala UC San Diego News On webpage: Suggested HW #1, sample for Quiz #1 on Thu PA #1 (due next Fri 10/10) No make-up quizzes

More information

Think like an Elm developer

Think like an Elm developer Think like an Elm developer Piper Niehaus Denver, CO, USA Backpacker / skier Nonprofit board chair Software Engineer at Pivotal Pivotal Tracker team Elm in Production since 2016 Internal Products and Services

More information

CS1 Lecture 5 Jan. 26, 2018

CS1 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 information

CS 11 Ocaml track: lecture 3

CS 11 Ocaml track: lecture 3 CS 11 Ocaml track: lecture 3 n Today: n A (large) variety of odds and ends n Imperative programming in Ocaml Equality/inequality operators n Two inequality operators: and!= n Two equality operators:

More information

Program Correctness and Efficiency. Chapter 2

Program Correctness and Efficiency. Chapter 2 Program Correctness and Efficiency Chapter 2 Chapter Objectives To understand the differences between the three categories of program errors To understand the effect of an uncaught exception and why you

More information

Real Time and Embedded Systems. by Dr. Lesley Shannon Course Website:

Real Time and Embedded Systems. by Dr. Lesley Shannon   Course Website: Real Time and Embedded Systems by Dr. Lesley Shannon Email: lshannon@ensc.sfu.ca Course Website: http://www.ensc.sfu.ca/~lshannon/courses/ensc351 Simon Fraser University Slide Set: 2 Date: September 13,

More information

Getting Started with Python

Getting Started with Python Fundamentals of Programming (Python) Getting Started with Python Sina Sajadmanesh Sharif University of Technology Some slides have been adapted from Python Programming: An Introduction to Computer Science

More information

Computer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.

Computer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13. Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with

More information

Python for Analytics. Python Fundamentals RSI Chapters 1 and 2

Python for Analytics. Python Fundamentals RSI Chapters 1 and 2 Python for Analytics Python Fundamentals RSI Chapters 1 and 2 Learning Objectives Theory: You should be able to explain... General programming terms like source code, interpreter, compiler, object code,

More information

Module 1: Introduction RStudio

Module 1: Introduction RStudio Module 1: Introduction RStudio Contents Page(s) Installing R and RStudio Software for Social Network Analysis 1-2 Introduction to R Language/ Syntax 3 Welcome to RStudio 4-14 A. The 4 Panes 5 B. Calculator

More information

Testing. Topics. Types of Testing. Types of Testing

Testing. Topics. Types of Testing. Types of Testing Topics 1) What are common types of testing? a) Testing like a user: through the UI. b) Testing like a dev: through the code. 2) What makes a good bug report? 3) How can we write code to test code (via

More information

SE420 Software Quality Assurance

SE420 Software Quality Assurance SE420 Software Quality Assurance Lecture 4 Unit Testing Tools, Part-1 January 29, 2018 Sam Siewert Assignment #1 Avoid Subjective Test Results Cost, Impact, Probability [Not from this year] 1. the code

More information

18-642: Unit Testing 1/31/ Philip Koopman

18-642: Unit Testing 1/31/ Philip Koopman 18-642: Unit Testing 1/31/2018 2017-2018 Philip Koopman YOU ARE HERE Product Requirements SPECIFY PRODUCT SPECIFY SOFTWARE Software Requirements TRACEABILITY & VALIDATION Test Plan & Test Results Test

More information

Objectives. Chapter 4: Control Structures I (Selection) Objectives (cont d.) Control Structures. Control Structures (cont d.) Relational Operators

Objectives. Chapter 4: Control Structures I (Selection) Objectives (cont d.) Control Structures. Control Structures (cont d.) Relational Operators Objectives Chapter 4: Control Structures I (Selection) In this chapter, you will: Learn about control structures Examine relational and logical operators Explore how to form and evaluate logical (Boolean)

More information

An Introduction to Tilde

An Introduction to Tilde An Introduction to Tilde Presentation on a FOSS tool for Lua development By Andrew Bailey, CTO, Tantalus & Allen Weeks, Lead Programmer, Tantalus. mailto:andrew@tantalus.com.au mailto:aweeks@tantalus.com.au

More information

NAN propagation versus fault trapping in floating point code

NAN propagation versus fault trapping in floating point code NAN propagation versus fault trapping in floating point code By Agner Fog. Technical University of Denmark. Copyright 2018. Last updated 2018-05-24. Contents 1 Introduction... 1 2 Fault trapping... 1 3

More information

Python for Non-programmers

Python for Non-programmers Python for Non-programmers A Gentle Introduction 1 Yann Tambouret Scientific Computing and Visualization Information Services & Technology Boston University 111 Cummington St. yannpaul@bu.edu Winter 2013

More information

CS 221 Lecture. Tuesday, 4 October There are 10 kinds of people in this world: those who know how to count in binary, and those who don t.

CS 221 Lecture. Tuesday, 4 October There are 10 kinds of people in this world: those who know how to count in binary, and those who don t. CS 221 Lecture Tuesday, 4 October 2011 There are 10 kinds of people in this world: those who know how to count in binary, and those who don t. Today s Agenda 1. Announcements 2. You Can Define New Functions

More information

CS 520 Theory and Practice of Software Engineering Fall 2018

CS 520 Theory and Practice of Software Engineering Fall 2018 CS 520 Theory and Practice of Software Engineering Fall 2018 Nediyana Daskalova Monday, 4PM CS 151 Debugging October 30, 2018 Personalized Behavior-Powered Systems for Guiding Self-Experiments Help me

More information

61A Lecture 25. Friday, October 28

61A Lecture 25. Friday, October 28 61A Lecture 25 Friday, October 2 From Last Time: Adjoining to a Tree Set 5 9 7 3 9 7 11 1 7 11 Right! Left! Right! Stop! 5 9 7 3 9 7 11 1 7 11 2 From the Exam: Pruned Trees a b c d (a,b) (a,c) (a,d) pruned

More information

Discussion 1H Notes (Week 3, April 14) TA: Brian Choi Section Webpage:

Discussion 1H Notes (Week 3, April 14) TA: Brian Choi Section Webpage: Discussion 1H Notes (Week 3, April 14) TA: Brian Choi (schoi@cs.ucla.edu) Section Webpage: http://www.cs.ucla.edu/~schoi/cs31 More on Arithmetic Expressions The following two are equivalent:! x = x + 5;

More information

BGGN 213 More on R functions and packages Barry Grant

BGGN 213 More on R functions and packages Barry Grant BGGN 213 More on R functions and packages Barry Grant http://thegrantlab.org/bggn213 Recap From Last Time: Data frames are created with the data.frame() function as well as the read.table() family of functions

More information

The compiler is spewing error messages.

The compiler is spewing error messages. Appendix B Debugging There are a few different kinds of errors that can occur in a program, and it is useful to distinguish between them in order to track them down more quickly. Compile-time errors are

More information

JavaScript I Language Basics

JavaScript I Language Basics JavaScript I Language Basics Chesapeake Node.js User Group (CNUG) https://www.meetup.com/chesapeake-region-nodejs-developers-group START BUILDING: CALLFORCODE.ORG Agenda Introduction to JavaScript Language

More information

Software Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore

Software Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore Software Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore Lecture 04 Software Test Automation: JUnit as an example

More information