Building Python Programs

About our authors Stuart Reges is a Principal Lecturer in the Paul G. Allen School of Computer Science and Engineering at the University of Washington. He manages the introductory programming classes, participates in the design of undergraduate curricula, and is involved in K to 12 outreach. He held similar positions at Stanford University and the University of Arizona in a career spanning 30 years. In 1985 he won the Dinkelspiel Award for Outstanding Service to Undergraduate Education at Stanford. In 2012 he won the Distinguished Teaching Award, which is the highest award given by UW for teaching.Allison Obourn holds a position as Senior Lecturer in the Computer Science Department at the University of Arizona. She worked as a Lecturer at the University of Washington Computer Science & Engineering Department prior to moving to the University of Arizona. At both schools, she has specialized in teaching introductory programming and web programming. She holds a master’s degree from the University of Washington Computer Science & Engineering Department.

• Chapter 1 Introduction to Python Programming 1.1 Basic Computing Concepts Why Programming?Hardware and SoftwareThe Digital RealmThe Process of ProgrammingWhy Python?The Python Programming Environment1.2 And Now: Python Printing OutputString Literals (Strings)Escape SequencesPrinting a Complex FigureComments, Whitespace, and Readability1.3 Program Errors Syntax ErrorsLogic Errors (Bugs)1.4 Procedural Decomposition FunctionsFlow of ControlIdentifiers and KeywordsFunctions That Call Other FunctionsAn Example Runtime Error1.5 Case Study: Drawing Figures Structured VersionFinal Version without RedundancyAnalysis of Flow of ExecutionChapter 2 Data and Definite Loops 2.1 Basic Data Concepts TypesExpressionsLiteralsArithmetic OperatorsPrecedenceMixing and Converting Types2.2 Variables A Program with VariablesIncrement/Decrement OperatorsPrinting Multiple Values2.3 The for Loop Using a Loop VariableDetails about RangesString Multiplication and Printing Partial LinesNested for Loops2.4 Managing Complexity ScopePseudocodeConstants2.5 Case Study: Hourglass Figure Problem Decomposition and PseudocodeInitial Structured VersionAdding a ConstantChapter 3 Parameters and Graphics 3.1 Parameters The Mechanics of ParametersLimitations of ParametersMultiple ParametersParameters versus ConstantsOptional Parameters3.2 Returning Values The math ModuleThe random ModuleDefining Functions That Return ValuesReturning Multiple Values3.3 Interactive Programs Sample Interactive Program3.4 Graphics Introduction to DrawingPanelDrawing Lines and ShapesColorsDrawing with LoopsText and FontsImagesProcedural Decomposition with Graphics3.5 Case Study: Projectile Trajectory Unstructured SolutionStructured SolutionGraphical VersionChapter 4 Conditional Execution 4.1 if/else Statements Relational OperatorsNested if/else StatementsFactoring if/else StatementsTesting Multiple Conditions4.2 Cumulative Algorithms Cumulative SumMin/Max LoopsCumulative Sum with ifRoundoff Errors4.3 Functions with Conditional Execution Preconditions and PostconditionsRaising ExceptionsRevisiting Return ValuesReasoning about Paths4.4 Strings String MethodsAccessing Characters by IndexConverting between Letters and NumbersCumulative Text Algorithms4.5 Case Study: Basal Metabolic Rate One-Person Unstructured SolutionTwo-Person Unstructured SolutionTwo-Person Structured SolutionProcedural Design HeuristicsChapter 5 Program Logic and Indefinite Loops 5.1 The while Loop A Loop to Find the Smallest DivisorLoop Priming5.2 Fencepost Algorithms Fencepost with ifSentinel LoopsSentinel with Min/Max5.3 Boolean Logic Logical OperatorsBoolean Variables and FlagsPredicate FunctionsBoolean ZenShort-Circuited Evaluation5.4 Robust Programs The try/except StatementHandling User Errors5.5 Assertions and Program Logic Reasoning about AssertionsA Detailed Assertions Example5.6 Case Study: Number Guessing Game Initial Version without HintingRandomized Version with HintingFinal Robust VersionChapter 6 File Processing 6.1 File-Reading Basics Data and FilesReading a File in PythonLine-Based File ProcessingStructure of Files and Consuming InputPrompting for a File6.2 Token-Based Processing Numeric InputHandling Invalid InputMixing Lines and TokensHandling Varying Numbers of TokensComplex Input Files6.3 Advanced File Processing Multi-Line Input RecordsFile OutputReading Data from the Web6.4 Case Study: ZIP Code LookupChapter 7 Lists 7.1 List Basics Creating ListsAccessing List ElementsTraversing a ListA Complete List ProgramRandom AccessList Methods7.2 List-Traversal Algorithms Lists as ParametersSearching a ListReplacing and Removing ValuesReversing a ListShifting Values in a ListNested Loop AlgorithmsList Comprehensions7.3 Reference Semantics Values and ReferencesModifying a List ParameterThe Value NoneMutabilityTuples7.4 Multidimensional Lists Rectangular ListsJagged ListsLists of Pixels7.5 Case Study: Benford’s Law Tallying ValuesCompleting the ProgramChapter 8 Dictionaries and Sets 8.1 Dictionary Basics Creating a DictionaryDictionary OperationsLooping Over a DictionaryDictionary Ordering8.2 Advanced Dictionary Usage Dictionary for TallyingNested CollectionsDictionary Comprehensions8.3 Sets Set BasicsSet OperationsSet EfficiencySet Example: LotteryChapter 9 Recursion 9.1 Thinking Recursively A Nonprogramming ExampleIteration to RecursionStructure of Recursive SolutionsReversing a FileThe Recursive Call Stack9.2 Recursive Functions and Data Integer ExponentiationGreatest Common DivisorDirectory Crawler9.3 Recursive Graphics Cantor SetSierpinski Triangle9.4 Recursive Backtracking Traveling North/EastEight Queens PuzzleStopping after One Solution9.5 Case Study: Prefix Evaluator Infix, Prefix, and Postfix NotationEvaluating Prefix ExpressionsComplete ProgramChapter 10 Searching and Sorting 10.1 Searching and Sorting Libraries Binary Search