CS 1301 Chapter Notes - Chapter 4: Stack Trace

• School: Georgia Tech
• Department: Computer Science
• Course: CS 1301
• Professor: Melinda H Mc Daniel

Document Summary

Function- named sequence of statements that belong together; helps us to organize programs into chunks that match how we thing about the problem: ex. def name (parameters, statements. Compound statements- number of statements inside function; indented; consists of two parts: 1. Parameters- enclosed in parentheses; may contain any number of parameters separated from one another by commas; specifies what information. Abstraction- mental chunk; number of small steps. Function call- call some function; contain name function being executed followed by list of values, arguments, which are assigned to parameters in function definition. Frame- box in stack diagram that represents function call; contains local variables and parameters of function. Function composition- using output from one function call as input to another. Flow of execution- begins at first statement of program; statements are executed one at a time from top to bottom; function calls are detours from flow of execution; order in which statements are executed during program run.