Starting Out With Python: Global Edition Global Edition

GLOBAL GLOBAL
EDITION EDITION
For these Global Editions, the editorial team at Pearson has

collaborated with educators across the world to address a wide
range of subjects and requirements, equipping students with the best
possible learning tools. This Global Edition preserves the cutting-edge
approach and pedagogy of the original, but also features alterations,
customization, and adaptation from the North American version.
Starting Out with Python®

FOURTH EDITION
This is a special edition of an established title widely

used by colleges and universities throughout the world.
Tony Gaddis
Pearson published this exclusive edition for the benefit
of students outside the United States and Canada. If you
purchased this book within the United States or Canada,
you should be aware that it has been imported without
the approval of the Publisher or Author.
Pearson Global Edition

744 Credits
RESPECTIVE SUPPLIERS HEREBY DISCLAIM ALL WARRANTIES AND CONDITIONS WITH REGARD TO
THIS INFORMATION, INCLUDING ALL WARRANTIES AND CONDITIONS OF MERCHANTABILITY,
Digital Resources for Students WHETHER EXPRESS, IMPLIED OR STATUTORY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
NON-INFRINGEMENT. IN NO EVENT SHALL MICROSOFT AND/OR ITS RESPECTIVE SUPPLIERS
BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
Your new textbook provides 12-month access to digital resources that may include WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF
CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
VideoNotes (step-by-step video tutorials on programming concepts), source code, web
WITH THE USE OR PERFORMANCE OF INFORMATION AVAILABLE FROM THE SERVICES. THE
chapters, quizzes, and more. Refer to the preface in the textbook for a detailed list of DOCUMENTS AND RELATED GRAPHICS CONTAINED HEREIN COULD INCLUDE TECHNICAL
resources. INACCURACIES OR TYPOGRAPHICAL ERRORS. CHANGES ARE PERIODICALLY ADDED TO
THE INFORMATION HEREIN. MICROSOFT AND/OR ITS RESPECTIVE SUPPLIERS MAY MAKE
Follow the instructions below to register for the Companion Website for Tony Gaddis’ IMPROVEMENTS AND/OR CHANGES IN THE PRODUCT(S) AND/OR THE PROGRAM(S) DESCRIBED
Starting Out with Python, Fourth Edition, Global Edition. HEREIN AT ANY TIME. PARTIAL SCREEN SHOTS MAY BE VIEWED IN FULL WITHIN THE SOFTWARE
VERSION SPECIFIED.
1. Go to www.pearsonglobaleditions.com/gaddis
2. Enter the title of your textbook or browse by author name.
3. Click Companion Website.
4. Click Register and follow the on-screen instructions to create a login name
and password.
ISSGPY-PRANK-CURRY-PIQUE-METIS-ROUSE
Use the login name and password you created during registration to start using the
online resources that accompany your textbook.
IMPORTANT:
This prepaid subscription does not include access to MyProgrammingLab, which is
available at www.myprogramminglab.com for purchase.
This subscription is valid for 12 months upon activation and is not transferable.
For technical support go to https://support.pearson.com/getsupport

Credits
Cover Image © Africa Studio/Shutterstock

Figure 1.2a pg. 25 © iko/Shutterstock
Figure 1.2b pg. 25 © Nikita Rogul/Shutterstock
Figure 1.2c pg. 25 © Feng Yu/Shutterstock
Figure 1.2d pg. 25 © Chiyacat/Shutterstock
Figure 1.2e pg. 25 © Eikostas/Shutterstock
Figure 1.2f pg. 25 © tkemot/Shutterstock
Figure 1.2g pg. 25 © Vitaly Korovin/Shutterstock This page intentionally left blank
Figure 1.2h pg. 25 © Lusoimages/Shutterstock
Figure 1.2i pg. 25 © jocic/Shutterstock
Figure 1.2j pg. 25 © Best Pictures/Shutterstock
Figure 1.2k pg. 25 © Peter Guess/Shutterstock
Figure 1.2l pg. 25 © Aquila/Shutterstock
Figure 1.2m pg. 25 © Andre Nitsievsky/Shutterstock
Figure 1.3 pg. 26 Courtesy of US Army Historic Computer Images
Figure 1.4 pg. 26 © Creativa/Shutterstock
Figure 1.5 pg. 27 © Garsya/Shutterstock
Chapter 1 Microsoft screenshots - SEE MICROSOFT AGREEMENT FOR FULL CREDIT.
MICROSOFT AND/OR ITS RESPECTIVE SUPPLIERS MAKE NO REPRESENTATIONS ABOUT THE

SUITABILITY OF THE INFORMATION CONTAINED IN THE DOCUMENTS AND RELATED GRAPHICS
PUBLISHED AS PART OF THE SERVICES FOR ANY PURPOSE. ALL SUCH DOCUMENTS AND RELATED
GRAPHICS ARE PROVIDED “AS IS” WITHOUT WARRANTY OF ANY KIND. MICROSOFT AND/OR ITS
743
742 Index
V reassignment to different type, 70

Validation scope, 245–246
code, Boolean functions in, 282 statements, 62–65
input, 209 target, 194
password characters, 446–449 Visual Basic, 39
STARTING OUT WITH

ValueError, 349–350, 354, 355, 356, 358, 382
Value-returning functions W
benefits, 274 while loops. See also Loops
P
defined, 261 Widgets
general format, 272 arrangement of, 630
how to use, 274–276 Button, 622, 630–633
®
and IPO charts, 276–277 Canvas, 622
randint and, 263–266 Checkbutton, 622, 648–650
random number generation, 262–271 defined, 622
randrange and, 269–270 Entry, 622, 633–636
returning multiple values, 282–283 Frame, 622, 629
return statement, 272–274 with frames, organizing, 627–630
for simplifying mathematical expressions, 274–276 Label, 622, 625–626, 629, 636–640
values, 261, 274 Listbox, 622
void functions and, 233 list of, 641
F OUR TH ED ITION writing, 272–283
Values
Menu, 622
Menubutton, 622
GLOBA L EDITION Boolean, 281–282

data attribute, 514
Message, 622
Radiobutton, 622, 644–647
dictionaries, 463–464 Scale, 622
global constants, 259 Scrollbar, 622
list, averaging, 388–389 Text, 622
list, totaling, 388 tkinter module, 622
multiple, returning, 282–283 Toplevel, 622
random numbers to represent, 268–269 wildcard import statement, 702
range of, 160 writelines method, 395
seed, 270 write method
value-returning functions, 261, 274 defined, 314
values method, 473–474 format for calling, 314–315
Variables Writing
Boolean, 161–162 code, 54
defined, 62, 67 data to files, 314, 318–320
global, 257–259 numeric data, 327–329
local, 245–247, 254, 283, 602 programs in IDLE editor, 687–688
math module, 285 records, 338
names, sample, 66
naming rules, 65–66 Z
reassignment, 67–68 ZeroDivisionError exception, 358
Index 741
Toplevel widget, 622 turtle.speed(speed) function, 108

Totals turtle.write(text) function, 109–110
list values, 388 Turtles/turtle graphics, 96–97
running, 201–204 animation speed, controlling, 108
Towers of Hanoi. See also Recursive algorithms animation speed, determination of, 165
base case, 612 background color, changing, 105
defined, 610 circles, drawing with, 103–104
illustrated, 610 current colors, determination of, 164
problem solution, 611–612 current heading, 102
program code, 612–613 current position, 108
steps for moving pegs, 611 displaying text in window, 109–110
Tracebacks, 347, 351 dots, drawing with, 103–104
Truck class, 579–580 drawing color, changing, 105
Truncation, in integer division, 78 filling shapes, 110–112
Truth tables functions, 290–297
not operator, 157 heading, determination of, 163
and operator, 156 hiding, 109
or operator, 156 hit the target game, 165–170
try/except statement lines drawing with, 97
else clause, 357–358 locations, determination of, 162–163
execution of, 349 loops in, 219–222
finally clause, 358 moving to specific location, 106–107
handing exceptions with, 350, 352–353 pen, changing size, 104
one except clause, 354–355 pen, up and down movement, 102–103
use example, 349–350 pen is down, determination of, 163
Tuples, 402–404 pen size, determination of, 164–165
Turtle module, 97 setting heading to specific angle, 101–102
turtle.bgcolor() function, 164 state of turtle, determination of, 162–170
turtle.bgcolor(color) function, 105 turning, 97, 99–101 This page intentionally left blank
turtle.circle(radius) function, 103 using, 113–120
turtle.clear() function, 106 visibility, determination of, 163
turtle.clearscreen() function, 106 window, resetting, 106
turtle.dot() function, 104 window, size of, 106
turtle.down() function, 113 Two-dimensional lists, 398–402. See also Lists
turtle.fillcolor() function, 164 Two’s complement, 34
turtle.forward(n) function, 97 type function, 69
turtle.heading() function, 163
turtle.heading() function, 102 U
turtle.hideturtle() function, 109 UML diagrams
turtle.isdown() function, 163 Customer class, 561
turtle.isvisible() function, 163 inheritance in, 582–583
turtle.pencolor() function, 164 layout, 555
turtle.pencolor(color) function, 105 ServiceQuote class, 564
turtle.pendown() function, 103 Unicode, 33
turtle.pensize() function, 164–165 Unified Modeling Language (UML), 554
turtle.pensize(width) function, 104 union method, 489
turtle.penup() function, 103 Union of sets, 489
turtle.pos() function, 108 update method, 486
turtle.reset() function, 106 upper() method, 444
turtle.setheading(angle) USB drives, 27–28
function, 101–102 User interfaces
turtle.setup(width, height) command line, 619–621
function, 106 defined, 619
turtle.showturtle() function, 97 graphical user (GUIs), 619–679
turtle.speed() function, 165 Utility programs, 28
740 Index
Statements (continued) polymorphism, 588–594

if, 131–139 writing, 575
if-elif-else, 147–155 Subscripts, 400
if-else, 140–143 Subsets, 492
import, 261–262 Subtraction (−) operator
return, 272–274, 283 defined, 76
STARTING OUT WITH try/except, 346, 348–349, 354–355, 357, 358
Step values, 194
precedence, 79
Superclasses
P
str data type, 69–70 as base classes, 574
str function defined, 574
defined, 326 in UML diagrams, 582–583
®
example use, 323 writing, 575
String comparisons, 144–147, 444–445, 463, 464 Supersets, 492
String concatenation SUV class, 580–581
defined, 90, 434 Symbols, flowchart, 56
example, 90 symmetric_difference method, 491
interactive sessions, 434 Symmetric difference of sets, 491
newline to, 319–320 Syntax
with + operator, 90 defined, 40
with += operator, 435 human language, 41
F OUR TH ED ITION String literals
defined, 59
Syntax errors
correcting, 54
GLOBA L EDITION enclosing in triple quotes, 60
Strings
defined, 41
reporting, 691
characters, accessing, 430–434 running programs and, 691
comparing, 144–148 System software, 28–29
defined, 59
extracting characters from, 438–440 T
as immutable, 435–436 tan() function, 285
Tony Gaddis
indexes, 432–433 Target variables
iterating with for loop, 430–432 defined, 192
list of, 366 inside for loops, 194–196
Haywood Community College method call format, 442 use example, 195
modification methods, 444–445 Terminal symbols, 56
operations, 429–436 Testing
raw, 314 dictionary values, 463–464
reading as input, 429 programs, 54–55
repetition operator (*) with, 450–451 set values, 488–489
returning, 280 string methods, 442–443
search and replace methods, 445–446 strings, 441
slicing, 437–438 Text
space character at end, 73 drawing with Canvas widget, 667–672
splitting, 451–452 displaying with Label widget, 624–627
storing with str data type, 69–70 editing, 687–688
stripping newline from, 320–322 font setting, 670–672
testing, 441 Text files
testing methods, 442–443 defined, 311
writing as output, 429 reading numbers from, 324
written to files, 316 Text widget, 622
StringVar object, 636–637 third-party modules, 705
strip() method, 444 Tkinter module
Stripping newline from string, 320–322 defined, 621
Structure charts. See Hierarchy charts programs using, 622
Subclasses widgets, 622
defined, 574 Top-down design
as derived classes, 574 defined, 240
method override, 588 process, 240–241
�)è“ÜÊÃ�ZãØ——ã �B—ô�xÊØ¹ �Bx�
Index 739
Running programs, 690–691 set method, 640, 647 Senior Vice President Courseware Portfolio Management: Marcia J. Horton
Running totals Sets Director, Portfolio Management: Engineering,
calculating, 201–204 adding elements, 486–487 Computer Science & Global Editions: Julian Partridge
defined, 201 creating, 485
Portfolio Manager: Matt Goldstein
elements for calculating, 201 defined, 484
example, 202 difference of, 490–491
Acquisitions Editor, Global Edition: Sourabh Maheshwari
logic for calculating, 201 duplicate elements, 485 Portfolio Management Assistant: Kristy Alaura
elements, as unique, 484 Field Marketing Manager: Demetrius Hall
S elements, number of, 486 Product Marketing Manager: Yvonne Vannatta
Samples, 34 elements, removing, 487–488 Managing Producer, ECS and Math: Scott Disanno
Saving programs, 690 intersection of, 490 Content Producer: Sandra L. Rodriguez
SavingsAccount class, 584, 585 for loop iteration over, 488
Project Editors, Global Edition: Tanima Ghosh and Neelakantan K.K.
Scale widget, 622 operations, 493–495
Scientific notation, 92 subsets, 492
Senior Manufacturing Controller, Global Edition: Jerry Kataria
Scope supersets, 492 Manager, Media Production, Global Edition: Vikram Kumar
defined, 245 symmetric difference of, 491 Cover Designer: Lumina Datamatics
local variables and, 245–247 union of, 489 Cover Photo: Africa Studio/Shutterstock
parameter variable, 249 unordered, 484
Credits and acknowledgments borrowed from other sources and reproduced, with permission, appear
Script mode, running programs in, 45 values, testing, 488–489
Scrollbar widget, 622 Settings. See Mutator methods
on the Credits page in the endmatter of this textbook.
Searching Showinfo function, 630 Pearson Education Limited
lists, 376–377 sin() function, 285
KAO Two
records, 339–341 Single alternative decision structures, 132
strings, 445–446 Slices KAO Park
Secondary storage defined, 373 Harlow
defined, 27 example use, 373–375 CM17 9NA
devices, 27–28 general format, 373 United Kingdom
Seeds, random number, 270–271 invalid indexes and, 375
Seed value, 270 list, 373–376 and Associated Companies throughout the world
Selection structures. See Decision structures start and end index, 374
Visit us on the World Wide Web at: www.pearsonglobaleditions.com
Sentinels string, 437–438
defined, 204, 205 Software © Pearson Education Limited 2019
using, 205–206 application, 29
values, 204–205 defined, 23 The rights of Tony Gaddis to be identified as the author of this work has been asserted by him in accor-
Separators developers. See Programmers dance with the Copyright, Designs and Patents Act 1988.
comma, 92–93 development tools, 29
item, 88–89 operating system, 28 Authorized adaptation from the United States edition, entitled Starting Out with Python, 4th Edition,
split method, 451–452 requirements, 55 ISBN 978-0-13-444432-1 by Tony Gaddis, published by Pearson Education © 2018.
Sequences. See also Lists system, 28–29
accepting as argument, 383–384 types of, 28 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted
defined, 365 utility programs, 28 in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without either
length, returning, 369 Sorting, item list, 381–382 the prior written permission of the publisher or a license permitting restricted copying in the United Kingdom
tuples, 402–404 sort method, 378, 381–382
issued by the Copyright Licensing Agency Ltd, Sa ron House, 6–10 Kirby Street, London EC1N 8TS.
Sequence structures Source code. See Code
with decision structure, 147 Specialization, 573–574 All trademarks used herein are the property of their respective owners. The use of any trademark in this
defined, 131 split method, 451 text does not vest in the author or publisher any trademark ownership rights in such trademarks, nor
example, 131 Splitting strings, 451–452
does the use of such trademarks imply any a liation with or endorsement of this book by such owners.
nested inside decision structure, 148 sqrt() function, 285
structure, 147, 148 startswith method, 445, 446
British Library Cataloguing-in-Publication Data
use in programming, 131–132 Statements
Serializing objects for, 190, 194, 196 A catalogue record for this book is available from the British Library
defined, 496 assignment, 62–65
10 9 8 7 6 5 4 3 2 1
example, 498–500, 542–544 in blocks, 133, 235
pickle module, 496–497 breaking into multiple lines, 86–87 ISBN 10: 1-292-22575-0
unserializing, 500–502, 543–544 converting math formulas to, 83–85 ISBN 13: 978-1-292-22575-3
ServiceQuote class, 563–565 defined, 40
set function, 485 del, 383 Typeset by iEnergizer Aptara®, Ltd.
Printed and bound in Malaysia
738 Index
Random numbers (continued) problem solving with, 602–606

interactive mode, 266 stopping of, 605
pseudo, 270–271 Recursive algorithms
to represent other values, 268–269 designing, 603
seeds, 270–271 efficiency, 602
using, 266–267 examples of, 606–613
range function Fibonacci series, 607–609
arguments passed to, 193–194 greatest common divisor, 609–610
Contents at a Glance default, 193

generation, 193
iterable object, converting to list, 192–193,
recursive call, 605
summing range of list elements, 606–607
Towers of Hanoi, 610–613
366–367 Recursive case, 603
with for loop, 192–194 Recursive functions
Raw string, 318 call, 602
Preface 13 Read, priming, 208, 328 defined, 599
Reading efficiency, 613
Chapter 1 Introduction to Computers and Programming 23 data from files, 311, 316–319 example, 599–602
files with loops, 327–329 functioning of, 603
Chapter 2 Input, Processing, and Output 53 input from keyboard, 71–73 overhead, 602
with for loop, 329–330 Relational operators
Chapter 3 Decision Structures and Boolean Logic 131
numbers from text files, 324 defined, 133
Chapter 4 Repetition Structures 181 numbers with input function, 73–75 in string comparisons, 145–146
numeric data, 323–326 types of, 134
Chapter 5 Functions 231 records, 335 Remainder (%) operator
strings, and stripping newline, 320–322 defined, 76, 82
Chapter 6 Files and Exceptions 309 readline method precedence, 79
defined, 317 use example, 82–83
Chapter 7 Lists and Tuples 365
empty string return, 328 remove method, 378, 382–383, 487–488
Chapter 8 More About Strings 429 example use, 317–318 Repetition operator (*)
reading strings from files with, 325 defined, 367
Chapter 9 Dictionaries and Sets 461 return, 317, 319 general format, 367, 450
readlines method, 396 for lists, 367
Chapter 10 Classes and Object-Oriented Programming 511 read method, 316–317 for strings, 450–451
Read position use example, 450–451
Chapter 11 Inheritance 573 advanced to the end of file, 319 Repetition structures. See also Loops
Chapter 12 Recursion 599 advance to next line, 318–319 defined, 181, 182
defined, 318 example, 181–182
Chapter 13 GUI Programming 619 initial, 318 flowchart, 186
Records introduction to, 181–182
Appendix A Installing Python 681 adding, 337–339 replace method, 445, 446
defined, 333 Reserved words. See Key words
Appendix B Introduction to IDLE 685 deleting, 344–346 Returning
Appendix C The ASCII Character Set 693 displaying, 337–339 Boolean values, 281–282
fields, 334 dictionary values, 472–474
Appendix D Predefined Named Colors 695 files, 334 key-value pairs, 473
modifying, 341–343 lists from functions, 390–392
Appendix E More About the import Statement 701 processing, 333–346 multiple values, 282–263
programs storing, 337 strings, 280
Appendix F Installing Modules with the pip Utility 705 searching, 339–341 return statement
Appendix G Answers to Checkpoints 707 writing to sequential access files, 334 defined, 272
Recursion form, 272
Index 725 depth of, 602 result variable and, 274, 283
direct, 606 using, 274
Credits 743 in factorial calculation, 603–605 reverse method, 378, 383
indirect, 606 Rounding, 78
list elements with, 606–607 rstrip() method, 321, 444
loops vs., 602–603, 613 Ruby, 39
5
Index 737
Programs (examples in this book) (continued) write_number_list.py, 397

sales_list.py, 370–371 write_numbers.py, 323
sales_report1.py, 352 write_sales.py, 326–327
sales_report2.py, 354–355 wrong_type.py, 592
sales_report3.py, 356 Pseudocode, 56
sales_report4.py, 357–358 Pseudorandom numbers, 270–271
save_emp_records.py, 338–339 Public methods, 514
save_running_times.py, 331–332 Python
search_coffee_records.py, 340 defined, 39
servicequote.py, 564–565 downloading, 681
sets.py, 493–495 execution by, 687
show_coffee_records.py, 338–339 IDLE, 45–46, 685
simple_loop1.py, 191 installing, 42, 681–683
simple_loop2.py, 192 interactive mode, 43–44
simple_loop3.py, 192 interpreter, 41, 43
simple_loop4.py, 193 key words, 39
simple_math.py, 76–77 in learning programming, 23–24
sort_names.py, 146 script mode, 44–45
speed_converter.py, 197–198 Shell window, 685, 686, 691
spiral_circles.py, 221 Python programs
spiral_lines.py, 222 running, 45
split_date.py, 452 writing in IDLE editor, 687–688
square_root.py, 284 writing in script mode, 44–45
squares.py, 195
stair_step_pattern.py, 218 Q
string_args.py, 253 Quit button, 632–635
string_input.py, 72
string_split.py, 451 R
string_test.py, 443 radians() function, 285 This page intentionally left blank
string_variable.py, 70 Radio buttons
strip_newline.py, 325–326 defined, 644
sum_numbers.py, 202 group of, 644
temperature.py, 188–189 illustrated, 644
test_average.py, 138–139 use example, 645–647
test_averages.py, 642–644 uses, 644
test_score_average.py, 81 Radiobutton widget
test_score_averages.py, 214–215 callback functions with, 647
time_converter.py, 82–83 creation and use example, 644–647
total_ages.py, 273 defined, 622
total_function.py, 390 as mutually exclusive, 645
total_list.py, 388 RAM. See Random access memory
towers_of_hanoi.py, 612–613 (RAM)
triangle_pattern.py, 217 randint function
two_functions.py, 236–237 calling, 263
unpickle_cellphone.py, 543–544 defined, 263
unpickle_objects.py, 500–502 in interactive mode, 266
user_squares1.py, 198–199 in math expression, 268
user_squares2.py, 199–200 random number generation, 264–266
validate_password.py, 449 return value, 263–264
variable_demo.py, 64 use examples, 265–266
variable_demo2.py, 64 Random access files, 312
variable_demo3.py, 67 Random access memory (RAM), 27
variable_demo4.py, 67–68 random module, 263, 269, 270–271
vehicles.py, 575–576, 577, 579, 580 Random numbers
writelines.py, 395 displaying, 265
write_list.py, 396 example uses, 262–263
write_names.py, 320 generating, 263–266
736 Index
Programs (examples in this book) (continued) grader.py, 152–153

