cs1301-exam2-fall09-answers

Cs1301-exam2-fall09- - CS1301 Exam2 Name Section Instructions • Please write clearly What I cannot read I will not grade • Show all your work

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS1301 - Exam2 Name: Section: Instructions: • Please write clearly. What I cannot read, I will not grade. • Show all your work in detail. I give partial credit. • This exam has 11 pages including the title page. Please check to make sure all pages are included. • This exam is closed book, closed notes, no calculators. • Don’t get bogged down on any one question. You will have 50 minutes to complete this exam. I commit to uphold the ideals of honor and integrity by refusing to betray the trust bestowed upon me as a member of the Georgia Tech community. Signature: Question Points Score 1. Vocabulary 21 2. Fill in the Blanks 4 3. Python Expressions 22 4. Robot Drawing 9 5. Find the Error 3 6. Leaky Pipes 6 7. countUpBy 8 8. Average a List 8 9. Save Light Values 10 Bonus Questions Total: 91 Fall 2009 CS 1301 Exam 2 (cont.) Vocabulary Questions 1. For each of the following vocabulary terms, write a concise 1-2 sentence definition. Be brief, and to the point. (a) (3 points) block Solution: One or more program statements that share the same level of indentation. (b) (3 points) dictionary Solution: A mutable compound data type that associates keys with values. (c) (3 points) flow of execution Solution: The order in which statements in a program are executed. Function calls, return statements, conditionals and loops all modify the standard top to bottom flow of execution. (d) (3 points) function Solution: A named sequence (block) of statements that performs some useful operation. Functions may or may not take parameters and may or may not produce a result. (e) (3 points) recursion Solution: recursion - The process of calling the function that is currently executing. (f) (3 points) slice Solution: A subsequence copied from a sequence specified by a range of indices. The slice operator is: sequence[start:stop]....
View Full Document

This note was uploaded on 01/25/2012 for the course CS 1301 taught by Professor Staff during the Fall '08 term at Georgia Institute of Technology.

Page1 / 11

Cs1301-exam2-fall09- - CS1301 Exam2 Name Section Instructions • Please write clearly What I cannot read I will not grade • Show all your work

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online