change_me.py, 253–254 graphics_mod_demo.py, 296–297
checkbutton_demo.py, 648–650 gross_pay.py, 251
circle.py, 286–287 gross_pay1.py, 348–349
coin_argument.py, 541 gross_pay2.py, 349–350
coin_demo1.py, 519–520 gross_pay3.py, 355–356
coin_demo2.py, 522–523 hello_world.py, 624–625
coin_demo3.py, 523–525 hello_world2.py, 626
Contents coin_demo4.py, 526

coin_demo5.py, 533
hello_world3.py, 626–627
hit_the_target.py, 167–170
coin.py, 525–526 hypotenuse.py, 284–285
coin_toss.py, 268–269 index_list.py, 380
columns.py, 93–94 infinite.py, 189
commission.py, 184 in_list.py, 376–377
commission2.py, 232 input.py, 74–75
Preface 13 commission_rate.py, 278–280 keyword_args.py, 255–256
concatenate.py, 435–436 keywordstringargs.py, 256
Chapter 1 Introduction to Computers and Programming 23 concentric_circles.py, 219–221 kilo_converter.py, 634–636
1.1 Introduction 23 contact_manager.py, 546–554 kilo_converter2.py, 637–639
1.2 Hardware and Software 24 contact.py, 545 line_graph1.py, 406–407
1.3 How Computers Store Data 29 count_Ts.py, 432 line_graph2.py, 407–408
cups_to_ounces.py, 250–251 list_append.py, 378–379
1.4 How a Program Works 34
customer.py, 562 loan_qualifier.py, 149–150
1.5 Using Python 42 delete_coffee_record.py, 348–349 loan_qualifier2.py, 158–159
Review Questions 46 dice.py, 267 loan_qualifier3.py, 159–160
display_file.py, 350–351 login.py, 438–439, 447–449
Chapter 2 Input, Processing, and Output 53 display_file2.py, 351–352 modify_coffee_records.py, 342–343
2.1 Designing a Program 53 division.py, 346–347 multiple_args.py, 251–252
2.2 Input, Processing, and Output 57 dollar_display.py, 92–93 my_graphics.py, 295–296
2.3 Displaying Output with the print Function 58 draw_arc.py, 660–661 no_formatting.py, 90–91
draw_circles.py, 292–293 orion.py, 118–121
2.4 Comments 61
draw_line.py, 652–653 pass_arg.py, 248
2.5 Variables 62 draw_lines.py, 294–295 password.py, 143–144
2.6 Reading Input from the Keyboard 71 draw_multi_lines.py, 654–655 pickle_cellphone.py, 542–543
2.7 Performing Calculations 75 draw_ovals.py, 658–659 pickle_objects.py, 498–500
2.8 More About Data Output 87 draw_piechart.py, 663–665 polymorphism_demo.py, 591–592
2.9 Named Constants 95 draw_polygon.py, 665–666 polymorphism_demo2.py, 593–594
2.10 Introduction to Turtle Graphics 96 draw_square.py, 656 property_tax.py, 205–206
draw_squares.py, 291–292 quit_button.py, 632–633
Review Questions 122
draw_text.py, 667–668 radiobutton_demo.py, 645–646
Programming Exercises 126 drop_lowest_score.py, 392–395 random_numbers.py, 264, 401
empty_window1.py, 622–623 random_numbers2.py, 264–265
Chapter 3 Decision Structures and Boolean Logic 131 empty_window2.py, 623–624 read_emp_records.py, 336–337
3.1 The if Statement 131 endless_recursion.py, 599–600 read_list.py, 396–397
3.2 The if-else Statement 140 fibonacci.py, 608–609 read_number_list.py, 398
3.3 Comparing Strings 143 file_read.py, 316–317 read_number.py, 325
3.4 Nested Decision Structures and the if-elif-else Statement 147 file_write.py, 315–316 read_running_times.py, 332–333
font_demo.py, 671–672 read_sales.py, 329
3.5 Logical Operators 155
formatting.py, 90–91 read_sales2.py, 330
3.6 Boolean Variables 161 frame_demo.py, 628–629 rectangle.py, 288
3.7 Turtle Graphics: Determining the State of the Turtle 162 function_demo.py, 235–236 rectangular_pattern.py, 260–261
Review Questions 170 gcd.py, 609–610 repetition_operator.py, 450–451
Programming Exercises 173 generate_login.py, 439–440 retail_no_validation.py, 210
geometry.py, 288–290 retail_with_validation.py, 211
global1.py, 257–258 return_list.py, 390–391
global2.py, 258 sale_price.py, 77–78, 275–276
7
Index 735 8 Contents
Priming reads, 208, 330 assembly, 37 Chapter 4 Repetition Structures 181

print function BASIC, 39 4.1 Introduction to Repetition Structures 181
ending newline suppression, 87–88 C/C++, 39
4.2 The while Loop: A Condition-Controlled Loop 182
multiple item display with, 67 COBOL, 39
output display with, 58–61 FORTRAN, 39 4.3 The for Loop: A Count-Controlled Loop 190
Private methods, 514 high-level, 38–39 4.4 Calculating a Running Total 201
Problem domain Java, 39 4.5 Sentinels 204
defined, 556 JavaScript, 39 4.6 Input Validation Loops 207
nouns/noun phrases in, 556–557 low-level, 38 4.7 Nested Loops 212
writing description of, 556–557 Pascal, 39 4.8 Turtle Graphics: Using Loops to Draw Designs 219
Problem solving Ruby, 39
base case, 603 Visual Basic, 39
with loops, 602 Programs Programming Exercises 225
with recursion, 602–606 assembly language, 37
recursive case, 603 compiling, 40–41 Chapter 5 Functions 231
Procedural programming copied into main memory, 36–37 5.1 Introduction to Functions 231
defined, 511 defined, 23 5.2 Defining and Calling a Void Function 234
focus of, 511 execution, pausing, 244 5.3 Designing a Program to Use Functions 239
vs. object-oriented programming, 512 flowcharting, with functions, 239–240 5.4 Local Variables 245
Procedures, 395, 511–512 functioning of, 34–41
5.5 Passing Arguments to Functions 247
Processing files, 315 image editing, 24
Processing lists, 386–398 menu driven, 290
5.6 Global Variables and Global Constants 257
an argument to function, 389–390 modularized, 232–233 5.7 Introduction to Value-Returning Functions: Generating
average of values in, 388–389 running, 25, 690–691 Random Numbers 261
and files, 395–398 saving, 690 5.8 Writing Your Own Value-Returning Functions 272
from function, returning, 400–392 storage, 36 5.9 The math Module 283
total of values in, 398 testing, 42 5.10 Storing Functions in Modules 286
Processing symbols, 56 transfer, control of, 238
5.11 Turtle Graphics: Modularizing Code with Functions 290
Program design, 53–57 utility, 28
in development cycle, 53–54 word processing, 24, 27, 29 Review Questions 297
flowcharts, 56–57, 239–240 writing in IDLE editor, 45, 687–688 Programming Exercises 302
with functions, 239–244 Programs (examples in this book)
hierarchy charts, 241 account_demo.py, 586–587 Chapter 6 Files and Exceptions 309
with for loops, 240–242 accounts.py, 584, 585 6.1 Introduction to File Input and Output 309
pseudocode, 56 account_test.py, 528–529 6.2 Using Loops to Process Files 326
steps, 53–54 account_test2.py, 531–532 6.3 Processing Records 333
task breakdown, 54–55 acme_dryer.py, 243–244
6.4 Exceptions 346
top-down, 240–241 add_coffee_record.py, 337–338
with while loops, 187–189 animals.py, 588–589, 590
Program development cycle, 53–54 auto_repair_payroll.py, 142 Programming Exercises 362
Programmers average_list.py, 389
comments, 61–62 bad_local.py, 245 Chapter 7 Lists and Tuples 365
customer interview, 55 bankaccount.py, 527 7.1 Sequences 365
defined, 23 bankaccount2.py, 530–531 7.2 Introduction to Lists 365
task breakdown, 55 barista_pay.py, 386–387 7.3 List Slicing 373
task understanding, 55 birds.py, 246–247
7.4 Finding Items in Lists with the in Operator 376
Programming birthdays.py, 478–483
7.5 List Methods and Useful Built-in Functions 377
GUI, 619–679 button_demo.py, 630–631
in machine language, 37–38 card_dealer.py, 475–477 7.6 Copying Lists 384
object-oriented (OOP), 511–572 car_demo.py, 578–579 7.7 Processing Lists 386
procedural, 511–512 car.py, 563 7.8 Two-Dimensional Lists 398
with Python language, 23–24 car_truck_suv_demo.py, 581–582 7.9 Tuples 402
Programming languages, 39, 619–679. cell_phone_list.py, 538–540 7.10 Plotting List Data with the matplotlib Package 405
See also Python cellphone.py, 535–536
Ada, 39 cell_phone_test.py, 535–537
Programming Exercises 424
Contents 9 734 Index
Chapter 8 More About Strings 429 not operator, 155, 157 multiplication (*), 76, 79, 367
8.1 Basic String Operations 429 Nouns, list refining, 557–560 not in. See Not in operator
8.2 String Slicing 437 Numbers or, 155–157, 159, 160
advanced storage, 34 precedence, 79
8.3 Testing, Searching, and Manipulating Strings 441
binary, 31–32 relational, 133–134, 145–146
Review Questions 453 factorial of, 603–605 remainder (%), 76, 79, 82–83
Programming Exercises 456 Fibonacci, 607–609 repetition (*), 367, 450–451
floating-point, 33, 94 subtraction (−), 76, 79
Chapter 9 Dictionaries and Sets 461 formatting, 90–91 Optical devices, 28
9.1 Dictionaries 461 pseudorandom, 270–271 or operator, 155–157, 159, 160
9.2 Sets 484 random, 262–271 Output
9.3 Serializing Objects 496 running totals, 201–204 in computer program process, 57–58
storage, 31–33 data, 87–95
Numeric literals, 69 defined, 28
Programming Exercises 507 Numeric ranges, with logical operators, 160 displaying, 58–61
Output devices, 28
Chapter 10 Classes and Object-Oriented Programming 511 Output files, 310, 311, 315, 322, 326
10.1 Procedural and Object-Oriented Programming 511 O
Overhead, 602
Object-oriented programming (OOP)
10.2 Classes 515 class design, 554–565
Overriding, method, 588
10.3 Working with Instances 532 classes, 515–532
10.4 Techniques for Designing Classes 554 data hiding, 512
P
pack method, 625–627, 629, 634
Review Questions 565 defined, 512
Parameter lists, 252
Programming Exercises 568 encapsulation, 512
Parentheses, grouping with, 80
instances, 515, 532–554
Pascal, 39
Chapter 11 Inheritance 573 Objects, 629. See also Classes
Passing arguments. See also Arguments
11.1 Introduction to Inheritance 573 characteristics description, 515
to function, 248–251
11.2 Polymorphism 588 defined, 512
function parameter variable, 253–255
dictionary, 461–484
Review Questions 594 to index method, 379–381
everyday example of, 513–514
Programming Exercises 596 list as function, 389–390
exception, 359 multiple, 251–253
file, 316–317 and objects, 540–541
Chapter 12 Recursion 599 list, 365, 366 by position, 252
12.1 Introduction to Recursion 599 “is a” relationship, 574 by value, 255
12.2 Problem Solving with Recursion 602 passing as arguments, 540–541 Passwords, validating characters in, 446–449
12.3 Examples of Recursive Algorithms 606 pickling, 542–544 Pattern printing using nested loops, 215–218
Review Questions 614 reusability, 513 Percentages, calculations, 77–78
Programming Exercises 616 sequence, 365 Pickle module, 497–498, 542, 547
serializing, 496–502 Pickling, 496–498, 500, 542–544
Chapter 13 GUI Programming 619 set, 484–496 pi variable, 285
storing in dictionaries, 544–554 pie chart, plotting, 418–420
13.1 Graphical User Interfaces 619
storing in lists, 538–540 pip utility, 705
13.2 Using the tkinter Module 621 StringVar, 636–637 Pixels, 34
13.3 Display Text with Label Widgets 624 unpickling, 543–544 plot() function, 406–407
13.4 Organizing Widgets with Frames 627 open function, 313, 314, 318 Polymorphism
13.5 Button Widgets and Info Dialog Boxes 630 Operands, 76 behavior, ingredients of, 588
13.6 Getting Input with the Entry Widget 633 Operating systems, 28 defined, 588
Operators isinstance function, 591–594
13.7 Using Labels as Output Fields 636
and, 156–158 popitem method, 473, 477
13.8 Radio Buttons and Check Buttons 644 in. See In operator pop method, 472, 720
13.9 Drawing Shapes with the Canvas Widget 651 addition (+), 76, 79, 90 Positional arguments, 257
Review Questions 673 assignment, 135, 203–204 Precedence, operator, 79
Programming Exercises 676 augmented assignment, 203–204 Predefined names colors, 695–699
exponent (**), 76, 80–82 Pretest loops
logical. See Logical operators defined, 186
math, 75–76 while loops as, 186–187
Logical operators (continued) flash, 28 Appendix A Installing Python 681

expressions with, 155 main memory, 27
not, 155, 157 random access (RAM), 27 Appendix B Introduction to IDLE 685
numeric ranges with, 160 Memory sticks, 28 Appendix C The ASCII Character Set 693
or, 155–157 Menubutton widget, 622
types of, 155 Menu-driven programs, 290 Appendix D Predefined Named Colors 695
Logic errors, 54 Method overriding, 588 Appendix E More About the import Statement 701
Loops Microprocessors, 25–26
for, 190–200, 329–333, 368, 430, 468–469, 471, min function, 383–384 Appendix F Installing Modules with the pip Utility 705
474, 488 Mixed-type expressions, 85–86 Appendix G Answers to Checkpoints 707
condition-controlled, 182–190 Mnemonics, 37
count-controlled, 190–200 Modification methods, 444–445 Index 725
end of files and, 500–501 Modifying records, 341–342 Credits 743
in turtle graphics, 219–222 Modularization, 286
infinite, 189 Modularized programs, 232–233
input validation, 251–256 Modules
iteration, 189, 198, 205 benefits of, 286
nested, 212–218, 401 defined, 262, 286
pretest, 186–187 function, 277–280
priming read, 208 importing, 287
recursion versus, 613 math, 283–285
sentinels and, 204–206 pickle, 497
validation, 282 random, 263, 266, 269
while, 182–190 rectangle, 287–288
lower() method, 444–445 storing classes in, 525–527
Low-level languages, 38 storing functions in, 286–290
lstrip() method, 444 tkinter, 621–624
using, 287
M Modulus operator. See Remainder (%) operator
Machine language, 34–38, 40–41, 54 Multiple assignment, 473
Main memory Multiple items
defined, 27 displaying with + operator, 90
programs copied into, 36–37 displaying with print function, 67
Mammal class, 588–590 separating, 88–89
Math expressions Multiplication (*) operator, 76, 79, 367
algebraic, 83–84 Mutable, lists as, 369–371
defined, 75 Mutator methods, 537
list elements in, 386–387
mixed-type, 85–86 N
operands, 76 Named constant, 95–96
parentheses, grouping with, 80–81 Negative indexes, 368, 375, 433, 438
randint function in, 263–264 Nested blocks, 150–151
simplifying with value-returning functions, 272–276 Nested decision structures, 149–154
Math module, 283–286 Nested function calls, 74
Math operators Nested lists. See Two-dimensional lists
defined, 75 Nested loops, 212–218, 401. See also Loops
list of, 76 Newline (\n) character
matplotlib package, 405–420 concatenating to a string, 319–320
bar chart, plotting, 414–418 stripping from string, 320–322, 396
line graph, plotting, 406–413 suppressing, 87–88
pie chart, plotting, 418–420 not in operator
pyplot module, 405 in list item determination, 377
max function, 383–384 testing dictionary values with, 463–464
Memory testing set values with, 488–489
buffer, 315 testing strings with, 441
732 Index
isinstance function, 591–594 Listbox widget, 622

islower() method, 442 list() function, 366–367, 404
LOCATION OF VIDEONOTES IN THE TEXT isspace() method, 442 Lists
VideoNote
issubset method, 492 accepting as an argument, 383, 384
Chapter 1 Using Interactive Mode in IDLE, p. 45 issuperset method, 492 append method and, 377–379
Performing Exercise 2, p. 50 isupper() method, 442 concatenating, 371–372
item separators, 88–89 contents, displaying, 401
Chapter 2 The print Function, p. 58 items method, 470–471 converting iterable objects to, 366–367
Reading Input from the Keyboard, p. 71 Iterable, 192–193, 200, 217–218, 366–367 converting to tuples, 404
Introduction to Turtle Graphics, p. 97 Iteration, loop, 189, 192 copying, 384–386
The Sales Prediction Problem, p. 126 nested loops, 217–218 defined, 234, 365, 366
and sentinel, 205 of different types, 366
Chapter 3 The if Statement, p. 131 user control, 198–200 displaying, 366
The if-else Statement, p. 140 as dynamic structures, 365
J elements, 366
The Areas of Rectangles Problem, p. 173 Java, 39 finding items in, 376–377
Chapter 4 The while Loop, p. 182 JavaScript, 39 indexing, 368–369
index method and, 379–381
The for Loop, p. 190 K insert method and, 381
The Bug Collector Problem, p. 225 Keyboard, reading input from, 71–75 of integers, 266
KeyError exceptions, 463, 465, 487, 488 items, adding, 377–379
Chapter 5 De ning and Calling a Function, p. 234 Keys. See also Dictionaries items, in math expressions, 386–387
Passing Arguments to a Function, p. 247 defined, 461 items, inserting, 381
Writing a Value-Returning Function, p. 272 dictionary views and, 470–471 items, removing, 382–383
The Kilometer Converter Problem, p. 302 different types of, 467 items, reversing order of, 383
The Feet to Inches Problem, p. 303 duplicate, 464 items, sorting, 381–382
string, 462 iterating with for loop, 368
Chapter 6 Using Loops to Process Files, p. 326 types of, 462 as mutable, 369–371
File Display, p. 362 keys method, 471, 484 passing as argument to functions,
Key-value pairs 389–390
Chapter 7 List Slicing, p. 373 adding, 464 processing, 386–398
The Lottery Number Generator Problem, p. 424 defined, 461 recursion, 606–607
deleting, 465 remove method and, 382–383
Chapter 8 The Vowels and Consonants problem, p. 457 as mappings, 462 returning from functions, 390–392
removing, 472, 473 reverse method and, 383
Chapter 9 Introduction to Dictionaries, p. 461 returning, 473 slicing, 373–376
Introduction to Sets, p. 484 Keyword arguments, 255–257 sort method and, 381–382
The Capital Quiz Problem, p. 508 Key words, 38–39, 54, 65, 234–235, 287 storing objects in, 538–540
of strings, 366
Chapter 10 Classes and Objects, p. 515 L tuples versus, 402
The Pet class, p. 568 Label widget two-dimensional, 398–402
creating, 629 values, totaling, 388
Chapter 11 The Person and Customer Classes, p. 597 defined, 622 working with, 395–398
as output fields, 636–640 writing to files, 397
Chapter 12 The Recursive Multiplication Problem, p. 616 pack method, 625 Literals
stacked, 626 numeric, 69
Chapter 13 Creating a Simple GUI application, p. 624 text display with, 624–627 string literals, 59–60, 67, 89–90, 195,
Responding to Button Clicks, p. 630 Latin Subset of Unicode, 693 314, 319, 430, 441
The Name and Address Problem, p. 676 len function, 369, 434, 465–466 load function, 497, 498
Library functions, 261–263 Local variables, 245–247, 254, 283, 602. See also
Appendix B Introduction to IDLE, p. 685 Line graph Functions; Variables
adding title/axis labels/grid, 407–408 log() function, 285
data points, displaying markers at, 412–413 Logical operators
plotting, 406–413 and, 156–158
X/Y axis, customizing, 408–412 defined, 155
Index 731
I searching list items with, 376–377

IDLE. See Integrated development environment testing dictionary values with, 463–464
if-elif-else statement, 153–154. See also testing set values with, 488–489
Decision structures testing strings with, 441
if-else statement. See also Decision structures Input
conditional execution in, 141 in computer program process, 57–58
defined, 139 defined, 28
general format, 140 with Entry widget, 633–636
indentation, 141 flowchart symbols, 56
nested, 154, 158 reading from keyboard, 71–75
use of, 141–142 Input devices, 28
if statement, 131. See also Decision structures Input files, 310–311
Boolean expression testing, 133–136 input function, 71–74
execution, 131 Input validation loops, 207–211. See also Loops
general format, 131 insert method, 381
nested blocks, 138–139 Instances, working with, 532–554
use example, 136–138 Instructions, 35–37
use of, 138–139 Instruction sets, 35, 37
import statement, 262–263, 266, 701–703
Integer division, 76, 78–79
Integers
and alias, 703
formatting, 94–95
wildcard, 702
list of, 366
import turtle statement, 97
randint function return, 268
Indentation
randrange function return, 270
IDLE, automatic, 689–690
Integrated development environment (IDLE), 46
IDLE, default, 690
automatic indentation, 689–690
if-else statement, 141
color coding, 689
nested decision structures, 150
defined, 45
in Python, 238–239
indentation, 238–239 This page intentionally left blank
IndexError exception, 368–370, 433. See also
Python Shell window, 685–687, 689, 690–691
Exceptions
resources, 692
Indexes
running programs in, 690–691
characters, 432
saving programs in, 690
defined, 368
shell window, 686
invalid, 375, 378, 433, 438
software bundling, 685
with lists, 369–370
starting, 685–687
negative, 368, 375, 378, 433, 438 statement execution, 686
position reference, 375, 438 text editor, 45
in slicing expression, 374 tkinter module, 621
string, 432–433 writing Python programs in, 687–688
tuples support, 403 Interactive mode, 43–45, 58, 69, 75, 88, 91, 134,
index method, 379–381 266–267, 371–372, 375
Indirect recursion, 606 Interpreters
Infinite loops, 189 defined, 40
Info dialog boxes, 630–631, 633, 636–637, high-level program execution, 41
647–648 Python, 42
Inheritance intersection method, 490
defined, 573 Intersection of sets, 490
generalization and, 573 int() function, 73–75
and “is a” relationship, 574–582 IntVar class, 645
specialization and, 573 IOError exceptions, 351–352, 354, 358
in UML diagrams, 582–583 IPO charts, 76–277
using, 583–587 isalnum() method, 442
Initializer methods, 518 isalpha() method, 442
in operator isdigit() method, 442
general format, 376 is_even function, 281
730 Index
Formatting recursive. See Recursive functions

with comma separators, 92–93 set, 485
floating-point number as percentage, 94 showinfo, 630
integers, 94–95 sin(), 285
numbers, 90–91 sqrt(), 285
in scientific notation, 92 sum, 273–274
for statement, 190 tan(), 285
FORTRAN, 39 type, 69
Preface Frame widget, 622, 629

Function call
defined, 235
value-returning. See Value-returning
functions
examples of, 236, 237 G

in flowcharts, 240 GCD (greatest common divisor),
nested, 74 609–610
Welcome to Starting Out with Python, Fourth Edition. This book uses the Python language process, 235–238 Generalization, 573–574
recursive, 602 get method, 470, 550, 633–634, 636,
to teach programming concepts and problem-solving skills, without assuming any previous 639, 647
Function definitions
programming experience. With easy-to-understand examples, pseudocode, flowcharts, and block, 236 Getters, 537
other tools, the student learns how to design the logic of programs and then implement those defined, 234 Global constants, 401
programs using Python. This book is ideal for an introductory programming course or a function header, 234 defined, 259
programming logic and design course using Python as the language. general format, 234–235 using, 259–261
Function headers, 234, 238, 248, 252 Global variables. See also Variables
As with all the books in the Starting Out with series, the hallmark of this text is its clear, Functions, 383–384 accessing, 257
friendly, and easy-to-understand writing. In addition, it is rich in example programs that acos(), 285 creating, 258
asin(), 285 debugging and, 258–259
are concise and practical. The programs in this book include short examples that highlight
atan(), 285 defined, 257
specific programming topics, as well as more involved examples that focus on problem solv- Boolean. See Boolean functions examples of, 257–258
ing. Each chapter provides one or more case studies that provide step-by-step analysis of a callback. See Callback functions functions using, 259
specific problem and shows the student how to solve it. calling. See Calling functions program understanding and, 259
ceil(), 285 use restriction, 258–259
Control Structures First, Then Classes cos(), 285 Greatest common divisor (GCD), 609–610
GUI programs
degrees(), 285
Python is a fully object-oriented programming language, but students do not have to understand exp(), 285 Button widgets, 630–633
object-oriented concepts to start programming in Python. This text first introduces the student factorial, 604–605 check buttons, 648–650
float(), 73, 74, 75, 86 creating, 621–624, 640
to the fundamentals of data storage, input and output, control structures, functions, sequences Entry widget, 633–636
floor(), 285
and lists, file I/O, and objects that are created from standard library classes. Then the student format, 91, 94 as event-driven, 621
learns to write classes, explores the topics of inheritance and polymorphism, and learns to write hypot(), 285 fields, 636–640
recursive functions. Finally, the student learns to develop simple event-driven GUI applications. importing, 701–702 getting input with, 633–636
input, 71–74 info dialog boxes, 630–633
Label widgets, 624–627
Changes in the Fourth Edition int(), 73–75
is_even, 281 radio buttons, 644–647
This book’s clear writing style remains the same as in the previous edition. However, many isinstance, 591–594 sketch of window, 640–641
len, 369, 434, 465–466 text display, 624–627
additions and improvements have been made, which are summarized here:
library, 261–263 with tkinter module, 621–624
● New sections on the Python Turtle Graphics library have been added to Chapters 2 list(), 366–367, 404 widget list, 641
through 5. The Turtle Graphics library, which is a standard part of Python, is a fun load, 497, 498 widget organization, 627–630
log(), 285
and motivating way to introduce programming concepts to students who have never
message, 235–240, 599–601 H
written code before. The library allows the student to write Python statements that min, 383–384 Hardware, 24–29
draw graphics by moving a cursor on a canvas. The new sections that have been added open, 313, 314, 318 components, 24–25
to this edition are: print. See print function defined, 24
o Chapter 2: Introduction to Turtle Graphics radians(), 285 Hierarchy charts, 241–242, 250. See also
o Chapter 3: Determining the State of the Turtle randint, 263–266, 268 Program design
range. See range function High-level programming languages, 38–40
o Chapter 4: Using Loops to Draw Designs
range_sum, 606–607 hypot() function, 285
o Chapter 5: Modularizing Turtle Graphics Code with Functions
13
Index 729 14 Preface
Error handlers, 209 defined, 607–608 The new Turtle Graphics sections are designed with flexibility in mind. They can be
Error messages, 41, 44 recursive function calculation, 608–609 assigned as optional material, incorporated into your existing syllabus, or skipped
default, displaying, 355–356 Field widths
altogether.
loop displaying, 208–209 columns, 93
traceback, 349, 351 minimum, specifying, 93–94 ● Chapter 2 has a new section on named constants. Although Python does not support
Errors. See Exceptions File modes, 317 true constants, you can create variable names that symbolize values that should not
Error traps, 209 Filename extensions, 312
change as the program executes. This section teaches the student to avoid the use
Escape characters, 89–90 File objects
Event handlers, callback functions as, 630 close method, 315, 497 of “magic numbers,” and to create symbolic names that make his or her code more
Exception handling defined, 312 self-documenting and easier to maintain.
defined, 352 read method, 316–319 ● Chapter 7 has a new section on using the matplotlib package to plot charts and graphs
multiple exceptions, 352–355 variable name referencing, 312–314 from lists. The new section describes how to install the matplotlib package, and use it to
with try/except statement, 357–358 writelines method, 395–398
plot line graphs, bar charts, and pie charts.
Exception objects, 359 write method, 314
Exceptions finally clause, with try/except statement, 358
● Chapter 13 has a new section on creating graphics in a GUI application with the
catching all, with one except clause, 354–355 Finally suite, 358 Canvas widget. The new section describes how to use the Canvas widget to draw lines,
code response to, 348 find method, 446 rectangles, ovals, arcs, polygons, and text.
default error message display, 355–356 Flags, 162 ● Several new, more challenging, programming problems have been added throughout
defined, 75, 346 Flash drives, 28 the book.
IndexError, 368–369, 433 Flash memory, 28
IOError, 351–352, 354, 358 float data type, 69, 85–86
● Appendix E is a new appendix that discusses the various forms of the import statement.
KeyError, 463, 465, 487 float() function, 73, 74, 75, 86
● Appendix F is a new appendix that discusses installing third-party modules with the
multiple, 352–354 Floating-point division, 78, 79 pip utility.
unhandled, 358–359 Floating-point notation, 33
ValueError, 349–350, 354, 355, Floating-point numbers, 94
356, 358, 382 floor() function, 285 Brief Overview of Each Chapter
ZeroDivisionError, 358 Floppy disk drives, 27
Execution, 223 Flowchart, 56
in fetch-decode-execute cycle, 36 clock simulator, 213
Chapter 1: Introduction to Computers and Programming
pausing, 244 decision structure, 132, 133, 137 This chapter begins by giving a very concrete and easy-to-understand explanation of how
Python interpreter, 686–687 dual alternative decision structure, 130
computers work, how data is stored and manipulated, and why we write programs in high-
try/except statement, 349 input validation loop, 208
while loop, 209 logic for file end detection, 328 level languages. An introduction to Python, interactive mode, script mode, and the IDLE
Exercises nested decision structure, 149, 152 environment are also given.
decision structures, 173–179 pay calculating program, 57
dictionaries and sets, 507–510 program development cycle, 53
files and exceptions, 366–368 running total calculation, 201 Chapter 2: Input, Processing, and Output
functions, 302–308 sequence structure nested inside decision
This chapter introduces the program development cycle, variables, data types, and simple
GUI programming, 676–679 structure, 148
inheritance, 596–597 sequence structures with decision structure, 147–148 programs that are written as sequence structures. The student learns to write simple pro-
input, processing, and output, 126–130 while loop, 183 grams that read input from the keyboard, perform mathematical operations, and produce
introduction, 50–51 Font class, 670–672 screen output. Pseudocode and flowcharts are also introduced as tools for designing pro-
lists and tuples, 424–428 keyword arguments for, 671 grams. The chapter also includes an optional introduction to the turtle graphics library.
programming, 568–572 for loops. See also Loops
recursion, 616–617 as count-controlled loops, 190–200
repetition structures, 265–267 defined, 190–191 Chapter 3: Decision Structures and Boolean Logic
strings, 456–460 in turtle graphics, 219
exp() function, 285 iterating lists with, 368 In this chapter, the student learns about relational operators and Boolean expressions and is
Exponent (**) operator, 76, 80–82 iterating over dictionaries with, 468–469 shown how to control the flow of a program with decision structures. The if, if-else, and
iterating over list of strings with, 192 if-elif-else statements are covered. Nested decision structures and logical operators are
F iterating over sets, 488
discussed as well. The chapter also includes an optional turtle graphics section, with a discus-
Factorial function, 604–605 iterations, 198–200
Factorials iterations, user control, 198–200 sion of how to use decision structures to test the state of the turtle.
calculation with recursion, 602–606 range function with, 190–194
definition rules, 606, 609 target variables, 194–198
Fetch-decode-execute cycle, 36–37 format function, 91, 94
Chapter 4: Repetition Structures
Fibonacci series Format specifiers, 91–94 This chapter shows the student how to create repetition structures using the while loop and
for loop. Counters, accumulators, running totals, and sentinels are discussed, as well as
Preface 15 728 Index
techniques for writing input validation loops. The chapter also includes an optional section create_polygon method, 665–667 defined, 461
on using loops to draw designs with the turtle graphics library. optional arguments to, 667 elements, adding, 464
create_rectangle method, 655–657 elements, deleting, 465, 469
optional arguments to, 657 elements, display order, 462
Chapter 5: Functions create_text method, 667–672 elements, number of, 465–466
optional arguments to, 669 empty, creating, 467–468
In this chapter, the student first learns how to write and call void functions. The chapter C# programming language, 39 example, 474–477, 477–483
shows the benefits of using functions to modularize programs and discusses the top-down Customer class, 561–562 iteration, 468–469
design approach. Then, the student learns to pass arguments to functions. Common library keys, 461, 462
functions, such as those for generating random numbers, are discussed. After learning how D key-value pairs, 461, 464
Data methods, 469–474
to call library functions and use their return value, the student learns to define and call his mixing data types in, 466–467
appending to files, 322
or her own functions. Then the student learns how to use modules to organize functions. An binary file, 311 parts of, 461
optional section includes a discussion of modularizing turtle graphics code with functions. digital, 34 retrieving value from, 462–463
hiding, 512 storing objects in, 544–554
output, 87–95 values, 463–464
Chapter 6: Files and Exceptions processing, 333–346 Dictionary views
reading from files, 310–311, 316–319 defined, 470
This chapter introduces sequential file input and output. The student learns to read and write
text file, 311 elements, 470
large sets of data and store data as fields and records. The chapter concludes by discussing keys returned as, 471
writing to files, 310, 314–316
exceptions and shows the student how to write exception-handling code. Data attributes, 512 values returned as, 473–474
hidden, 513 dict() method, 468
hiding, 522–525 difference method, 490–491
Chapter 7: Lists and Tuples Digital data, 34
initializing, 518
This chapter introduces the student to the concept of a sequence in Python and explores the instance, 532–554 Digital devices, 34
Data storage, 29–33 Direct access files, 312, 343, 346
use of two common Python sequences: lists and tuples. The student learns to use lists for
characters, 33 Direct recursion, 606
arraylike operations, such as storing objects in a list, iterating over a list, searching for items music, 34 discard method, 487
in a list, and calculating the sum and average of items in a list. The chapter discusses slic- Data types Disk drives
ing and many of the list methods. One- and two-dimensional lists are covered. The chapter bool, 161 defined, 27
also includes a discussion of the matplotlib package, and how to use it to plot charts and conversion and mixed-type expressions, 85–86 program storage on, 36
graphs from lists. and literals, 68–69 Divide and conquer approach, 232
mixing, 466–467 Division
str, 69–70 floating-point, 78
Chapter 8: More About Strings Debugging, 54, 154 integer, 76, 78
global variables and, 258–259 / operator, 76, 78, 79
In this chapter, the student learns to process strings at a detailed level. String slicing and Decision structures, 132 Dog class, 589–590
algorithms that step through the individual characters in a string are discussed, and several actions performed in, 132–133 Dot notation, 263, 285
built-in functions and string methods for character and text processing are introduced. combining sequence structures with, 147–148 Dual alternative decision structure,
dual alternative, 140 139–140
in flowcharts, 132 dump method, 497
Chapter 9: Dictionaries and Sets if-elif-else statement, 153–154 DVD drives, 28
if-else statement, 140–143 DVDs (digital versatile discs), 28
This chapter introduces the dictionary and set data structures. The student learns to store data if statement, 131–139
as key-value pairs in dictionaries, search for values, change existing values, add new key-value inside, 148 E
pairs, and delete key-value pairs. The student learns to store values as unique elements in sets nested, 147–155 else clause, 143, 150
and perform common set operations such as union, intersection, di erence, and symmetric single alternative, 132 execution, 140
degrees() function, 285 with try/except statement, 357–358
di erence. The chapter concludes with a discussion of object serialization and introduces the
del statement, 383 else suite, 357
student to the Python pickle module. Depth of recursion, 602 Encapsulation, 512
Derived classes, 574 end–of–file, 500–501, 543
Chapter 10: Classes and Object-Oriented Programming Dialog boxes endswith method, 445, 446
defined, 619 ENIAC computer, 25, 26
This chapter compares procedural and object-oriented programming practices. It covers the illustrated, 620–621 Entry widget
fundamental concepts of classes and objects. Attributes, methods, encapsulation and data info, 630–633 defined, 622, 633
Dictionaries getting input with, 633–636
hiding, _ _init_ _ functions (which are similar to constructors), accessors, and mutators are
creating, 462 use example, 634–636
discussed. The student learns how to model classes with UML and how to find the classes
in a particular problem.
CD drives, 28 in modules, storing, 525–527 Chapter 11: Inheritance

CDs (compact discs), 28 polymorphism, 588–594
ceil() function, 285 Radiobutton, 644–647 The study of classes continues in this chapter with the subjects of inheritance and polymor-
Central processing unit (CPU) responsibilities, identifying, 560–565 phism. The topics covered include superclasses, subclasses, how _ _init_ _ functions work in
as computer’s brain, 35 SavingsAccount, 584, 585 inheritance, method overriding, and polymorphism.
defined, 25 ServiceQuote, 563–565
fetch-decode-execute cycle, 36–37 SUV, 575, 580–582
instruction set, 35 Truck, 579–582 Chapter 12: Recursion
microprocessor, 25–26 UML layout, 555
operations, 35 Code This chapter discusses recursion and its use in problem solving. A visual trace of recursive calls
change_me function, 253–255 debugging, 154 is provided, and recursive applications are discussed. Recursive algorithms for many tasks are
Characters defined, 41 presented, such as finding factorials, finding a greatest common denominator (GCD), and sum-
encoding schemes, 33–34 modularized program, 232
escape, 89–90 responding to exceptions, 352–354
ming a range of values in a list, and the classic Towers of Hanoi example are presented.
extraction from string, 438–440 validation, 282
individual, 430–434 Colors, predefined names, 695–699
Chapter 13: GUI Programming
line continuation, 86 Command line interfaces, 619–621
newline, 88, 396 Comments This chapter discusses the basic aspects of designing a GUI application using the tkinter
in password, validating, 446–449 defined, 61
module in Python. Fundamental widgets, such as labels, buttons, entry fields, radio buttons,
selecting range of, 437–438 end-line, 61–62
space, 73 importance of, 62 check buttons, and dialog boxes, are covered. The student also learns how events work in a
storage, 33 Compilers, 40–41 GUI application and how to write callback functions to handle events. The chapter includes
string, accessing, 430–434 Computers a discussion of the Canvas widget, and how to use it to draw lines, rectangles, ovals, arcs,
whitespace, 442, 444 components, 24–29 polygons, and text.
Character sets, ASCII, 693 CPU, 25–26
Charts, IPO, 276–277 data storage, 29–34
Checkbuttons, 622, 648–650 ENIAC, 25, 26 Appendix A: Installing Python
Checkbutton widget input devices, 28
creating, 648 main memory, 27 This appendix explains how to download and install the Python 3 interpreter.
defined, 622 output devices, 28
use example, 648–650 secondary storage devices, 27–28
Class definitions user interface, 619 Appendix B: Introduction to IDLE
Coin example, 517–523 Concatenation
This appendix gives an overview of the IDLE integrated development environment that comes
organization, 525 list, 371–372 with Python.
Classes. See also Instances newline to string, 319–325
Automobile, 575–580 += operator in, 372, 435
BankAccount, 527–532 string, 90, 434–435
Appendix C: The ASCII Character Set
base, 574 Conditional execution As a reference, this appendix lists the ASCII character set.
Car, 562–563, 577–579 if-else statement, 141
Cat, 590 Condition-controlled loops. See also Loops
CD, 585 defined, 182, 218 Appendix D: Predefined Named Colors
CellPhone, 535–537 while loop, 182–190
Checkbutton, 648–650 Contact class example, 544–554 This appendix lists the predefined color names that can be used with the turtle graphics
Coin, 517–523 Continuation character, 86 library, matplotlib and tkinter.
concept of, 515 Control structures, 131, 147
Contact, 544–554 Cookies, 310, 516
cookie cutter metaphor, 516 Copying lists, 384–386 Appendix E: More About the import Statement
Customer, 561–562 cos() function, 285
defined, 515 Count-controlled loops, 182, 190–200. This appendix discusses various ways to use the import statement. For example, you can use
derived, 574 See also Loops the import statement to import a module, a class, a function, or to assign an alias to a module.
designing, 554–565 create_arc method, 660–665
Dog, 589–590 optional arguments to, 662
finding, in problems, 555–560 create_line method, 653–655 Appendix F: Installing Modules with the pip Utility
inheritance, 573–594 optional arguments to, 655
IntVar, 645 create_oval method, 658–660 This appendix discusses how to use the pip utility to install third-party modules from the
Mammal, 588–590 optional arguments to, 659 Python Package Index, or PyPI.
Appendix G: Answers to Checkpoints append method nested, 150–151

defined, 377–378 statement format, 235
This appendix gives the answers to the Checkpoint questions that appear throughout the text. use example, 378–379 bool data type, 161
Append mode, 322 Boolean expressions
Application software, 29 defined, 133–134
Organization of the Text Arguments if statement testing, 133
defined, 247 with input validation loops, 207
The text teaches programming in a step-by-step manner. Each chapter covers a major set of keyword, 255–257 with logical operators, 155
topics and builds knowledge as students progress through the book. Although the chapters passing objects as, 540–541 with relational operators, 133–134
can be easily taught in their existing sequence, you do have some flexibility in the order passing to functions, 247–257 Boolean functions
positional, 257 defined, 281
that you wish to cover them. Figure P-1 shows chapter dependencies. Each box represents
as step values, 193 in validation code, 282
a chapter or a group of chapters. An arrow points from a chapter to the chapter that must Arrays, 367 Boolean values, returning, 281–282
be covered before it. ASCII Boolean variables, 161–162
character set, 33, 693 Buffers, 315
defined, 33 Buttons
Figure P-1 Chapter dependencies in string comparisons, 144–146 check, 648–650
asin () function, 285 Quit, 632–633, 634
Chapters 1-5 Assemblers, 37–38 radio, 644–647
(Cover in Order) Assembly language, 37–38 Button widget
Assignment operators defined, 622
augmented, 203–204 use example, 630–633
== operator versus, 135 Bytes
Assignment statements in data storage, 30
Chapter 6 Chapter 7 Chapter 8 Chapter 12 creating variables with, 62–65 defined, 29
Files and Exceptions Lists and Tuples More About Strings Recursion example, 62 for large numbers, 32
format, 63
multiple assignment, 473 C
atan() function, 285 Calculations
Chapter 9 Attributes. See Data attributes average, 80–81
Dictionaries and Sets Augmented assignment operators, 203–204 math expressions, 75
*The material on object
serialization in Chapters 9 Automobile class, 575–580 math operators, 75, 76
and 10 uses exception handling. Averages percentage, 77–78
calculating, 80–81 performing, 75–87
Chapter 10 list value, 388–389 Callback functions
Classes and Object- defined, 630
Oriented Programming
B as event handlers, 630
BankAccount class example, 527–532 Radiobuttons with, 647
bar chart Calling functions. See also Functions
colors of, 416 defined, 58, 234
Chapter 11 Chapter 13 customizing width, 415–416 examples of, 235
Inheritance GUI Programming plotting, 414–418 general format, 58
Base case, 603, 606, 608, 612 illustrated, 236
Base classes, 574 CamelCase, 66
Features of the Text BASIC, 39
Binary files, 311
Canvas widget, 622, 651–672
create_arc method, 660–665
Concept Each major section of the text starts with a concept Binary numbering system, 31–32 create_line method, 653–655
statement. Bits, 33 create_oval method, 658–660
defined, 30 create_polygon method, 665–667
Statements This statement concisely summarizes the main point of the patterns, 31, 32 create_rectangle method, 655–657
section. Black boxes, library functions as, 262 create_text method, 667–672
Blank lines, in blocks, 239 screen coordinate system, 651–653
Example Programs Each chapter has an abundant number of complete and partial Blocks Car class, 562–563, 577–579
example programs, each designed to highlight the current topic. blank lines, 239 Case-sensitive comparisons, 445
defined, 235 Cat class, 590
In the Spotlight Each chapter has one or more In the Spotlight case studies that indentation, 238–239 CD class, 585
Case Studies provide detailed, step-by-step analysis of problems and show
the student how to solve them.
18 Preface
VideoNotes Online videos developed specifically for this book are available
for viewing at www.pearsonglobaleditions.com/gaddis. Icons appear
throughout the text alerting the student to videos about specific
topics.
Notes Notes appear at several places throughout the text. They are
short explanations of interesting or often misunderstood points
relevant to the topic at hand.
Index Tips Tips advise the student on the best techniques for approaching
di erent programming problems.
Warnings Warnings caution students about programming techniques or
practices that can lead to malfunctioning programs or lost data.
Checkpoints Checkpoints are questions placed at intervals throughout each
chapter. They are designed to query the student’s knowledge
Symbols defined, 134 quickly after learning a new topic.
!= operator in string comparisons, 144
defined, 136 use example, 138 Review Questions Each chapter presents a thorough and diverse set of review
example use, 136, 138 > operator questions and exercises. They include Multiple Choice, True/
" (double-quote marks), 60 defined, 134 False, Algorithm Workbench, and Short Answer.
""" or "' (triple quotes), 60 in string comparisons, 146
# character, 61 use example, 134, 135–136 Programming Each chapter o ers a pool of programming exercises designed
% (remainder) operator >= operator Exercises to solidify the student’s knowledge of the topics currently being
defined, 76, 82 defined, 134 studied.
function of, 281 in superset determination, 492
%= operator, 203 relationship testing, 135
& operator, for intersection of sets, 490 >>> prompt, 43, 44
Supplements
' (single-quote marks), 59–60 ^ operator, 491
* operator _ _init_ _ method, 521, 555, 561, 563, 583 Student Online Resources
multiplication, 76 {}(curly braces), 462
Many student resources are available for this book from the publisher. The following items
repetition, 367
are available at www.pearsonglobaleditions.com/gaddis
** (exponent) operator, 76, 80–82 A
*= operator, 203 Accessor methods, 537 ● The source code for each example program in the book
+ operator acos(x) function, 285 ● Access to the book’s companion VideoNotes
defined, 76 Actions
displaying multiple items with, 90 conditionally executed, 132
in list concatenation, 371 in decision structures, 133 Instructor Resources
+= operator Ada programming language, 39
defined, 203
The following supplements are available to qualified instructors only:
Addition (+) operator
in list concatenation, 372 defined, 76 ● Answers to all of the Review Questions
in string concatenation, 435 displaying multiple items with, 90 ● Solutions for the exercises
− (subtraction) operator, 76 precedence, 79
_ _str_ _ method, 529–532 add method, 486
● PowerPoint presentation slides for each chapter
−= operator, 203 Algebraic expressions, 83–84 ● Test bank
/ (division) operator, 76, 78 Algorithms
// (integer division) operator, 76, 78 defined, 55 Visit the Pearson Instructor Resource Center (www.pearsonglobaleditions.com/gaddis) or
/= operator, 203 example, 55 contact your local Pearson campus representative for information on how to access them.
= operator recursive, 602, 603, 606–613
defined, 134 and operator
in subset determination, 492 defined, 156
relationship testing, 135 false, 158
= (assignment) operator, 135 short-circuit evaluation, 157
== operator truth table, 156
assignment operator versus, 136 Appending data, 322
725
Preface 19 724 Appendix G Answers to Checkpoints
Acknowledgments 13.15 You would use radio buttons.
I would like to thank the following faculty reviewers for their insight, expertise, and thought- 13.16 You would use check buttons.
ful recommendations: 13.17 When you create a group of Radiobuttons, you associate them all with
Sonya Dennis Anita Sutton the same IntVar object. You also assign a unique integer value to each
Morehouse College Germanna Community College Radiobutton widget. When one of the Radiobutton widgets is selected,
it stores its unique integer value in the IntVar object.
Diane Innes Christopher Urban
Sandhills Community College SUNY Institute of Technology 13.18 You associate a different IntVar object with each Checkbutton. When a
Checkbutton is selected, its associated IntVar object will hold the value 1.
John Kinuthia Nanette Veilleux When a Checkbutton is deselected, its associated IntVar object will hold the
Nazareth College of Rochester Simmons College value 0.
Frank Liu Brent Wilson 13.19 (0, 0)
Sam Houston State University George Fox University
13.20 (139, 479)
Haris Ribic
SUNY at Binghamton 13.21 With the Canvas widget, the point (0, 0) is in the upper-left corner of the
window. In turtle graphics, the point (0, 0) is in the center of the window.
Reviewers of Previous Editions Also, with the Canvas widget, the Y coordinates increase as you move down
Paul Amer Shyamal Mitra the screen. In turtle graphics, the Y coordinates decrease as you move down
University of Delaware University of Texas at Austin the screen.
James Atlas Vince O enback 13.22 a) create_oval

University of Delaware North Seattle Community College b) create_rectangle
James Carrier Smiljana Petrovic c) create_rectangle

Guilford Technical Community College Iona College d) create_polygon
e) create_oval
John Cavazos Raymond Pettit
f) create_arc
University of Delaware Abilene Christian University
Desmond K. H. Chun Janet Renwick
Chabot Community College University of Arkansas–Fort Smith
Barbara Goldner Ken Robol
North Seattle Community College Beaufort Community College
Paul Gruhn Eric Sha er
Manchester Community College University of Illinois at Urbana-
Champaign
Bob Husson
Craven Community College Tom Stokke
University of North Dakota
Diane Innes
Sandhills Community College Ann Ford Tyson
Florida State University
Daniel Jinguji
North Seattle Community College Karen Ughetta
Virginia Western Community College
Gary Marrer
Glendale Community College Linda F. Wilson
Texas Lutheran University
Keith Mehl
Chabot College
Appendix G Answers to Checkpoints 723 20 Preface
Chapter 12 I would also like to thank my family and friends for their support in all of my projects.
I am extremely fortunate to have Matt Goldstein as my editor, and Kristy Alaura as edito-
12.1 A recursive algorithm requires multiple method calls. Each method call rial assistant. Their guidance and encouragement make it a pleasure to write chapters and
requires several actions to be performed by the JVM. These actions include meet deadlines. I am also fortunate to have Demetrius Hall as my marketing manager. His
allocating memory for parameters and local variables and storing the address hard work is truly inspiring, and he does a great job of getting this book out to the academic
of the program location where control returns after the method terminates. community. The production team, led by Sandra Rodriguez, worked tirelessly to make this
All these actions are known as overhead. In an iterative algorithm, which book a reality. Thanks to you all!
uses a loop, such overhead is unnecessary.
12.2 A case in which the problem can be solved without recursion Acknowledgments for the Global Edition
12.3 Cases in which the problem is solved using recursion Pearson would like to thank and acknowledge the following for their contributions to the
12.4 When it reaches the base case Global Edition.
12.5 In direct recursion, a recursive method calls itself. In indirect recursion, Contributor
method A calls method B, which in turn calls method A. Gregory Baatard, Edith Cowan University
Kenneth Eustace, Charles Sturt University
Chapter 13 Reviewers
Lindsay Ward, James Cook University
13.1 The part of a computer and its operating system with which the user
Ajay Mittal, University Institute of Engineering and Technology
interacts
Khyat Sharma
13.2 A command line interface typically displays a prompt, and the user types a
command, which is then executed. About the Author
13.3 The program Tony Gaddis is the principal author of the Starting Out with series of textbooks. Tony has
13.4 A program that responds to events that take place, such as the user clicking a nearly two decades of experience teaching computer science courses at Haywood Com-
button munity College. He is a highly acclaimed instructor who was previously selected as the
North Carolina Community College “Teacher of the Year” and has received the Teaching
13.5 a) Label—An area that displays one line of text or an image Excellence award from the National Institute for Sta and Organizational Development.
b) Entry—An area in which the user may type a single line of input from the The Starting Out with series includes introductory books covering C++, Java™, Microsoft®
keyboard Visual Basic®, Microsoft® C#®, Python®, Programming Logic and Design, Alice, and App
c) Button—A button that can cause an action to occur when it is clicked Inventor, all published by Pearson.
d) Frame—A container that can hold other widgets
13.6 You create an instance of the tkinter module’s Tk class.
13.7 This function runs like an infinite loop until you close the main window.
13.8 The pack method arranges a widget in its proper position, and it makes the
widget visible when the main window is displayed.
13.9 One will be stacked on top of the other.
13.10 side=–left—
13.11 You use an Entry widget’s get method to retrieve the data that the user has
typed into the widget.
13.12 It is a string.
13.13 tkinter
13.14 Any value that is stored in the StringVar object will automatically be
displayed in the Label widget.
722 Appendix G Answers to Checkpoints
10.9 By starting the attribute’s name with two underscores

10.10 It returns a string representation of the object.
10.11 By passing the object to the built-in str method
10.12 An attribute that belongs to a specific instance of a class
10.13 10
10.14 A method that returns a value from a class’s attribute but does not change
it is known as an accessor method. A method that stores a value in a data
attribute or changes the value of a data attribute in some other way is known
as a mutator method.
10.15 The top section is where you write the name of the class. The middle section
holds a list of the class’s fields. The bottom section holds a list of the class’s
methods.
10.16 A written description of the real-world objects, parties, and major events
related to the problem
10.17 If you adequately understand the nature of the problem you are trying to
solve, you can write a description of the problem domain yourself. If you do
not thoroughly understand the nature of the problem, you should have an
expert write the description for you.
10.18 First, identify the nouns, pronouns, and pronoun phrases in the problem
domain description. Then, refine the list to eliminate duplicates, items that
you do not need to be concerned with in the problem, items that represent
objects instead of classes, and items that represent simple values that can be
stored in variables.
10.19 The things that the class is responsible for knowing and the actions that the
class is responsible for doing
10.20 In the context of this problem, what must the class know? What must the
class do?
10.21 No, not always
Chapter 11
11.1 A superclass is a general class, and a subclass is a specialized class.
11.2 When one object is a specialized version of another object, there is an “is a”
relationship between them. The specialized object “is a” version of the
general object.
11.3 It inherits all the superclass’s attributes.
11.4 Bird is the superclass, and Canary is the subclass.
11.5 I’m a vegetable.

I’m a potato.
Appendix G Answers to Checkpoints 721
9.25 If the specified element to delete is not in the set, the remove method raises a
KeyError exception, but the discard method does not raise an exception.
9.26 You can use the in operator to test for the element.
9.27 {10, 20, 30, 100, 200, 300}
9.28 {3, 4}
9.29 {1, 2}
9.30 {5, 6}
9.31 {'a', 'd'}
9.32 set2 is a subset of set1, and set1 is a superset of set2.
9.33 The process of converting the object to a stream of bytes that can be saved to
a file for later retrieval.
9.34 'wb'
9.35 'rb'
9.36 The pickle module

9.37 pickle.dump
9.38 pickle.load
This page intentionally left blank

Chapter 10
10.1 An object is a software entity that contains both data and procedures.
10.2 Encapsulation is the combining of data and code into a single object.
10.3 When an object's internal data is hidden from outside code and access to
that data is restricted to the object’s methods, the data is protected from
accidental corruption. In addition, the programming code outside the
object does not need to know about the format or internal structure of
the object’s data.
10.4 Public methods can be accessed by entities outside the object. Private
methods cannot be accessed by entities outside the object. They are designed
to be accessed internally.
10.5 The metaphor of a blueprint represents a class.
10.6 Objects are the cookies.
10.7 Its purpose is to initialize an object’s data attributes. It executes immediately
after the object is created.
10.8 When a method executes, it must have a way of knowing which object’s data
attributes it is supposed to operate on. That’s where the self parameter
comes in. When a method is called, Python automatically makes its self
parameter reference the specific object that the method is supposed to
operate on.
Chapter 9
9.1 Key and value
9.2 The key
9.3 The string 'start' is the key, and the integer 1472 is the value.
Introduction to Computers
CHAPTE R
1
9.4 It stores the key-value pair 'id' : 54321 in the employee dictionary.
and Programming 9.5

9.6
ccc
You can use the in operator to test for a specific key.

9.7 It deletes the element that has the key 654.
9.8 3
TOPICS 9.9 1
1.1 Introduction 1.4 How a Program Works 2
1.2 Hardware and Software 1.5 Using Python 3
1.3 How Computers Store Data 9.10 The pop method accepts a key as an argument, returns the value that is asso-
ciated with that key, and removes that key-value pair from the dictionary.
The popitem method returns a randomly selected key-value pair, as a tuple,
and removes that key-value pair from the dictionary.
9.11 It returns all a dictionary’s keys and their associated values as a sequence of
tuples.
1.1 Introduction
9.12 It returns all the keys in a dictionary as a sequence of tuples.
Think about some of the different ways that people use computers. In school, students
use computers for tasks such as writing papers, searching for articles, sending email, and 9.13 It returns all the values in the dictionary as a sequence of tuples.
participating in online classes. At work, people use computers to analyze data, make pre-
9.14 Unordered
sentations, conduct business transactions, communicate with customers and coworkers,
control machines in manufacturing facilities, and do many other things. At home, people 9.15 No
use computers for tasks such as paying bills, shopping online, communicating with friends
9.16 You call the built-in set function.
and family, and playing games. And don’t forget that cell phones, tablets, smart phones,
car navigation systems, and many other devices are computers too. The uses of computers 9.17 The set will contain these elements (in no particular order): 'J', 'u', 'p',
are almost limitless in our everyday lives. 'i', 't', 'e', and 'r'.
Computers can perform such a wide variety of tasks because they can be programmed. This 9.18 The set will contain one element: 25.
means that computers are not designed to do just one job, but to do any job that their pro-
9.19 The set will contain these elements (in no particular order): 'w', ' ', 'x',
grams tell them to do. A program is a set of instructions that a computer follows to perform
'y', and 'z'.
a task. For example, Figure 1-1 shows screens using Microsoft Word and PowerPoint, two
commonly used programs. 9.20 The set will contain these elements (in no particular order): 1, 2, 3, and 4.
Programs are commonly referred to as software. Software is essential to a computer because 9.21 The set will contain these elements (in no particular order): 'www', 'xxx',
it controls everything the computer does. All of the software that we use to make our com- 'yyy', and 'zzz'.
puters useful is created by individuals working as programmers or software developers. A
9.22 You pass the set as an argument to the len function.
programmer, or software developer, is a person with the training and skills necessary to
design, create, and test computer programs. Computer programming is an exciting and 9.23 The set will contain these elements (in no particular order): 10, 9, 8, 1, 2,
rewarding career. Today, you will find programmers’ work used in business, medicine, gov- and 3.
ernment, law enforcement, agriculture, academics, entertainment, and many other fields. 9.24 The set will contain these elements (in no particular order): 10, 9, 8, 'a',
This book introduces you to the fundamental concepts of computer programming using the 'b', and 'c'.
Python language. The Python language is a good choice for beginners because it is easy to learn
23
Appendix G Answers to Checkpoints 719 24 Chapter 1 Introduction to Computers and Programming
Then, each element in the list will become a slice in the pie chart. The size of Figure 1-1 A word processing program and an image editing program
a slice represents that element’s value as a percentage of the whole.
Chapter 8
8.1 for letter in name:
print(letter)
8.2 0
8.3 9
8.4 An IndexError exception will occur if you try to use an index that is out of
range for a particular string.
8.5 Use the built-in len function.
8.6 The second statement attempts to assign a value to an individual character
in the string. Strings are immutable, however, so the expression animal[0]
cannot appear on the left side of an assignment operator.
8.7 cde and programs can be written quickly using it. Python is also a powerful language, popular with
professional software developers. In fact, it has been reported that Python is used by Google,
8.8 defg NASA, YouTube, various game companies, the New York Stock Exchange, and many others.
8.9 abc Before we begin exploring the concepts of programming, you need to understand a few
8.10 abcdefg basic things about computers and how they work. This chapter will build a solid founda-
tion of knowledge that you will continually rely on as you study computer science. First,
8.11 if 'd' in mystring: we will discuss the physical components of which computers are commonly made. Next, we
print('Yes, it is there.')
will look at how computers store data and execute programs. Finally, you will get a quick
8.12 little = big.upper() introduction to the software that you will use to write Python programs.
8.13 if ch.isdigit():
print('Digit')
else: 1.2 Hardware and Software
print('No digit')
8.14 a A CONCEPT : The physical devices of which a computer is made are referred to as the
computer’s hardware. The programs that run on a computer are referred
8.15 again = input('Do you want to repeat ' + to as software.
'the program or quit? (R/Q) ')
while again.upper() != 'R' and again.upper() != 'Q': Hardware
again = input('Do you want to repeat the ' +
'program or quit? (R/Q) ') The term hardware refers to all of the physical devices, or components, of which a computer
is made. A computer is not one single device, but a system of devices that all work toge-
8.16 $ ther. Like the different instruments in a symphony orchestra, each device in a computer
8.17 for letter in mystring: plays its own part.
if letter.isupper(): If you have ever shopped for a computer, you’ve probably seen sales literature listing compo-
count += 1
nents such as microprocessors, memory, disk drives, video displays, graphics cards, and so on.
8.18 my_list = days.split() Unless you already know a lot about computers, or at least have a friend that does, under-
standing what these different components do might be challenging. As shown in Figure 1-2, a
8.19 my_list = values.split('$')
typical computer system consists of the following major components:
The central processing unit (CPU)
Main memory
1.2 Hardware and Software 25 718 Appendix G Answers to Checkpoints
Figure 1-2 Typical components of a computer system 7.17 You would use statement b, names.append('Wendy'). This is because
element 0 does not exist. If you try to use statement a, an error will occur.
7.18 a) The index method searches for an item in the list and returns the index of
the first element containing that item.
Best Pictures here/

Nikita Rogul/
b) The insert method inserts an item into the list at a specified index.
Shutterstock
Central Processing c) The sort method sorts the items in the list to appear in ascending order.
Shutterstock
Unit
d) The reverse method reverses the order of the items in the list.
iko/Shutterstock
7.19 The list contains 4 rows and 2 columns.
Shutterstock
Feng Yu/Shutterstock
Output
Aquila/ Devices 7.20 mylist = [[0, 0, 0, 0], [0, 0, 0, 0],
[0, 0, 0, 0], [0, 0, 0, 0]]
Chiyacat/
Shutterstock 7.21 for r in range(4):
Peter Guess/
Shutterstock
for c in range(2):
Input
Devices
print(numbers[r][c])
jocic/Shutterstock
7.22 The primary difference between tuples and lists is that tuples are immutable.
Eikostas/Shutterstock
That means that once a tuple is created, it cannot be changed.
Main Memory
(RAM) 7.23 Here are three reasons:
Lusoimages/Shutterstock
Processing a tuple is faster than processing a list, so tuples are good
tkemot/Shutterstock Secondary
Storage Devices choices when you are processing lots of data and that data will not be
modified.
Tuples are safe. Because you are not allowed to change the contents of a
tuple, you can store data in one and rest assured that it will not be modified
(accidentally or otherwise) by any code in your program.
There are certain operations in Python that require the use of a tuple.
Vitaly Korovin/Shutterstock Andre Nitsievsky/Shutterstock.
7.24 my_tuple = tuple(my_list)
Secondary storage devices 7.25 my_list = list(my_tuple)
Input devices
Output devices 7.26 Two lists: one holding the X coordinates of the data points, and the other
holding the Y coordinates.
Let’s take a closer look at each of these components.
7.27 A line graph
The CPU 7.28 Use the xlabel and ylabel functions.
When a computer is performing the tasks that a program tells it to do, we say that the 7.29 Call the xlim and ylim functions, passing values for the xmin, xmax, ymin,
computer is running or executing the program. The central processing unit, or CPU, is the and ymax keyword arguments.
part of a computer that actually runs programs. The CPU is the most important component
7.30 Call the xticks and yticks functions. You pass two arguments to these
in a computer because without it, the computer could not run software.
functions. The first argument is a list of tick-mark locations, and the second
In the earliest computers, CPUs were huge devices made of electrical and mechanical com- argument is a list of labels to display at the specified locations.
ponents such as vacuum tubes and switches. Figure 1-3 shows such a device. The two
7.31 Two lists: one containing the X coordinates of each bar’s left edge, and
women in the photo are working with the historic ENIAC computer. The ENIAC, which
another containing the heights of each bar, along the Y axis.
is considered by many to be the world’s first programmable electronic computer, was built
in 1945 to calculate artillery ballistic tables for the U.S. Army. This machine, which was 7.32 The bars will be red, blue, red, and blue.
primarily one big CPU, was 8 feet tall, 100 feet long, and weighed 30 tons. 7.33 You pass a list of values as an argument. The pie function will calculate
Today, CPUs are small chips known as microprocessors. Figure 1-4 shows a photo of a lab the sum of the values in the list, then use that sum as the value of the whole.
technician holding a modern microprocessor. In addition to being much smaller than the old
electromechanical CPUs in early computers, microprocessors are also much more powerful.
6.18 You copy all the original file’s records to the temporary file, except for the Figure 1-3 The ENIAC computer
record that is to be deleted. The temporary file then takes the place of the
original file. You delete the original file and rename the temporary file, giving
it the name that the original file had on the computer’s disk.
6.19 An exception is an error that occurs while a program is running. In most
cases, an exception causes a program to abruptly halt.
6.20 The program halts.
6.21 IOError
6.22 ValueError
Chapter 7
7.1 [1, 2, 99, 4, 5]
7.2 [0, 1, 2]
7.3 [10, 10, 10, 10, 10]
7.4 1
courtesy of U.S. Army Historic Computer Images
3
5
7
9
Figure 1-4 A lab technician holds a modern microprocessor
7.5 4

7.7 [1, 2, 3]
[10, 20, 30]
[1, 2, 3, 10, 20, 30]
7.8 [1, 2, 3]
[10, 20, 30, 1, 2, 3]
7.9 [2, 3]
7.10 [2, 3]
7.11 [1]
7.12 [1, 2, 3, 4, 5]
7.13 [3, 4, 5]
7.14 Jasmine's family:

['Jim', 'Jill', 'John', 'Jasmine']
7.15 The remove method searches for and removes an element containing a
Creativa/Shutterstock
specific value. The del statement removes an element at a specific index.
7.16 You can use the built-in min and max functions.
Main Memory has not been converted to text. As a consequence, you cannot view the con-
tents of a binary file with a text editor.
You can think of main memory as the computer’s work area. This is where the computer
stores a program while the program is running, as well as the data that the program is 6.5 Sequential and direct access. When you work with a sequential access file,
working with. For example, suppose you are using a word processing program to write an you access data from the beginning of the file to the end of the file. When
essay for one of your classes. While you do this, both the word processing program and the you work with a direct access file, you can jump directly to any piece of data
essay are stored in main memory. in the file without reading the data that comes before it.
Main memory is commonly known as random-access memory, or RAM. It is called this 6.6 The file’s name on the disk and the name of a variable that references a file
because the CPU is able to quickly access data stored at any random location in RAM. object.
RAM is usually a volatile type of memory that is used only for temporary storage while
6.7 The file’s contents are erased.
a program is running. When the computer is turned off, the contents of RAM are erased.
Inside your computer, RAM is stored in chips, similar to the ones shown in Figure 1-5. 6.8 Opening a file creates a connection between the file and the program. It also
creates an association between the file and a file object.
6.9 Closing a file disconnects the program from the file.
Figure 1-5 Memory chips
6.10 A file’s read position marks the location of the next item that will be read
from the file. When an input file is opened, its read position is initially set to
the first item in the file.
6.11 You open the file in append mode. When you write data to a file in append
mode, the data is written to the end of the file’s existing contents.
Garsya/Shutterstock 6.12 outfile = open('numbers.txt', 'w')
for num in range(1, 11):
outfile.write(str(num) + '\n')
outfile.close()
Secondary Storage Devices
6.13 The readline method returns an empty string ('') when it has attempted to
Secondary storage is a type of memory that can hold data for long periods of time, even
read beyond the end of a file.
when there is no power to the computer. Programs are normally stored in secondary mem-
ory and loaded into main memory as needed. Important data, such as word processing 6.14 infile = open('numbers.txt', 'r')
documents, payroll data, and inventory records, is saved to secondary storage as well. line = infile.readline()
while line != '':
The most common type of secondary storage device is the disk drive. A traditional disk
print(line)
drive stores data by magnetically encoding it onto a spinning circular disk. Solid-state
line = infile.readline()
drives, which store data in solid-state memory, are increasingly becoming popular. A solid-
state drive has no moving parts and operates faster than a traditional disk drive. Most in le.close()
computers have some sort of secondary storage device, either a traditional disk drive or a 6.15 infile = open('data.txt', 'r')
solid-state drive, mounted inside their case. External storage devices, which connect to one for line in infile:
of the computer’s communication ports, are also available. External storage devices can print(line)
be used to create backup copies of important data or to move data to another computer. infile.close()
In addition to external storage devices, many types of devices have been created for copy- 6.16 A record is a complete set of data that describes one item, and a field is a
ing data and for moving it to other computers. For example, USB drives are small devices single piece of data within a record.
that plug into the computer’s USB (universal serial bus) port and appear to the system as
a disk drive. These drives do not actually contain a disk, however. They store data in a 6.17 You copy all the original file's records to the temporary file, but when you
special type of memory known as flash memory. USB drives, which are also known as get to the record that is to be modified, you do not write its old contents
memory sticks and flash drives, are inexpensive, reliable, and small enough to be carried to the temporary file. Instead, you write its new, modified values to the
in your pocket. temporary file. Then, you finish copying any remaining records from the
original file to the temporary file.
be changed during the program’s execution, you do not have to worry about Optical devices such as the CD (compact disc) and the DVD (digital versatile disc) are
its value being altered. also popular for data storage. Data is not recorded magnetically on an optical disc, but is
encoded as a series of pits on the disc surface. CD and DVD drives use a laser to detect
5.21 The difference is that a value returning function returns a value back to the
the pits and thus read the encoded data. Optical discs hold large amounts of data, and
statement that called it. A simple function does not return a value.
for that reason, recordable CD and DVD drives are commonly used for creating backup
5.22 A prewritten function that performs some commonly needed task copies of data.
5.23 The term “black box” is used to describe any mechanism that accepts input,
performs some operation (that cannot be seen) using the input, and produces Input Devices
output.
Input is any data the computer collects from people and from other devices. The compo-
5.24 It assigns a random integer in the range of 1 through 100 to the variable x. nent that collects the data and sends it to the computer is called an input device. Common
5.25 It prints a random integer in the range of 1 through 20. input devices are the keyboard, mouse, touchscreen, scanner, microphone, and digital cam-
era. Disk drives and optical drives can also be considered input devices, because programs
5.26 It prints a random integer in the range of 10 through 19. and data are retrieved from them and loaded into the computer’s memory.
5.27 It prints a random floating-point number in the range of 0.0 up to, but not
including, 1.0.
Output Devices
5.28 It prints a random floating-point number in the range of 0.1 through 0.5.
Output is any data the computer produces for people or for other devices. It might be
5.29 It uses the system time, retrieved from the computer’s internal clock. a sales report, a list of names, or a graphic image. The data is sent to an output device,
5.30 If the same seed value were always used, the random number functions which formats and presents it. Common output devices are video displays and printers.
would always generate the same series of pseudorandom numbers. Disk drives can also be considered output devices because the system sends data to them
in order to be saved.
5.31 It returns a value back to the part of the program that called it.
5.32 a) do_something Software

b) It returns a value that is twice the argument passed to it.
If a computer is to function, software is not optional. Everything computer does, from the
c) 20 time you turn the power switch on until you shut the system down, is under the control
5.33 A function that returns either True or False of software. There are two general categories of software: system software and application
software. Most computer programs clearly fit into one of these two categories. Let’s take a
5.34 import math
closer look at each.
5.35 square_root = math.sqrt(100)
5.36 angle = math.radians(45) System Software

The programs that control and manage the basic operations of a computer are generally
referred to as system software. System software typically includes the following types of
Chapter 6
programs:
6.1 A file to which a program writes data. It is called an output file because the
Operating Systems An operating system is the most fundamental set of programs on a
program sends output to it.
computer. The operating system controls the internal operations of the computer’s hard-
6.2 A file from which a program reads data. It is called an input file because the ware, manages all of the devices connected to the computer, allows data to be saved to
program receives input from it. and retrieved from storage devices, and allows other programs to run on the computer.
Popular operating systems for laptop and desktop computers include Windows, macOS,
6.3 (1) Open the file. (2) Process the file. (3) Close the file.
and Linux. Popular operating systems for mobile devices include Android and iOS.
6.4 Text and binary. A text file contains data that has been encoded as text using Utility Programs A utility program performs a specialized task that enhances the com-
a scheme such as ASCII. Even if the file contains numbers, those numbers are puter’s operation or safeguards data. Examples of utility programs are virus scanners,
stored in the file as a series of characters. As a result, the file may be opened file compression programs, and data backup programs.
and viewed in a text editor such as Notepad. A binary file contains data that
1.3 How Computers Store Data 29 714 Appendix G Answers to Checkpoints
Software Development Tools Software development tools are the programs that pro- 5.5 When a program is developed as a set of functions in which each performs
grammers use to create, modify, and test software. Assemblers, compilers, and interpret- an individual task, then different programmers can be assigned the job of
ers are examples of programs that fall into this category. writing different functions.
5.6 A function definition has two parts: a header and a block. The header
Application Software indicates the starting point of the function, and the block is a list of
statements that belong to the function.
Programs that make a computer useful for everyday tasks are known as application soft-
ware. These are the programs that people normally spend most of their time running on 5.7 To call a function means to execute the function.
their computers. Figure 1-1, at the beginning of this chapter, shows screens from two com- 5.8 When the end of the function is reached, the computer returns back to the
monly used applications: Microsoft Word, a word processing program, and PowerPoint, a part of the program that called the function, and the program resumes
presentation program. Some other examples of application software are spreadsheet pro- execution at that point.
grams, email programs, web browsers, and game programs.
5.9 Because the Python interpreter uses the indentation to determine where a
block begins and ends
Checkpoint
5.10 A local variable is a variable that is declared inside a function. It belongs to
1.1 What is a program?
the function in which it is declared, and only statements in the same function
1.2 What is hardware? can access it.
1.3 List the five major components of a computer system.
5.11 The part of a program in which a variable may be accessed
1.4 What part of the computer actually runs programs?
5.12 Yes, it is permissible.
1.5 What part of the computer serves as a work area to store a program and its data
while the program is running? 5.13 Arguments
1.6 What part of the computer holds data for long periods of time, even when there is 5.14 Parameters
no power to the computer?
5.15 A parameter variable’s scope is the entire function in which the parameter is
1.7 What part of the computer collects data from people and from other devices?
declared.
1.8 What part of the computer formats and presents data for people or other devices?
5.16 No, it does not.
1.9 What fundamental set of programs control the internal operations of the
computer’s hardware? 5.17 a. passes by keyword argument
1.10 What do you call a program that performs a specialized task, such as a virus b. passes by position
scanner, a file compression program, or a data backup program? 5.18 The entire program
1.11 Word processing programs, spreadsheet programs, email programs, web browsers,
5.19 Here are three:
and game programs belong to what category of software?
Global variables make debugging difficult. Any statement in a program can
change the value of a global variable. If you find that the wrong value is being
stored in a global variable, you have to track down every statement that
1.3 How Computers Store Data accesses it to determine where the bad value is coming from. In a program
with thousands of lines of code, this can be difficult.
CONCEPT: All data that is stored in a computer is converted to sequences of 0s Functions that use global variables are usually dependent on those variables.
and 1s. If you want to use such a function in a different program, you will most likely
have to redesign it so it does not rely on the global variable.
A computer’s memory is divided into tiny storage locations known as bytes. One byte is Global variables make a program hard to understand. A global variable
only enough memory to store a letter of the alphabet or a small number. In order to do can be modified by any statement in the program. If you are to understand
anything meaningful, a computer has to have lots of bytes. Most computers today have any part of the program that uses a global variable, you have to be aware
millions, or even billions, of bytes of memory. of all the other parts of the program that access the global variable.
Each byte is divided into eight smaller storage locations known as bits. The term bit stands 5.20 A global constant is a name that is available to every function in the
for binary digit. Computer scientists usually think of bits as tiny switches that can be either program. It is permissible to use global constants. Because their value cannot
4.13 A variable that is used to accumulate the total of a series of numbers on or off. Bits aren’t actual “switches,” however, at least not in the conventional sense. In
most computer systems, bits are tiny electrical components that can hold either a positive
4.14 Yes, it should be initialized with the value 0. This is because values are added
or a negative charge. Computer scientists think of a positive charge as a switch in the on
to the accumulator by a loop. If the accumulator does not start at the value 0,
position, and a negative charge as a switch in the off position. Figure 1-6 shows the way
it will not contain the correct total of the numbers that were added to it when
that a computer scientist might think of a byte of memory: as a collection of switches that
the loop ends.
are each flipped to either the on or off position.
4.15 15
4.16 15
Figure 1-6 Think of a byte as eight switches
5
4.17 a) quantity += 1 ON ON ON ON
b) days_left −= 5
c) price *= 10
d) price /= 2
4.18 A sentinel is a special value that marks the end of a list of items.
4.19 A sentinel value must be unique enough that it will not be mistaken as a OFF OFF OFF OFF
regular value in the list.
4.20 It means that if bad data (garbage) is provided as input to a program, the
program will produce bad data (garbage) as output. When a piece of data is stored in a byte, the computer sets the eight bits to an on/off
4.21 When input is given to a program, it should be inspected before it is pattern that represents the data. For example, the pattern on the left in Figure 1-7 shows
processed. If the input is invalid, then it should be discarded and the user how the number 77 would be stored in a byte, and the pattern on the right shows how the
should be prompted to enter the correct data. letter A would be stored in a byte. We explain below how these patterns are determined.
4.22 The input is read, then a pretest loop is executed. If the input data is invalid,
the body of the loop executes. In the body of the loop, an error message is Figure 1-7 Bit patterns for the number 77 and the letter A
displayed so the user will know that the input was invalid, and then the
input read again. The loop repeats as long as the input is invalid. ON ON ON ON ON ON
4.23 It is the input operation that takes place just before an input validation loop.
The purpose of the priming read is to get the first input value.
4.24 None OFF
OFF OFF OFF OFF OFF OFF OFF OFF OFF
The number 77 stored in a byte. The letter A stored in a byte.

Chapter 5
5.1 A function is a group of statements that exist within a program for the pur-
pose of performing a specific task. Storing Numbers
5.2 A large task is divided into several smaller tasks that are easily performed. A bit can be used in a very limited way to represent numbers. Depending on whether the bit
is turned on or off, it can represent one of two different values. In computer systems, a bit
5.3 If a specific operation is performed in several places in a program, a function
that is turned off represents the number 0, and a bit that is turned on represents the num-
can be written once to perform that operation, and then be executed any time
ber 1. This corresponds perfectly to the binary numbering system. In the binary numbering
it is needed.
system (or binary, as it is usually called), all numeric values are written as sequences of 0s
5.4 Functions can be written for the common tasks that are needed by the and 1s. Here is an example of a number that is written in binary:
different programs. Those functions can then be incorporated into each
10011101
program that needs them.
The position of each digit in a binary number has a value assigned to it. Starting with 3.26 You use the turtle.pencolor() function to determine the pen color.
the rightmost digit and moving left, the position values are 20, 21, 22, 23, and so forth, as You use the turtle.fillcolor() function to determine the current fill
shown in Figure 1-8. Figure 1-9 shows the same diagram with the position values calcu- color. You use the turtle.bgcolor() function to determine the current
lated. Starting with the rightmost digit and moving left, the position values are 1, 2, 4, 8, background color of the turtle’s graphics window.
and so forth.
3.27 You use the turtle.pensize() function.
3.28 You use the turtle.speed() function.
Figure 1-8 The values of binary digits as powers of 2
10011101 Chapter 4
0 4.1 A structure that causes a section of code to repeat
2
21 4.2 A loop that uses a true/false condition to control the number of times that it
22
23 repeats
24
25 4.3 A loop that repeats a specific number of times
26
27 4.4 An execution of the statements in the body of the loop
4.5 Before
Figure 1-9 The values of binary digits 4.6 None. The condition count < 0 will be false to begin with.
4.7 A loop that has no way of stopping and repeats until the program is
10011101 interrupted.
1 4.8 for x in range(6):
2
4 print('I love to program!')
8
16 4.9 0
32 1
64
128
2
3
4
5
To determine the value of a binary number, you simply add up the position values of all the
1s. For example, in the binary number 10011101, the position values of the 1s are 1, 4, 8, 4.10 2
16, and 128. This is shown in Figure 1-10. The sum of all of these position values is 157. 3
So, the value of the binary number 10011101 is 157. 4
5
Figure 1-10 Determining the value of 10011101 4.11 0

100
10011101 200
300
1 400
500
4
8
16
4.12 10
9
8
128
7
1 + 4 + 8 + 16 + 128 = 157 6
3.13 if number == 1: Figure 1-11 shows how you can picture the number 157 stored in a byte of memory. Each
print('One') 1 is represented by a bit in the on position, and each 0 is represented by a bit in the off
elif number == 2: position.
print('Two')
elif number == 3:
print('Three') Figure 1-11 The bit pattern for 157
else:
print('Unknown')
3.14 It is an expression that is created by using a logical operator to combine two 1 1 1 1 1

Boolean subexpressions.
3.15 F
T 0 0 0
Position
F values 128 64 32 16 8 4 2 1
F
T 128 + 16 + 8 + 4 + 1 = 157
T
T
F
F When all of the bits in a byte are set to 0 (turned off), then the value of the byte is 0. When
T all of the bits in a byte are set to 1 (turned on), then the byte holds the largest value that
can be stored in it. The largest value that can be stored in a byte is 1 + 2 + 4 + 8 + 16 +
3.16 T 32 + 64 + 128 = 255. This limit exists because there are only eight bits in a byte.
F
T What if you need to store a number larger than 255? The answer is simple: use more than
T one byte. For example, suppose we put two bytes together. That gives us 16 bits. The posi-
T tion values of those 16 bits would be 20, 21, 22, 23, and so forth, up through 215. As shown
in Figure 1-12, the maximum value that can be stored in two bytes is 65,535. If you need
3.17 The and operator: If the expression on the left side of the and operator is to store a number larger than this, then more bytes are necessary.
false, the expression on the right side will not be checked.
The or operator: If the expression on the left side of the or operator is true,
the expression on the right side will not be checked.
Figure 1-12 Two bytes used for a large number
3.18 if speed >= 0 and speed <= 200:
print('The number is valid')
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
3.19 if speed < 0 or speed > 200:
print('The number is not valid')
3.20 True or False

Position
values
32768 16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1
3.21 A variable that signals when some condition exists in the program
32768 + 16384 + 8192 + 4096 + 2048 + 1024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 65535
3.22 You use the turtle.xcor() and turtle.ycor() functions.
3.23 You would use the not operator with the turtle.isdown() function, like this:
if turtle.isdown():
statement T IP : In case you’re feeling overwhelmed by all this, relax! You will not have to actu-
3.24 You use the turtle.heading() function. ally convert numbers to binary while programming. Knowing that this process is taking
place inside the computer will help you as you learn, and in the long term this knowl-
3.25 You use the turtle.isvisible() function. edge will make you a better programmer.
Storing Characters 2.38 turtle.bgcolor('black')
Any piece of data that is stored in a computer’s memory must be stored as a binary num- 2.39 turtle.setup(500, 200)
ber. That includes characters, such as letters and punctuation marks. When a character is 2.40 turtle.goto(100, 50)
stored in memory, it is first converted to a numeric code. The numeric code is then stored
in memory as a binary number. 2.41 turtle.pos()
Over the years, different coding schemes have been developed to represent characters in 2.42 turtle.speed(10)
computer memory. Historically, the most important of these coding schemes is ASCII, 2.43 turtle.speed(0)
which stands for the American Standard Code for Information Interchange. ASCII is a set
of 128 numeric codes that represent the English letters, various punctuation marks, and 2.44 To fill a shape with a color, you use the turtle.begin_fill() command
other characters. For example, the ASCII code for the uppercase letter A is 65. When you before drawing the shape, then you use the turtle.end_fill() command
type an uppercase A on your computer keyboard, the number 65 is stored in memory (as after the shape is drawn. When the turtle.end_fill() command executes,
a binary number, of course). This is shown in Figure 1-13. the shape will be filled with the current fill color.
2.45 With the turtle.write()command
Figure 1-13 The letter A is stored in memory as the number 65
Chapter 3
1 1
A
3.1 A logical design that controls the order in which a set of statements execute
65 3.2 It is a program structure that can execute a set of statements only under
0 0 0 0 0 0
certain circumstances.
3.3 A decision structure that provides a single alternative path of execution.
If the condition that is being tested is true, the program takes the alternative
TIP : The acronym ASCII is pronounced “askee.” path.
3.4 An expression that can be evaluated as either true or false
In case you are curious, the ASCII code for uppercase B is 66, for uppercase C is 67, and so 3.5 You can determine whether one value is greater than, less than, greater than
forth. Appendix C shows all of the ASCII codes and the characters they represent. or equal to, less than or equal to, equal to, or not equal to another value.
The ASCII character set was developed in the early 1960s and was eventually adopted by 3.6 if y == 20:
almost all computer manufacturers. ASCII is limited, however, because it defines codes for x = 0
only 128 characters. To remedy this, the Unicode character set was developed in the early 3.7 if sales >= 10000:
1990s. Unicode is an extensive encoding scheme that is compatible with ASCII, but can commissionRate = 0.2
also represent characters for many of the languages in the world. Today, Unicode is quickly
becoming the standard character set used in the computer industry. 3.8 A dual alternative decision structure has two possible paths of execution;
one path is taken if a condition is true, and the other path is taken if the
condition is false.
Advanced Number Storage 3.9 if-else
Earlier, you read about numbers and how they are stored in memory. While reading that 3.10 When the condition is false
section, perhaps it occurred to you that the binary numbering system can be used to repre-
sent only integer numbers, beginning with 0. Negative numbers and real numbers (such as 3.11 z is not less than a.
3.14159) cannot be represented using the simple binary numbering technique we discussed. 3.12 Boston
Computers are able to store negative numbers and real numbers in memory, but to do so New York
they use encoding schemes along with the binary numbering system. Negative numbers are
encoded using a technique known as two’s complement, and real numbers are encoded in
floating-point notation. You don’t need to know how these encoding schemes work, only
that they are used to convert negative numbers and real numbers to binary format.
2.16 0 Other Types of Data

2.17 last_name = input("Enter the customer's last name: ") Computers are often referred to as digital devices. The term digital can be used to describe
2.18 sales = float(input('Enter the sales for the week: ')) anything that uses binary numbers. Digital data is data that is stored in binary format, and
a digital device is any device that works with binary data. In this section, we have discussed
2.19 Here is the completed table: how numbers and characters are stored in binary, but computers also work with many
other types of digital data.
Expression Value For example, consider the pictures that you take with your digital camera. These images
6 + 3 * 5 21 are composed of tiny dots of color known as pixels. (The term pixel stands for picture
12 / 2 − 4 2 element.) As shown in Figure 1-14, each pixel in an image is converted to a numeric code
that represents the pixel’s color. The numeric code is stored in memory as a binary number.
9 + 14 * 2 − 6 31
(6 + 2) * 3 24
14 / (11 − 4) 2 Figure 1-14 A digital image is stored in binary format
9 + 12 * (8 − 3) 69
10111
010
10
01
0
2.20 4
00
10
101
101
2.21 1
2.22 If you do not want the print function to start a new line of output when it
finishes displaying its output, you can pass the special argument end = ' '
to the function.
The music that you play on your CD player, iPod, or MP3 player is also digital. A digital
2.23 You can pass the argument sep= to the print function, specifying the song is broken into small pieces known as samples. Each sample is converted to a binary
desired character. number, which can be stored in memory. The more samples that a song is divided into, the
2.24 It is the newline escape character. more it sounds like the original music when it is played back. A CD quality song is divided
into more than 44,000 samples per second!
2.25 It is the string concatenation operator, which joins two strings together.
2.26 65.43 Checkpoint
2.27 987,654.13 1.12 What amount of memory is enough to store a letter of the alphabet or a small
number?
2.28 (1) Named constants make programs more self-explanatory, (2) widespread
changes can easily be made to the program, and (3) they help to prevent the 1.13 What do you call a tiny “switch” that can be set to either on or off?
typographical errors that are common when using magic numbers. 1.14 In what numbering system are all numeric values written as sequences of 0s and 1s?
2.29 DISCOUNT_PERCENTAGE = 0.1

1.15 What is the purpose of ASCII?
1.16 What encoding scheme is extensive enough to represent the characters of many of
2.30 0 degrees the languages in the world?
2.31 With the turtle.forward command. 1.17 What do the terms “digital data” and “digital device” mean?
2.32 With the command turtle.right(45)
2.33 You would first use the turtle.penup() command to raise the turtle’s pen.
1.4 How a Program Works
2.34 turtle.heading()
2.35 turtle.circle(100) CONCEPT : A computer’s CPU can only understand instructions that are written in
machine language. Because people find it very difficult to write entire
2.36 turtle.pensize(8)
programs in machine language, other programming languages have been
2.37 turtle.pencolor('blue') invented.
1.4 How a Program Works 35 708 Appendix G Answers to Checkpoints
Earlier, we stated that the CPU is the most important component in a computer because it is 1.18 Machine language
the part of the computer that runs programs. Sometimes the CPU is called the “computer’s
1.19 Main memory, or RAM
brain” and is described as being “smart.” Although these are common metaphors, you
should understand that the CPU is not a brain, and it is not smart. The CPU is an electronic 1.20 The fetch-decode-execute cycle
device that is designed to do specific things. In particular, the CPU is designed to perform
1.21 It is an alternative to machine language. Instead of using binary numbers
operations such as the following:
for instructions, assembly language uses short words that are known as
Reading a piece of data from main memory mnemonics.
Adding two numbers
1.22 A high-level language
Subtracting one number from another number
Multiplying two numbers 1.23 Syntax
Dividing one number by another number
1.24 A compiler
Moving a piece of data from one memory location to another
Determining whether one value is equal to another value 1.25 An interpreter
As you can see from this list, the CPU performs simple operations on pieces of data. The 1.26 A syntax error
CPU does nothing on its own, however. It has to be told what to do, and that’s the purpose
of a program. A program is nothing more than a list of instructions that cause the CPU to
perform operations. Chapter 2
Each instruction in a program is a command that tells the CPU to perform a specific opera- 2.1 Any person, group, or organization that is asking you to write a program
tion. Here’s an example of an instruction that might appear in a program: 2.2 A single function that the program must perform in order to satisfy the
10110000 customer
To you and me, this is only a series of 0s and 1s. To a CPU, however, this is an instruction 2.3 A set of well-defined logical steps that must be taken to perform a task
to perform an operation.1 It is written in 0s and 1s because CPUs only understand instruc- 2.4 An informal language that has no syntax rules and is not meant to be
tions that are written in machine language, and machine language instructions always have compiled or executed. Instead, programmers use pseudocode to create
an underlying binary structure. models, or “mock-ups,” of programs.
A machine language instruction exists for each operation that a CPU is capable of perform- 2.5 A diagram that graphically depicts the steps that take place in a program
ing. For example, there is an instruction for adding numbers, there is an instruction for
subtracting one number from another, and so forth. The entire set of instructions that a 2.6 Ovals are terminal symbols. Parallelograms are either output or input
CPU can execute is known as the CPU’s instruction set. symbols. Rectangles are processing symbols.
2.7 print('Jimmy Smith')
2.8 print("Python's the best!")

NOT E: There are several microprocessor companies today that manufacture CPUs.
2.9 print('The cat said "meow"')
Some of the more well-known microprocessor companies are Intel, AMD, and Motorola.
If you look carefully at your computer, you might find a tag showing a logo for its 2.10 A name that references a value in the computer's memory
microprocessor.
2.11 99bottles is illegal because it begins with a number. r&d is illegal because
Each brand of microprocessor has its own unique instruction set, which is typically the & character is not allowed.
understood only by microprocessors of the same brand. For example, Intel micropro-
2.12 No, it is not because variable names are case sensitive.
cessors understand the same instructions, but they do not understand instructions for
Motorola microprocessors. 2.13 It is invalid because the variable that is receiving the assignment (in this case
amount) must appear on the left side of the = operator.
2.14 The value is val.
2.15 value1 will reference an int. value2 will reference a float.

1
The example shown is an actual instruction for an Intel microprocessor. It tells the microprocessor value3 will reference a float. value4 will reference an int.
to move a value into the CPU. value5 will reference an str (string).
36 Chapter 1 Introduction to Computers and Programming
The machine language instruction that was previously shown is an example of only one
instruction. It takes a lot more than one instruction, however, for the computer to do any-
thing meaningful. Because the operations that a CPU knows how to perform are so basic in
nature, a meaningful task can be accomplished only if the CPU performs many operations.
For example, if you want your computer to calculate the amount of interest that you will
APP ENDIX
earn from your savings account this year, the CPU will have to perform a large number of
G
instructions, carried out in the proper sequence. It is not unusual for a program to contain
Answers to Checkpoints thousands or even millions of machine language instructions.
Programs are usually stored on a secondary storage device such as a disk drive. When you
install a program on your computer, the program is typically copied to your computer’s disk
drive from a CD-ROM, or downloaded from a website.
Although a program can be stored on a secondary storage device such as a disk drive,
it has to be copied into main memory, or RAM, each time the CPU executes it. For
example, suppose you have a word processing program on your computer’s disk. To
execute the program, you use the mouse to double-click the program’s icon. This causes
Chapter 1
the program to be copied from the disk into main memory. Then, the computer’s CPU
1.1 A program is a set of instructions that a computer follows to perform a task. executes the copy of the program that is in main memory. This process is illustrated in
1.2 Hardware is all the physical devices, or components, of which a computer is Figure 1-15.
made.
1.3 The central processing unit (CPU), main memory, secondary storage devices, Figure 1-15 A program is copied into main memory and then executed
input devices, and output devices
The program is copied
1.4 The CPU The CPU executes
from secondary storage
the program in
to main memory.
1.5 Main memory main memory.
Main memory
1.6 Secondary storage (RAM)
1.7 Input device
1.8 Output device
1.9 The operating system Disk drive CPU
1.10 A utility program

1.11 Application software When a CPU executes the instructions in a program, it is engaged in a process that is known
as the fetch-decode-execute cycle. This cycle, which consists of three steps, is repeated for
1.12 One byte each instruction in the program. The steps are:
1.13 A bit 1. Fetch. A program is a long sequence of machine language instructions. The first step
1.14 The binary numbering system of the cycle is to fetch, or read, the next instruction from memory into the CPU.
2. Decode. A machine language instruction is a binary number that represents a com-
1.15 It is an encoding scheme that uses a set of 128 numeric codes to represent mand that tells the CPU to perform an operation. In this step, the CPU decodes
the English letters, various punctuation marks, and other characters. These the instruction that was just fetched from memory, to determine which operation it
numeric codes are used to store characters in a computer’s memory. (ASCII should perform.
stands for the American Standard Code for Information Interchange.) 3. Execute. The last step in the cycle is to execute, or perform, the operation.
1.16 Unicode Figure 1-16 illustrates these steps.
1.17 Digital data is data that is stored in binary, and a digital device is any device
that works with binary data.
707
Figure 1-16 The fetch-decode-execute cycle
10100001
Fetch the next instruction
1
in the program.
10100001
10111000 Decode the instruction
10011110 2 to determine which
00011010 operation to perform.
11011100
and so forth... CPU
Execute the instruction
3
(perform the operation).
Main memory
(RAM)
From Machine Language to Assembly Language

Computers can only execute programs that are written in machine language. As previously
mentioned, a program can have thousands or even millions of binary instructions, and writ-
ing such a program would be very tedious and time consuming. Programming in machine
language would also be very difficult, because putting a 0 or a 1 in the wrong place will
cause an error.
Although a computer’s CPU only understands machine language, it is impractical for people
to write programs in machine language. For this reason, assembly language was created in
the early days of computing2 as an alternative to machine language. Instead of using binary
numbers for instructions, assembly language uses short words that are known as mnemon-
ics. For example, in assembly language, the mnemonic add typically means to add numbers,
mul typically means to multiply numbers, and mov typically means to move a value to a
location in memory. When a programmer uses assembly language to write a program, he
or she can write short mnemonics instead of binary numbers.
N OTE : There are many different versions of assembly language. It was mentioned
earlier that each brand of CPU has its own machine language instruction set. Each
brand of CPU typically has its own assembly language as well.
Assembly language programs cannot be executed by the CPU, however. The CPU only
understands machine language, so a special program known as an assembler is used to
translate an assembly language program to a machine language program. This process is
shown in Figure 1-17. The machine language program that is created by the assembler can
then be executed by the CPU.
2
The first assembly language was most likely that developed in the 1940s at Cambridge University
for use with a historic computer known as the EDSAC.
Figure 1-17 An assembler translates an assembly language program to a machine

language program
Assembly language Machine language

program program
Installing Modules with

APP ENDIX
F
mov eax, Z 10100001
add eax, 2
mov Y, eax 10111000
the pip Utility

Assembler
and so forth... 10011110
and so forth...
High-Level Languages
Although assembly language makes it unnecessary to write binary machine language instruc-
The Python standard library provides classes and functions that your programs can use to tions, it is not without difficulties. Assembly language is primarily a direct substitute for
perform basic operations, as well as many advanced tasks. There are operations, however, machine language, and like machine language, it requires that you know a lot about the
that the standard library cannot perform. When you need to do something that is beyond CPU. Assembly language also requires that you write a large number of instructions for even
the scope of the standard library, you have two choices: write the code yourself, or use code the simplest program. Because assembly language is so close in nature to machine language,
that someone else has already written. it is referred to as a low-level language.
Fortunately, there are thousands of Python modules, written by independent programmers, In the 1950s, a new generation of programming languages known as high-level languages
that provide capabilities that the standard Python library does not offer. These are known began to appear. A high-level language allows you to create powerful and complex pro-
as third-party modules. A large collection of third-party modules exists at the website pypi. grams without knowing how the CPU works and without writing large numbers of low-level
python.org, which is known as the Python Package Index, or PyPI. instructions. In addition, most high-level languages use words that are easy to understand.
For example, if a programmer were using COBOL (which was one of the early high-level
The modules that are available at PyPI are organized as packages. A package is simply a coll- languages created in the 1950s), he or she would write the following instruction to display
ection of one or more related modules. The easiest way to download and install a package the message Hello world on the computer screen:
is with the pip utility. The pip utility is a program that is part of the standard Python
installation, beginning with Python 3.4. To install a package on a Windows system with DISPLAY "Hello world"
the pip utility, you must open a command prompt window, and type a command following Python is a modern, high-level programming language that we will use in this book. In
this format: Python you would display the message Hello world with the following instruction:
pip install package_name print('Hello world')
package_name is the name of a package that you want to download and install. If you are
Doing the same thing in assembly language would require several instructions and an inti-
running a Mac or a Linux system, you must use the pip3 command instead of the pip com-
mate knowledge of how the CPU interacts with the computer’s output device. As you can see
mand. In addition, you will need superuser privileges to execute the pip3 command on a
from this example, high-level languages allow programmers to concentrate on the tasks they
Mac or Linux system, so you will have to prefix the command with sudo, as shown here: want to perform with their programs, rather than the details of how the CPU will execute
sudo pip3 install package_name those programs.
Once you enter the command, the pip utility will start downloading and installing the Since the 1950s, thousands of high-level languages have been created. Table 1-1 lists several
package. Depending on the size of the package, it may take a few minutes to complete the of the more well-known languages.
installation process. Once the process is finished, you can typically verify that the package
was correctly installed by starting IDLE and entering the command
Key Words, Operators, and Syntax: An Overview
>>> import package_name
Each high-level language has its own set of predefined words that the programmer must
where package_name is the name of the package that you installed. If you do not see an use to write a program. The words that make up a high-level programming language are
error message, you can assume the package was successfully installed. known as key words or reserved words. Each key word has a specific meaning, and cannot
In Chapter 7, you will explore a popular third-party package named matplotlib. You can be used for any other purpose. Table 1-2 shows all of the Python key words.
use the matplotlib package to create charts and graphs.
705
Table 1-1 Programming languages

Language Description
Ada Ada was created in the 1970s, primarily for applications used by the U.S.
Department of Defense. The language is named in honor of Countess Ada
Lovelace, an influential and historic figure in the field of computing.
BASIC Beginners All-purpose Symbolic Instruction Code is a general-purpose language
that was originally designed in the early 1960s to be simple enough for beginners
to learn. Today, there are many different versions of BASIC.
FORTRAN FORmula TRANslator was the first high-level programming language. It was
designed in the 1950s for performing complex mathematical calculations.
COBOL Common Business-Oriented Language was created in the 1950s and was designed
for business applications.
Pascal Pascal was created in 1970 and was originally designed for teaching programming.
The language was named in honor of the mathematician, physicist, and philosopher
Blaise Pascal.
C and C++ C and C++ (pronounced “c plus plus”) are powerful, general-purpose languages
developed at Bell Laboratories. The C language was created in 1972, and the
C++ language was created in 1983.
C# Pronounced “c sharp.” This language was created by Microsoft around the year
2000 for developing applications based on the Microsoft .NET platform.
Java Java was created by Sun Microsystems in the early 1990s. It can be used to develop
programs that run on a single computer or over the Internet from a web server. This page intentionally left blank
JavaScript JavaScript, created in the 1990s, can be used in Web pages. Despite its name,
JavaScript is not related to Java.
Python Python, the language we use in this book, is a general-purpose language created
in the early 1990s. It has become popular in business and academic applications.
Ruby Ruby is a general-purpose language that was created in the 1990s. It is increas-
ingly becoming a popular language for programs that run on Web servers.
Visual Basic Visual Basic (commonly known as VB) is a Microsoft programming language and
software development environment that allows programmers to create Windows-
based applications quickly. VB was originally created in the early 1990s.
Table 1-2 The Python key words

and del from None True
as elif global nonlocal try
assert else if not while
break except import or with
class False in pass yield
continue finally is raise
def for lambda return
Using an Alias 703 40 Chapter 1 Introduction to Computers and Programming
Using an Alias In addition to key words, programming languages have operators that perform various
operations on data. For example, all programming languages have math operators that
You can use the as keyword to assign an alias to a module when you import it. The follow- perform arithmetic. In Python, as well as most other languages, the + sign is an operator
ing statement shows an example: that adds two numbers. The following adds 12 and 75:
import math as mt 12 + 75
This statement loads the math module into memory, assigning the module the alias mt. There are numerous other operators in the Python language, many of which you will learn
To use any of the items that are in the module, you prefix the item’s name with the alias, about as you progress through this text.
followed by a dot. For example, to call the sqrt function, you would use the name
mt.sqrt. The following interactive session shows an example: In addition to key words and operators, each language also has its own syntax, which is a
set of rules that must be strictly followed when writing a program. The syntax rules dictate
>>> import math as mt how key words, operators, and various punctuation characters must be used in a program.
>>> x = mt.sqrt(25) When you are learning a programming language, you must learn the syntax rules for that
>>> a = mt.radians(180) particular language.
>>> print(x)
5.0 The individual instructions that you use to write a program in a high-level programming
>>> print(a) language are called statements. A programming statement can consist of key words, oper-
3.141592653589793 ators, punctuation, and other allowable programming elements, arranged in the proper
>>> sequence to perform an operation.
You can also assign an alias to a specific function or class when you import it. The follow-
ing statement imports the sqrt function from the math module, and assigns the function Compilers and Interpreters
the alias square_root:
Because the CPU understands only machine language instructions, programs that are writ-
from math import sqrt as square_root ten in a high-level language must be translated into machine language. Depending on the
language in which a program has been written, the programmer will use either a compiler
After using this import statement, you would use the name square_root to call the sqrt
or an interpreter to make the translation.
function. The following interactive session shows an example:
A compiler is a program that translates a high-level language program into a separate
>>> from math import sqrt as square_root
machine language program. The machine language program can then be executed any time
>>> x = square_root(25)
it is needed. This is shown in Figure 1-18. As shown in the figure, compiling and executing
>>> print(x)
are two different processes.
5.0
>>> Figure 1-18 Compiling a high-level program and executing it
In the following interactive session, we import two functions from the math module, giving
High-level language Machine language
each of them an alias. The sqrt function is imported as square_root, and the tan func- program
program
tion is imported as tangent:
The compiler is used 10100001
print ("Hello
>>> from math import sqrt as square_root, tan as tangent 1 to translate the high-level Earthling") 10111000
language program to a Compiler
>>> x = square_root(25) 10011110
machine language program. and so forth... and so forth...
>>> y = tangent(45)
>>> print(x)
5.0
>>> print(y)
1.6197751905438615
Machine language
CPU
program
The machine language 10100001
2 program can be executed 10111000
at any time, without using 10011110
the compiler. and so forth...
1.4 How a Program Works 41 702 Appendix E More About the import Statement
The Python language uses an interpreter, which is a program that both translates and This statement causes only the sqrt function to be imported from the math module. It also
executes the instructions in a high-level language program. As the interpreter reads allows you to call the sqrt function without prefixing the function’s name with the name
each individual instruction in the program, it converts it to machine language instruc- of the module. The following interactive session shows an example:
tions then immediately executes them. This process repeats for every instruction in
>>> from math import sqrt
the program. This process is illustrated in Figure 1-19. Because interpreters combine
>>> x = sqrt(25)
translation and execution, they typically do not create separate machine language
>>> print(x)
programs.
5.0
>>>
Figure 1-19 Executing a high-level program with an interpreter You can specify the names of multiple items, separated with commas, when you use this
form of the import statement. For example, the import statement in the following interac-
High-level language tive session imports only the sqrt function and the radians function from the math
program CPU module:
Machine language
print ("Hello instruction
>>> from math import sqrt, radians
Earthling") Interpreter 10100001
>>> x = sqrt(25)
and so forth... >>> a = radians(180)
>>> print(x)
5.0
The interpreter translates each high-level instruction to
>>> print(a)
its equivalent machine language instructions then 3.141592653589793
immediately executes them. >>>
This process is repeated for each high-level instruction.
Wildcard Imports
The statements that a programmer writes in a high-level language are called source A wildcard import statement loads the entire contents of a module. Here is an example:
code, or simply code. Typically, the programmer types a program’s code into a text
editor then saves the code in a file on the computer’s disk. Next, the programmer uses from math import *
a compiler to translate the code into a machine language program, or an interpreter to The difference between this statement and the import math statement is that the wildcard
translate and execute the code. If the code contains a syntax error, however, it cannot import statement does not require you to use the qualified names of the items in the mod-
be translated. A syntax error is a mistake such as a misspelled key word, a missing ule. For example, here is an interactive session that uses a wildcard import statement:
punctuation character, or the incorrect use of an operator. When this happens, the
compiler or interpreter displays an error message indicating that the program contains >>> from math import*
a syntax error. The programmer corrects the error then attempts once again to translate >>> x = sqrt(25)
the program. >>> a = radians(180)
>>>
And, here is an interactive session that uses the regular import statement:
N OTE : Human languages also have syntax rules. Do you remember when you took >>> import math
your first English class, and you learned all those rules about commas, apostrophes, >>> x = math.sqrt(25)
capitalization, and so forth? You were learning the syntax of the English language. >>> a = math.radians(180)
>>>
Although people commonly violate the syntax rules of their native language when
speaking and writing, other people usually understand what they mean. Unfortunately, Typically, you should avoid using the wildcard import statement because it can lead to
compilers and interpreters do not have this ability. If even a single syntax error appears name clashes when you are importing several modules. A name clash occurs when a
in a program, the program cannot be compiled or executed. When an interpreter program imports two modules that have functions or classes with the same name. Name
encounters a syntax error, it stops executing the program. clashes do not occur when you are using the qualified names of a module’s functions
and/or classes.
Checkpoint
1.18 A CPU understands instructions that are written only in what language?
1.19 A program has to be copied into what type of memory each time the CPU
executes it?
1.20 When a CPU executes the instructions in a program, it is engaged in what process?
More About the import
APP ENDIX
E
1.21 What is assembly language?
1.22 What type of programming language allows you to create powerful and complex
Statement 1.23
programs without knowing how the CPU works?
Each language has a set of rules that must be strictly followed when writing a
program. What is this set of rules called?
1.24 What do you call a program that translates a high-level language program into a
separate machine language program?
1.25 What do you call a program that both translates and executes the instructions in
A module is a Python source code file that contains functions and/or classes. Many of the a high-level language program?
functions in the Python standard library are stored in modules. For example, the math mod- 1.26 What type of mistake is usually caused by a misspelled key word, a missing
ule contains various mathematical functions, and the random module contains functions for punctuation character, or the incorrect use of an operator?
working with random numbers.
In order to use the functions and/or classes that are stored in a module, you must import the
module. To import a module, you write an import statement at the top of your program.
1.5 Using Python
Here is an import statement that imports the math module:
CONCEPT : The Python interpreter can run Python programs that are saved in files
import math
or interactively execute Python statements that are typed at the keyboard.
This statement causes the Python interpreter to load the contents of the math module into Python comes with a program named IDLE that simplifies the process of
memory, making the functions and/or classes that are stored in the math module available writing, executing, and testing programs.
to the program. To use any item that is in the module, you must use the item’s qualified
name. This means that you must prefix the item’s name with the name of the module, fol-
lowed by a dot. For example, the math module has a function named sqrt that returns the Installing Python
square root of a number. To call the sqrt function, you would use the name math.sqrt. Before you can try any of the programs shown in this book, or write any programs of your
The following interactive session shows an example: own, you need to make sure that Python is installed on your computer and properly con-
>>> import math
figured. If you are working in a computer lab, this has probably been done already. If you
>>> x = math.sqrt(25)
are using your own computer, you can follow the instructions in Appendix A to download
>>> print(x)
and install Python.
5.0
>>> The Python Interpreter
You learned earlier that Python is an interpreted language. When you install the Python
language on your computer, one of the items that is installed is the Python interpreter. The
Importing a Specific Function or Class Python interpreter is a program that can read Python programming statements and execute
The previously shown form of the import statement loads the entire contents of a module them. (Sometimes, we will refer to the Python interpreter simply as the interpreter.)
into memory. Sometimes you want to import only a specific function or class from a mod-
You can use the interpreter in two modes: interactive mode and script mode. In interac-
ule. When this is the case, you can use the from keyword with the import statement, as
tive mode, the interpreter waits for you to type Python statements on the keyboard. Once
shown here:
you type a statement, the interpreter executes it and then waits for you to type another
from math import sqrt statement. In script mode, the interpreter reads the contents of a file that contains Python
statements. Such a file is known as a Python program or a Python script. The interpreter
executes each statement in the Python program as it reads it.
701
1.5 Using Python 43
Interactive Mode
Once Python has been installed and set up on your system, you start the interpreter in
interactive mode by going to the operating system’s command line and typing the follow-
ing command:
python
If you are using Windows, you can alternatively type python in the Windows search box.
In the search results, you will see a program named something like Python 3.5. (The “3.5”
is the version of Python that is installed. At the time this is being written, Python 3.5 is
the latest version.) Clicking this item will start the Python interpreter in interactive mode.
N OTE : When the Python interpreter is running in interactive mode, it is commonly

called the Python shell.
When the Python interpreter starts in interactive mode, you will see something like the fol-
lowing displayed in a console window:
Python 3.5.1 (v3.5.1:37a07cee5969, Dec 6 2015, 01:38:48)
[MSC v.1900 32 bit (Intel)] on win32
Type "help", "copyright", "credits" or "license"
for more information. This page intentionally left blank
>>>
The >>> that you see is a prompt that indicates the interpreter is waiting for you to type
a Python statement. Let’s try it out. One of the simplest things that you can do in Python
is print a message on the screen. For example, the following statement prints the message
Python programming is fun! on the screen:
print('Python programming is fun!')
You can think of this as a command that you are sending to the Python interpreter. If
you type the statement exactly as it is shown, the message Python programming is fun! is
printed on the screen. Here is an example of how you type this statement at the interpreter’s
prompt:
>>> print('Python programming is fun!') Enter
After typing the statement, you press the Enter key, and the Python interpreter executes the
statement, as shown here:
Python programming is fun!
>>>
Appendix D Predefined Named Colors 699 44 Chapter 1 Introduction to Computers and Programming
'gray3' 'gray4' 'gray5' After the message is displayed, the >>> prompt appears again, indicating the interpreter is
'gray6' 'gray7' 'gray8' waiting for you to enter another statement. Let’s look at another example. In the following
sample session, we have entered two statements:
'gray9' 'gray10' 'gray11'
>>> print('To be or not to be') Enter
To be or not to be
'gray15' 'gray16' 'gray17' >>> print('That is the question.') Enter
'gray18' 'gray19' 'gray20' That is the question.
>>>
'gray24' 'gray25' 'gray26' If you incorrectly type a statement in interactive mode, the interpreter will display an error
message. This will make interactive mode useful to you while you learn Python. As you
learn new parts of the Python language, you can try them out in interactive mode and get
'gray30' 'gray31' 'gray32' immediate feedback from the interpreter.
'gray33' 'gray34' 'gray35' To quit the Python interpreter in interactive mode on a Windows computer, press Ctrl-Z
'gray36' 'gray37' 'gray38' (pressing both keys together) followed by Enter. On a Mac, Linux, or UNIX computer,
press Ctrl-D.
'gray46' 'gray47' 'gray48' N O TE : In Chapter 2, we will discuss the details of statements like the ones previously
shown. If you want to try them now in interactive mode, make sure you type them exactly
as shown.
'gray58' 'gray59' 'gray60' Writing Python Programs and Running
'gray61' 'gray62' 'gray63' Them in Script Mode
'gray64' 'gray65' 'gray66' Although interactive mode is useful for testing code, the statements that you enter in interac-
tive mode are not saved as a program. They are simply executed and their results displayed on
the screen. If you want to save a set of Python statements as a program, you save those state-
'gray70' 'gray71' 'gray72' ments in a file. Then, to execute the program, you use the Python interpreter in script mode.
'gray73' 'gray74' 'gray75' For example, suppose you want to write a Python program that displays the following three
'gray76' 'gray77' 'gray78' lines of text:
'gray79' 'gray80' 'gray81' Nudge nudge
'gray82' 'gray83' 'gray84' Wink wink
Know what I mean?
To write the program you would use a simple text editor like Notepad (which is installed
on all Windows computers) to create a file containing the following statements:
print('Nudge nudge')
print('Wink wink')
'gray98' 'gray99' print('Know what I mean?')
N O TE : It is possible to use a word processor to create a Python program, but you must
be sure to save the program as a plain text file. Otherwise, the Python interpreter will
not be able to read its contents.
GLOBAL GLOBAL
EDITION EDITION


FOURTH EDITION

Tony Gaddis

744 Credits
VERSION SPECIFIED.
and password.
IMPORTANT:

Credits


743
742 Index

STARTING OUT WITH

ValueError, 349–350, 354, 355, 356, 358, 382
P
how to use, 274–276 Button, 622, 630–633
®
Values
Menu, 622
Menubutton, 622

data attribute, 514
Message, 622
Variables Writing
names, sample, 66
Index 741

740 Index

if, 131–139 writing, 575
Step values, 194
precedence, 79
Superclasses
P
®
defined, 59
Syntax errors
correcting, 54
Strings
defined, 41
reporting, 691
defined, 59
Tony Gaddis
Index 739
KAO Two
10 9 8 7 6 5 4 3 2 1
738 Index


generation, 193
recursive call, 605
Recursion form, 272
loops vs., 602–603, 613 Ruby, 39
5
Index 737

squares.py, 195
string_input.py, 72
736 Index


coin_demo5.py, 533
2.4 Comments 61
7

6.4 Exceptions 346
Output devices, 28
Overhead, 602
P
pack method, 625–627, 629, 634
instances, 515, 532–554
Pascal, 39

nested, 212–218, 401 defined, 262, 286
using, 287
732 Index

VideoNote
J elements, 366
of strings, 366
plotting, 406–413 and, 156–158
Index 731

Integers
and alias, 703
formatting, 94–95
wildcard, 702
list of, 366
Indentation
IDLE, default, 690
color coding, 689
defined, 45
Exceptions
resources, 692
Indexes
characters, 432
defined, 368
shell window, 686
invalid, 375, 378, 433, 438
starting, 685–687
index method, 379–381 266–267, 371–372, 375
647–648 Python, 42
730 Index


Function call
defined, 235
functions

nested, 74 609–610
GUI programs
degrees(), 285
float(), 73, 74, 75, 86 creating, 621–624, 640
floor(), 285
len, 369, 434, 465–466 text display, 624–627
log(), 285
message, 235–240, 599–601 H
13
altogether.
initializing, 518


defined, 33 Buttons
format, 63
Binary files, 311
18 Preface
topics.
Supplements
repetition, 367
defined, 76 Actions
defined, 203
725
13.20 (139, 479)
Haris Ribic


e) create_oval
f) create_arc
Champaign
Bob Husson
Diane Innes
Daniel Jinguji
Gary Marrer
Keith Mehl
Chabot College
interacts
Khyat Sharma
13.13 tkinter

10.13 10
methods.
class do?
Chapter 11
general object.

I’m a potato.
9.27 {10, 20, 30, 100, 200, 300}
9.28 {3, 4}
9.29 {1, 2}
9.30 {5, 6}
9.31 {'a', 'd'}
9.34 'wb'
9.35 'rb'

9.37 pickle.dump
9.38 pickle.load

Chapter 10
operate on.
Chapter 9
9.1 Key and value
9.2 The key
CHAPTE R
1
and Programming 9.5

9.6
ccc

9.8 3
TOPICS 9.9 1
tuples.
1.1 Introduction
9.14 Unordered
'y', and 'z'.
23
Chapter 8
print(letter)
8.2 0
8.3 9
print('Digit')
print('No digit')
count += 1
Main memory
Best Pictures here/

Nikita Rogul/
Shutterstock
Shutterstock
Unit
iko/Shutterstock
Shutterstock
Output
[0, 0, 0, 0], [0, 0, 0, 0]]
Chiyacat/
Peter Guess/
Shutterstock
for c in range(2):
Input
Devices
jocic/Shutterstock
Main Memory
modified.
Input devices
7.27 A line graph
6.21 IOError
6.22 ValueError
Chapter 7
7.1 [1, 2, 99, 4, 5]
7.2 [0, 1, 2]
7.3 [10, 10, 10, 10, 10]
7.4 1
3
5
7
9
7.5 4

7.7 [1, 2, 3]
[10, 20, 30]
[1, 2, 3, 10, 20, 30]
7.8 [1, 2, 3]
[10, 20, 30, 1, 2, 3]
7.9 [2, 3]
7.10 [2, 3]
7.11 [1]
7.12 [1, 2, 3, 4, 5]
7.13 [3, 4, 5]

outfile.close()
while line != '':
print(line)
output.
including, 1.0.
Output Devices

5.34 import math

Chapter 6
programs:
Checkpoint
declared.
the loop ends.
4.15 15
4.16 15
5
b) days_left −= 5
c) price *= 10
d) price /= 2
4.24 None OFF

Chapter 5
it is needed.
10011101
and so forth.
10011101 Chapter 4
2
22
23 repeats
24
26
4.5 Before
2
8
16 4.9 0
32 1
64
128
2
3
4
5
5

100
10011101 200
300
1 400
500
4
8
16
4.12 10
9
8
128
7
1 + 4 + 8 + 16 + 128 = 157 6
print('Two')
elif number == 3:
else:
print('Unknown')

3.15 F
T 0 0 0
Position
F values 128 64 32 16 8 4 2 1
F
T 128 + 16 + 8 + 4 + 1 = 157
T
T
F
F
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
3.20 True or False

Position
values
32768 16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1
32768 + 16384 + 8192 + 4096 + 2048 + 1024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 65535
if turtle.isdown():
Chapter 3
1 1
A
0 0 0 0 0 0
condition is false.

9 + 14 * 2 − 6 31
(6 + 2) * 3 24
9 + 12 * (8 − 3) 69
10111
010
10
01
0
2.20 4
00
10
101
101
2.21 1
to the function.
number?

Adding two numbers
1.24 A compiler
10110000 customer

microprocessor.

1
APP ENDIX
G
Chapter 1
made.
the program in
to main memory.
Main memory
1.7 Input device
1.8 Output device

707
10100001
1
in the program.
10100001
11011100
and so forth... CPU
3
Main memory
(RAM)

cause an error.
2

language program

program program

APP ENDIX
F
mov eax, Z 10100001
add eax, 2
mov Y, eax 10111000
the pip Utility

Assembler
and so forth...
705

Blaise Pascal.

>>> print(x)
>>> print(x)
5.0
program
print ("Hello
>>> x = square_root(25) 10011110
>>> y = tangent(45)
>>> print(x)
5.0
>>> print(y)
1.6197751905438615
Machine language
CPU
program
>>> x = sqrt(25)
>>> print(x)
programs.
5.0
>>>
program CPU module:
Machine language
>>> x = sqrt(25)
>>> print(x)
5.0
>>> print(a)
Wildcard Imports
>>>
>>>
and/or classes.
Checkpoint
executes it?
APP ENDIX
E
Statement 1.23
1.5 Using Python
import math
>>> import math
>>> print(x)
and install Python.
5.0
shown here:
701
1.5 Using Python 43
Interactive Mode
ing command:
python

Python 3.5.1 (v3.5.1:37a07cee5969, Dec 6 2015, 01:38:48)
>>>
prompt:
>>>
To be or not to be
>>>
press Ctrl-D.
as shown.
Know what I mean?
print('Wink wink')
GLOBAL GLOBAL
EDITION EDITION


FOURTH EDITION

Tony Gaddis

744 Credits
VERSION SPECIFIED.
and password.
IMPORTANT:

Credits


743
742 Index

STARTING OUT WITH

ValueError, 349–350, 354, 355, 356, 358, 382
P
how to use, 274–276 Button, 622, 630–633
®
Values
Menu, 622
Menubutton, 622

data attribute, 514
Message, 622
Variables Writing
names, sample, 66
Index 741

740 Index

if, 131–139 writing, 575
Step values, 194
precedence, 79
Superclasses
P
®
defined, 59
Syntax errors
correcting, 54
Strings
defined, 41
reporting, 691
defined, 59
Tony Gaddis
Index 739
KAO Two
10 9 8 7 6 5 4 3 2 1
738 Index


generation, 193
recursive call, 605
Recursion form, 272
loops vs., 602–603, 613 Ruby, 39
5
Index 737

squares.py, 195
string_input.py, 72
736 Index


coin_demo5.py, 533
2.4 Comments 61
7

6.4 Exceptions 346
Output devices, 28
Overhead, 602
P
pack method, 625–627, 629, 634
instances, 515, 532–554
Pascal, 39

nested, 212–218, 401 defined, 262, 286
using, 287
732 Index

VideoNote
J elements, 366
of strings, 366
plotting, 406–413 and, 156–158
Index 731

Integers
and alias, 703
formatting, 94–95
wildcard, 702
list of, 366
Indentation
IDLE, default, 690
color coding, 689
defined, 45
Exceptions
resources, 692
Indexes
characters, 432
defined, 368
shell window, 686
invalid, 375, 378, 433, 438
starting, 685–687
index method, 379–381 266–267, 371–372, 375
647–648 Python, 42
730 Index


Function call
defined, 235
functions

nested, 74 609–610
GUI programs
degrees(), 285
float(), 73, 74, 75, 86 creating, 621–624, 640
floor(), 285
len, 369, 434, 465–466 text display, 624–627
log(), 285
message, 235–240, 599–601 H
13
altogether.
initializing, 518


defined, 33 Buttons
format, 63
Binary files, 311
18 Preface
topics.
Supplements
repetition, 367
defined, 76 Actions
defined, 203
725
13.20 (139, 479)
Haris Ribic


e) create_oval
f) create_arc
Champaign
Bob Husson
Diane Innes
Daniel Jinguji
Gary Marrer
Keith Mehl
Chabot College
interacts
Khyat Sharma
13.13 tkinter

10.13 10
methods.
class do?
Chapter 11
general object.

I’m a potato.
9.27 {10, 20, 30, 100, 200, 300}
9.28 {3, 4}
9.29 {1, 2}
9.30 {5, 6}
9.31 {'a', 'd'}
9.34 'wb'
9.35 'rb'

9.37 pickle.dump
9.38 pickle.load

Chapter 10
operate on.
Chapter 9
9.1 Key and value
9.2 The key
CHAPTE R
1
and Programming 9.5

9.6
ccc

9.8 3
TOPICS 9.9 1
tuples.
1.1 Introduction
9.14 Unordered
'y', and 'z'.
23
Chapter 8
print(letter)
8.2 0
8.3 9
print('Digit')
print('No digit')
count += 1
Main memory
Best Pictures here/

Nikita Rogul/
Shutterstock
Shutterstock
Unit
iko/Shutterstock
Shutterstock
Output
[0, 0, 0, 0], [0, 0, 0, 0]]
Chiyacat/
Peter Guess/
Shutterstock
for c in range(2):
Input
Devices
jocic/Shutterstock
Main Memory
modified.
Input devices
7.27 A line graph
6.21 IOError
6.22 ValueError
Chapter 7
7.1 [1, 2, 99, 4, 5]
7.2 [0, 1, 2]
7.3 [10, 10, 10, 10, 10]
7.4 1
3
5
7
9
7.5 4

7.7 [1, 2, 3]
[10, 20, 30]
[1, 2, 3, 10, 20, 30]
7.8 [1, 2, 3]
[10, 20, 30, 1, 2, 3]
7.9 [2, 3]
7.10 [2, 3]
7.11 [1]
7.12 [1, 2, 3, 4, 5]
7.13 [3, 4, 5]

outfile.close()
while line != '':
print(line)
output.
including, 1.0.
Output Devices

5.34 import math

Chapter 6
programs:
Checkpoint
declared.
the loop ends.
4.15 15
4.16 15
5
b) days_left −= 5
c) price *= 10
d) price /= 2
4.24 None OFF

Chapter 5
it is needed.
10011101
and so forth.
10011101 Chapter 4
2
22
23 repeats
24
26
4.5 Before
2
8
16 4.9 0
32 1
64
128
2
3
4
5
5

100
10011101 200
300
1 400
500
4
8
16
4.12 10
9
8
128
7
1 + 4 + 8 + 16 + 128 = 157 6
print('Two')
elif number == 3:
else:
print('Unknown')

3.15 F
T 0 0 0
Position
F values 128 64 32 16 8 4 2 1
F
T 128 + 16 + 8 + 4 + 1 = 157
T
T
F
F
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
3.20 True or False

Position
values
32768 16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1
32768 + 16384 + 8192 + 4096 + 2048 + 1024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 65535
if turtle.isdown():
Chapter 3
1 1
A
0 0 0 0 0 0
condition is false.

9 + 14 * 2 − 6 31
(6 + 2) * 3 24
9 + 12 * (8 − 3) 69
10111
010
10
01
0
2.20 4
00
10
101
101
2.21 1
to the function.
number?

Adding two numbers
1.24 A compiler
10110000 customer

microprocessor.

1
APP ENDIX
G
Chapter 1
made.
the program in
to main memory.
Main memory
1.7 Input device
1.8 Output device

707
10100001
1
in the program.
10100001
11011100
and so forth... CPU
3
Main memory
(RAM)

cause an error.
2

language program

program program

APP ENDIX
F
mov eax, Z 10100001
add eax, 2
mov Y, eax 10111000
the pip Utility

Assembler
and so forth...
705

Blaise Pascal.

>>> print(x)
>>> print(x)
5.0
program
print ("Hello
>>> x = square_root(25) 10011110
>>> y = tangent(45)
>>> print(x)
5.0
>>> print(y)
1.6197751905438615
Machine language
CPU
program
>>> x = sqrt(25)
>>> print(x)
programs.
5.0
>>>
program CPU module:
Machine language
>>> x = sqrt(25)
>>> print(x)
5.0
>>> print(a)
Wildcard Imports
>>>
>>>
and/or classes.
Checkpoint
executes it?
APP ENDIX
E
Statement 1.23
1.5 Using Python
import math
>>> import math
>>> print(x)
and install Python.
5.0
shown here:
701
1.5 Using Python 43
Interactive Mode
ing command:
python

Python 3.5.1 (v3.5.1:37a07cee5969, Dec 6 2015, 01:38:48)
>>>
prompt:
>>>
To be or not to be
>>>
press Ctrl-D.
as shown.
Know what I mean?
print('Wink wink')
GLOBAL GLOBAL
EDITION EDITION


FOURTH EDITION

Tony Gaddis

744 Credits
VERSION SPECIFIED.
and password.
IMPORTANT:

Credits


743
742 Index

STARTING OUT WITH

ValueError, 349–350, 354, 355, 356, 358, 382
P
how to use, 274–276 Button, 622, 630–633
®
Values
Menu, 622
Menubutton, 622

data attribute, 514
Message, 622
Variables Writing
names, sample, 66
Index 741

740 Index

if, 131–139 writing, 575
Step values, 194
precedence, 79
Superclasses
P
®
defined, 59
Syntax errors
correcting, 54
Strings
defined, 41
reporting, 691
defined, 59
Tony Gaddis
Index 739
KAO Two
10 9 8 7 6 5 4 3 2 1
738 Index


generation, 193
recursive call, 605
Recursion form, 272
loops vs., 602–603, 613 Ruby, 39
5
Index 737

squares.py, 195
string_input.py, 72
736 Index


coin_demo5.py, 533
2.4 Comments 61
7

6.4 Exceptions 346
Output devices, 28
Overhead, 602
P
pack method, 625–627, 629, 634
instances, 515, 532–554
Pascal, 39

nested, 212–218, 401 defined, 262, 286
using, 287
732 Index

VideoNote
J elements, 366
of strings, 366
plotting, 406–413 and, 156–158
Index 731

Integers
and alias, 703
formatting, 94–95
wildcard, 702
list of, 366
Indentation
IDLE, default, 690
color coding, 689
defined, 45
Exceptions
resources, 692
Indexes
characters, 432
defined, 368
shell window, 686
invalid, 375, 378, 433, 438
starting, 685–687
index method, 379–381 266–267, 371–372, 375
647–648 Python, 42
730 Index


Function call
defined, 235
functions

nested, 74 609–610
GUI programs
degrees(), 285
float(), 73, 74, 75, 86 creating, 621–624, 640
floor(), 285
len, 369, 434, 465–466 text display, 624–627
log(), 285
message, 235–240, 599–601 H
13
altogether.
initializing, 518


defined, 33 Buttons
format, 63
Binary files, 311
18 Preface
topics.
Supplements
repetition, 367
defined, 76 Actions
defined, 203
725
13.20 (139, 479)
Haris Ribic


e) create_oval
f) create_arc
Champaign
Bob Husson
Diane Innes
Daniel Jinguji
Gary Marrer
Keith Mehl
Chabot College
interacts
Khyat Sharma
13.13 tkinter

10.13 10
methods.
class do?
Chapter 11
general object.

I’m a potato.
9.27 {10, 20, 30, 100, 200, 300}
9.28 {3, 4}
9.29 {1, 2}
9.30 {5, 6}
9.31 {'a', 'd'}
9.34 'wb'
9.35 'rb'

9.37 pickle.dump
9.38 pickle.load

Chapter 10
operate on.
Chapter 9
9.1 Key and value
9.2 The key
CHAPTE R
1
and Programming 9.5

9.6
ccc

9.8 3
TOPICS 9.9 1
tuples.
1.1 Introduction
9.14 Unordered
'y', and 'z'.
23
Chapter 8
print(letter)
8.2 0
8.3 9
print('Digit')
print('No digit')
count += 1
Main memory
Best Pictures here/

Nikita Rogul/
Shutterstock
Shutterstock
Unit
iko/Shutterstock
Shutterstock
Output
[0, 0, 0, 0], [0, 0, 0, 0]]
Chiyacat/
Peter Guess/
Shutterstock
for c in range(2):
Input
Devices
jocic/Shutterstock
Main Memory
modified.
Input devices
7.27 A line graph
6.21 IOError
6.22 ValueError
Chapter 7
7.1 [1, 2, 99, 4, 5]
7.2 [0, 1, 2]
7.3 [10, 10, 10, 10, 10]
7.4 1
3
5
7
9
7.5 4

7.7 [1, 2, 3]
[10, 20, 30]
[1, 2, 3, 10, 20, 30]
7.8 [1, 2, 3]
[10, 20, 30, 1, 2, 3]
7.9 [2, 3]
7.10 [2, 3]
7.11 [1]
7.12 [1, 2, 3, 4, 5]
7.13 [3, 4, 5]

outfile.close()
while line != '':
print(line)
output.
including, 1.0.
Output Devices

5.34 import math

Chapter 6
programs:
Checkpoint
declared.
the loop ends.
4.15 15
4.16 15
5
b) days_left −= 5
c) price *= 10
d) price /= 2
4.24 None OFF

Chapter 5
it is needed.
10011101
and so forth.
10011101 Chapter 4
2
22
23 repeats
24
26
4.5 Before
2
8
16 4.9 0
32 1
64
128
2
3
4
5
5

100
10011101 200
300
1 400
500
4
8
16
4.12 10
9
8
128
7
1 + 4 + 8 + 16 + 128 = 157 6
print('Two')
elif number == 3:
else:
print('Unknown')

3.15 F
T 0 0 0
Position
F values 128 64 32 16 8 4 2 1
F
T 128 + 16 + 8 + 4 + 1 = 157
T
T
F
F
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
3.20 True or False

Position
values
32768 16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1
32768 + 16384 + 8192 + 4096 + 2048 + 1024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 65535
if turtle.isdown():
Chapter 3
1 1
A
0 0 0 0 0 0
condition is false.

9 + 14 * 2 − 6 31
(6 + 2) * 3 24
9 + 12 * (8 − 3) 69
10111
010
10
01
0
2.20 4
00
10
101
101
2.21 1
to the function.
number?

Adding two numbers
1.24 A compiler
10110000 customer

microprocessor.

1
APP ENDIX
G
Chapter 1
made.
the program in
to main memory.
Main memory
1.7 Input device
1.8 Output device

707
10100001
1
in the program.
10100001
11011100
and so forth... CPU
3
Main memory
(RAM)

cause an error.
2

language program

program program

APP ENDIX
F
mov eax, Z 10100001
add eax, 2
mov Y, eax 10111000
the pip Utility

Assembler
and so forth...
705

Blaise Pascal.

>>> print(x)
>>> print(x)
5.0
program
print ("Hello
>>> x = square_root(25) 10011110
>>> y = tangent(45)
>>> print(x)
5.0
>>> print(y)
1.6197751905438615
Machine language
CPU
program
>>> x = sqrt(25)
>>> print(x)
programs.
5.0
>>>
program CPU module:
Machine language
>>> x = sqrt(25)
>>> print(x)
5.0
>>> print(a)
Wildcard Imports
>>>
>>>
and/or classes.
Checkpoint
executes it?
APP ENDIX
E
Statement 1.23
1.5 Using Python
import math
>>> import math
>>> print(x)
and install Python.
5.0
shown here:
701
1.5 Using Python 43
Interactive Mode
ing command:
python

Python 3.5.1 (v3.5.1:37a07cee5969, Dec 6 2015, 01:38:48)
>>>
prompt:
>>>
To be or not to be
>>>
press Ctrl-D.
as shown.
Know what I mean?
print('Wink wink')
GLOBAL GLOBAL
EDITION EDITION


FOURTH EDITION

Tony Gaddis

744 Credits
VERSION SPECIFIED.
and password.
IMPORTANT:

Credits


743
742 Index

STARTING OUT WITH

ValueError, 349–350, 354, 355, 356, 358, 382
P
how to use, 274–276 Button, 622, 630–633
®
Values
Menu, 622
Menubutton, 622

data attribute, 514
Message, 622
Variables Writing
names, sample, 66
Index 741

740 Index

if, 131–139 writing, 575
Step values, 194
precedence, 79
Superclasses
P
®
defined, 59
Syntax errors
correcting, 54
Strings
defined, 41
reporting, 691
defined, 59
Tony Gaddis
Index 739
KAO Two
10 9 8 7 6 5 4 3 2 1
738 Index


generation, 193
recursive call, 605
Recursion form, 272
loops vs., 602–603, 613 Ruby, 39
5
Index 737

squares.py, 195
string_input.py, 72
736 Index


coin_demo5.py, 533
2.4 Comments 61
7

6.4 Exceptions 346
Output devices, 28
Overhead, 602
P
pack method, 625–627, 629, 634
instances, 515, 532–554
Pascal, 39

nested, 212–218, 401 defined, 262, 286
using, 287
732 Index

VideoNote
J elements, 366
of strings, 366
plotting, 406–413 and, 156–158
Index 731

Integers
and alias, 703
formatting, 94–95
wildcard, 702
list of, 366
Indentation
IDLE, default, 690
color coding, 689
defined, 45
Exceptions
resources, 692
Indexes
characters, 432
defined, 368
shell window, 686
invalid, 375, 378, 433, 438
starting, 685–687
index method, 379–381 266–267, 371–372, 375
647–648 Python, 42
730 Index


Function call
defined, 235
functions

nested, 74 609–610
GUI programs
degrees(), 285
float(), 73, 74, 75, 86 creating, 621–624, 640
floor(), 285
len, 369, 434, 465–466 text display, 624–627
log(), 285
message, 235–240, 599–601 H
13
altogether.
initializing, 518


defined, 33 Buttons
format, 63
Binary files, 311
18 Preface
topics.
Supplements
repetition, 367
defined, 76 Actions
defined, 203
725
13.20 (139, 479)
Haris Ribic


e) create_oval
f) create_arc
Champaign
Bob Husson
Diane Innes
Daniel Jinguji
Gary Marrer
Keith Mehl
Chabot College
interacts
Khyat Sharma
13.13 tkinter

10.13 10
methods.
class do?
Chapter 11
general object.

I’m a potato.
9.27 {10, 20, 30, 100, 200, 300}
9.28 {3, 4}
9.29 {1, 2}
9.30 {5, 6}
9.31 {'a', 'd'}
9.34 'wb'
9.35 'rb'

9.37 pickle.dump
9.38 pickle.load

Chapter 10
operate on.
Chapter 9
9.1 Key and value
9.2 The key
CHAPTE R
1
and Programming 9.5

9.6
ccc

9.8 3
TOPICS 9.9 1
tuples.
1.1 Introduction
9.14 Unordered
'y', and 'z'.
23
Chapter 8
print(letter)
8.2 0
8.3 9
print('Digit')
print('No digit')
count += 1
Main memory
Best Pictures here/

Nikita Rogul/
Shutterstock
Shutterstock
Unit
iko/Shutterstock
Shutterstock
Output
[0, 0, 0, 0], [0, 0, 0, 0]]
Chiyacat/
Peter Guess/
Shutterstock
for c in range(2):
Input
Devices
jocic/Shutterstock
Main Memory
modified.
Input devices
7.27 A line graph
6.21 IOError
6.22 ValueError
Chapter 7
7.1 [1, 2, 99, 4, 5]
7.2 [0, 1, 2]
7.3 [10, 10, 10, 10, 10]
7.4 1
3
5
7
9
7.5 4

7.7 [1, 2, 3]
[10, 20, 30]
[1, 2, 3, 10, 20, 30]
7.8 [1, 2, 3]
[10, 20, 30, 1, 2, 3]
7.9 [2, 3]
7.10 [2, 3]
7.11 [1]
7.12 [1, 2, 3, 4, 5]
7.13 [3, 4, 5]

outfile.close()
while line != '':
print(line)
output.
including, 1.0.
Output Devices

5.34 import math

Chapter 6
programs:
Checkpoint
declared.
the loop ends.
4.15 15
4.16 15
5
b) days_left −= 5
c) price *= 10
d) price /= 2
4.24 None OFF

Chapter 5
it is needed.
10011101
and so forth.
10011101 Chapter 4
2
22
23 repeats
24
26
4.5 Before
2
8
16 4.9 0
32 1
64
128
2
3
4
5
5

100
10011101 200
300
1 400
500
4
8
16
4.12 10
9
8
128
7
1 + 4 + 8 + 16 + 128 = 157 6
print('Two')
elif number == 3:
else:
print('Unknown')

3.15 F
T 0 0 0
Position
F values 128 64 32 16 8 4 2 1
F
T 128 + 16 + 8 + 4 + 1 = 157
T
T
F
F
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
3.20 True or False

Position
values
32768 16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1
32768 + 16384 + 8192 + 4096 + 2048 + 1024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 65535
if turtle.isdown():
Chapter 3
1 1
A
0 0 0 0 0 0
condition is false.

9 + 14 * 2 − 6 31
(6 + 2) * 3 24
9 + 12 * (8 − 3) 69
10111
010
10
01
0
2.20 4
00
10
101
101
2.21 1
to the function.
number?

Adding two numbers
1.24 A compiler
10110000 customer

microprocessor.

1
APP ENDIX
G
Chapter 1
made.
the program in
to main memory.
Main memory
1.7 Input device
1.8 Output device

707
10100001
1
in the program.
10100001
11011100
and so forth... CPU
3
Main memory
(RAM)

cause an error.
2

language program

program program

APP ENDIX
F
mov eax, Z 10100001
add eax, 2
mov Y, eax 10111000
the pip Utility

Assembler
and so forth...
705

Blaise Pascal.

>>> print(x)
>>> print(x)
5.0
program
print ("Hello
>>> x = square_root(25) 10011110
>>> y = tangent(45)
>>> print(x)
5.0
>>> print(y)
1.6197751905438615
Machine language
CPU
program
>>> x = sqrt(25)
>>> print(x)
programs.
5.0
>>>
program CPU module:
Machine language
>>> x = sqrt(25)
>>> print(x)
5.0
>>> print(a)
Wildcard Imports
>>>
>>>
and/or classes.
Checkpoint
executes it?
APP ENDIX
E
Statement 1.23
1.5 Using Python
import math
>>> import math
>>> print(x)
and install Python.
5.0
shown here:
701
1.5 Using Python 43
Interactive Mode
ing command:
python

Python 3.5.1 (v3.5.1:37a07cee5969, Dec 6 2015, 01:38:48)
>>>
prompt:
>>>
To be or not to be
>>>
press Ctrl-D.
as shown.
Know what I mean?
print('Wink wink')
GLOBAL GLOBAL
EDITION EDITION


FOURTH EDITION

Tony Gaddis

744 Credits
VERSION SPECIFIED.
and password.
IMPORTANT:

Credits


743
742 Index

STARTING OUT WITH

ValueError, 349–350, 354, 355, 356, 358, 382
P
how to use, 274–276 Button, 622, 630–633
®
Values
Menu, 622
Menubutton, 622

data attribute, 514
Message, 622
Variables Writing
names, sample, 66
Index 741

740 Index

if, 131–139 writing, 575
Step values, 194
precedence, 79
Superclasses
P
®
defined, 59
Syntax errors
correcting, 54
Strings
defined, 41
reporting, 691
defined, 59
Tony Gaddis
Index 739
KAO Two
10 9 8 7 6 5 4 3 2 1
738 Index


generation, 193
recursive call, 605
Recursion form, 272
loops vs., 602–603, 613 Ruby, 39
5
Index 737

squares.py, 195
string_input.py, 72
736 Index


coin_demo5.py, 533
2.4 Comments 61
7

6.4 Exceptions 346
Output devices, 28
Overhead, 602
P
pack method, 625–627, 629, 634
instances, 515, 532–554
Pascal, 39

nested, 212–218, 401 defined, 262, 286
using, 287
732 Index

VideoNote
J elements, 366
of strings, 366
plotting, 406–413 and, 156–158
Index 731

Integers
and alias, 703
formatting, 94–95
wildcard, 702
list of, 366
Indentation
IDLE, default, 690
color coding, 689
defined, 45
Exceptions
resources, 692
Indexes
characters, 432
defined, 368
shell window, 686
invalid, 375, 378, 433, 438
starting, 685–687
index method, 379–381 266–267, 371–372, 375
647–648 Python, 42
730 Index


Function call
defined, 235
functions

nested, 74 609–610
GUI programs
degrees(), 285
float(), 73, 74, 75, 86 creating, 621–624, 640
floor(), 285
len, 369, 434, 465–466 text display, 624–627
log(), 285
message, 235–240, 599–601 H
13
altogether.
initializing, 518


defined, 33 Buttons
format, 63
Binary files, 311
18 Preface
topics.
Supplements
repetition, 367
defined, 76 Actions
defined, 203
725
13.20 (139, 479)
Haris Ribic


e) create_oval
f) create_arc
Champaign
Bob Husson
Diane Innes
Daniel Jinguji
Gary Marrer
Keith Mehl
Chabot College
interacts
Khyat Sharma
13.13 tkinter

10.13 10
methods.
class do?
Chapter 11
general object.

I’m a potato.
9.27 {10, 20, 30, 100, 200, 300}
9.28 {3, 4}
9.29 {1, 2}
9.30 {5, 6}
9.31 {'a', 'd'}
9.34 'wb'
9.35 'rb'

9.37 pickle.dump
9.38 pickle.load

Chapter 10
operate on.
Chapter 9
9.1 Key and value
9.2 The key
CHAPTE R
1
and Programming 9.5

9.6
ccc

9.8 3
TOPICS 9.9 1
tuples.
1.1 Introduction
9.14 Unordered
'y', and 'z'.
23
Chapter 8
print(letter)
8.2 0
8.3 9
print('Digit')
print('No digit')
count += 1
Main memory
Best Pictures here/

Nikita Rogul/
Shutterstock
Shutterstock
Unit
iko/Shutterstock
Shutterstock
Output
[0, 0, 0, 0], [0, 0, 0, 0]]
Chiyacat/
Peter Guess/
Shutterstock
for c in range(2):
Input
Devices
jocic/Shutterstock
Main Memory
modified.
Input devices
7.27 A line graph
6.21 IOError
6.22 ValueError
Chapter 7
7.1 [1, 2, 99, 4, 5]
7.2 [0, 1, 2]
7.3 [10, 10, 10, 10, 10]
7.4 1
3
5
7
9
7.5 4

7.7 [1, 2, 3]
[10, 20, 30]
[1, 2, 3, 10, 20, 30]
7.8 [1, 2, 3]
[10, 20, 30, 1, 2, 3]
7.9 [2, 3]
7.10 [2, 3]
7.11 [1]
7.12 [1, 2, 3, 4, 5]
7.13 [3, 4, 5]

outfile.close()
while line != '':
print(line)
output.
including, 1.0.
Output Devices

5.34 import math

Chapter 6
programs:
Checkpoint
declared.
the loop ends.
4.15 15
4.16 15
5
b) days_left −= 5
c) price *= 10
d) price /= 2
4.24 None OFF

Chapter 5
it is needed.
10011101
and so forth.
10011101 Chapter 4
2
22
23 repeats
24
26
4.5 Before
2
8
16 4.9 0
32 1
64
128
2
3
4
5
5

100
10011101 200
300
1 400
500
4
8
16
4.12 10
9
8
128
7
1 + 4 + 8 + 16 + 128 = 157 6
print('Two')
elif number == 3:
else:
print('Unknown')

3.15 F
T 0 0 0
Position
F values 128 64 32 16 8 4 2 1
F
T 128 + 16 + 8 + 4 + 1 = 157
T
T
F
F
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
3.20 True or False

Position
values
32768 16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1
32768 + 16384 + 8192 + 4096 + 2048 + 1024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 65535
if turtle.isdown():
Chapter 3
1 1
A
0 0 0 0 0 0
condition is false.

9 + 14 * 2 − 6 31
(6 + 2) * 3 24
9 + 12 * (8 − 3) 69
10111
010
10
01
0
2.20 4
00
10
101
101
2.21 1
to the function.
number?

Adding two numbers
1.24 A compiler
10110000 customer

microprocessor.

1
APP ENDIX
G
Chapter 1
made.
the program in
to main memory.
Main memory
1.7 Input device
1.8 Output device

707
10100001
1
in the program.
10100001
11011100
and so forth... CPU
3
Main memory
(RAM)

cause an error.
2

language program

program program

APP ENDIX
F
mov eax, Z 10100001
add eax, 2
mov Y, eax 10111000
the pip Utility

Assembler
and so forth...
705

Blaise Pascal.

>>> print(x)
>>> print(x)
5.0
program
print ("Hello
>>> x = square_root(25) 10011110
>>> y = tangent(45)
>>> print(x)
5.0
>>> print(y)
1.6197751905438615
Machine language
CPU
program
>>> x = sqrt(25)
>>> print(x)
programs.
5.0
>>>
program CPU module:
Machine language
>>> x = sqrt(25)
>>> print(x)
5.0
>>> print(a)
Wildcard Imports
>>>
>>>
and/or classes.
Checkpoint
executes it?
APP ENDIX
E
Statement 1.23
1.5 Using Python
import math
>>> import math
>>> print(x)
and install Python.
5.0
shown here:
701
1.5 Using Python 43
Interactive Mode
ing command:
python

Python 3.5.1 (v3.5.1:37a07cee5969, Dec 6 2015, 01:38:48)
>>>
prompt:
>>>
To be or not to be
>>>
press Ctrl-D.
as shown.
Know what I mean?
print('Wink wink')

Starting Out With Python: Global Edition Global Edition

Uploaded by

Document Informationclick to expand document information

Document Informationclick to expand document information

Copyright:

Available Formats

Starting Out With Python: Global Edition Global Edition

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Starting Out With Python: Global Edition Global Edition

Uploaded by

Copyright:

Available Formats

GLOBAL GLOBAL

For these Global Editions, the editorial team at Pearson has

Starting Out with Python®

This is a special edition of an established title widely

Pearson Global Edition

For technical support go to https://support.pearson.com/getsupport

Cover Image © Africa Studio/Shutterstock

MICROSOFT AND/OR ITS RESPECTIVE SUPPLIERS MAKE NO REPRESENTATIONS ABOUT THE

V reassignment to different type, 70

STARTING OUT WITH

GLOBA L EDITION Boolean, 281–282

Toplevel widget, 622 turtle.speed(speed) function, 108

Statements (continued) polymorphism, 588–594

Random numbers (continued) problem solving with, 602–606

Contents at a Glance default, 193

Programs (examples in this book) (continued) write_number_list.py, 397

Programs (examples in this book) (continued) grader.py, 152–153

Contents coin_demo4.py, 526

Priming reads, 208, 330 assembly, 37 Chapter 4 Repetition Structures 181

Logical operators (continued) flash, 28 Appendix A Installing Python 681

isinstance function, 591–594 Listbox widget, 622

I searching list items with, 376–377

Formatting recursive. See Recursive functions

Preface Frame widget, 622, 629

examples of, 236, 237 G

CD drives, 28 in modules, storing, 525–527 Chapter 11: Inheritance

Appendix G: Answers to Checkpoints append method nested, 150–151

Acknowledgments 13.15 You would use radio buttons.

James Atlas Vince O enback 13.22 a) create_oval

James Carrier Smiljana Petrovic c) create_rectangle

10.9 By starting the attribute’s name with two underscores

11.5 I’m a vegetable.

9.31 {'a', 'd'}

9.32 set2 is a subset of set1, and set1 is a superset of set2.

9.36 The pickle module

This page intentionally left blank

and Programming 9.5

You can use the in operator to test for a specific key.

Best Pictures here/

7.3 [10, 10, 10, 10, 10]

7.6 Use the built-in len function.

7.14 Jasmine's family:

5.32 a) do_something Software

5.36 angle = math.radians(45) System Software

The number 77 stored in a byte. The letter A stored in a byte.

Figure 1-10 Determining the value of 10011101 4.11 0

3.14 It is an expression that is created by using a logical operator to combine two 1 1 1 1 1

3.20 True or False

Storing Characters 2.38 turtle.bgcolor('black')

2.16 0 Other Types of Data

2.29 DISCOUNT_PERCENTAGE = 0.1

2.8 print("Python's the best!")

2.14 The value is val.

2.15 value1 will reference an int. value2 will reference a float.

1.10 A utility program

Figure 1-16 The fetch-decode-execute cycle

From Machine Language to Assembly Language