book

Python and Algorithmic Thinking for the Complete Beginner

Name: Python and Algorithmic Thinking for the Complete Beginner
Author: Aristides Bouras
ISBN: 9781836209270

by Aristides Bouras

June 2024

Beginner to intermediate

908 pages

15h 59m

English

Packt Publishing

Read now

Unlock full access

Table of Contents
Preface
About the Author
Acknowledgments
How This Book is OrganizedWho Should Buy This Book?
Conventions Used in This Book
How to Report ErrataWhere to Download Material About this BookIf you Like this Book
Part I Introductory Knowledge
Chapter 1 How a Computer Works
1.1 Introduction1.2 What is Hardware?1.3 What is Software?1.4 How a Computer Executes (Runs) a Program1.5 Compilers and Interpreters1.6 What is Source Code?1.7 Review Questions: True/False1.8 Review Questions: Multiple Choice
Chapter 2 Python and Integrated Development Environments
2.1 What is Python?2.2 What is the Difference Between a Script and a Program?2.3 Why You Should Learn Python2.4 How Python Works2.5 Integrated Development Environments2.6 IDLE2.7 Microsoft Visual Studio
Chapter 3 Software Packages to Install
3.1 What to Install
Review in “Introductory Knowledge”
Review Crossword PuzzlesReview Questions

Part II Getting Started with Python
Chapter 4 Introduction to Basic Algorithmic Concepts
4.1 What is an Algorithm?4.2 The Algorithm for Making a Cup of Tea4.3 Properties of an Algorithm4.4 Okay About Algorithms. But What is a Computer Program Anyway?4.5 The Three Parties!4.6 The Three Main Stages Involved in Creating an Algorithm4.7 FlowchartsExercise 4.7-1 Finding the Average Value of Three Numbers4.8 What are ”Reserved Words”?4.9 What is the Difference Between a Statement and a Command?4.10 What is Structured Programming?4.11 The Three Fundamental Control StructuresExercise 4.11-1 Understanding Control Structures Using Flowcharts4.12 Your First Python Program4.13 What is the Difference Between a Syntax Error, a Logic Error, and a Runtime Error?4.14 What “Debugging” Means4.15 Commenting Your Code4.16 User-Friendly Programs4.17 Review Questions: True/False4.18 Review Questions: Multiple Choice
Chapter 5 Variables and Constants
5.1 What is a Variable?5.2 What is a Constant?5.3 How Many Types of Variables and Constants Exist?5.4 Rules and Conventions for Naming Variables and Constants in Python5.5 What Does the Phrase “Declare a Variable” Mean?5.6 How to Declare Variables in Python5.7 How to Declare Constants in Python5.8 Review Questions: True/False5.9 Review Questions: Multiple Choice5.10 Review Exercises
Chapter 6 Handling Input and Output
6.1 How to Output Messages and Results to a User's Screen?6.2 How to Alter the Default Behavior of a print Statement?6.3 How to Prompt the User to Enter Data?6.4 Review Questions: True/False6.5 Review Questions: Multiple Choice
Chapter 7 Operators
7.1 The Value Assignment Operator7.2 Arithmetic Operators7.3 What is the Precedence of Arithmetic Operators?7.4 Compound Assignment OperatorsExercise 7.4-1 Which Python Statements are Syntactically Correct?Exercise 7.4-2 Finding Variable Types7.5 String OperatorsExercise 7.5-1 Concatenating Names7.6 Review Questions: True/False7.7 Review Questions: Multiple Choice7.8 Review Exercises
Chapter 8 Trace Tables
8.1 What is a Trace Table?Exercise 8.1-1 Creating a Trace TableExercise 8.1-2 Creating a Trace TableExercise 8.1-3 Swapping Values of VariablesExercise 8.1-4 Swapping Values of Variables – An Alternative Approach8.2 Review Questions: True/False8.3 Review Exercises
Chapter 9 Using IDLE or Visual Studio Code
9.1 Write, Execute and Debug Python Programs
Review in “Getting Started with Python”
Review Crossword PuzzlesReview Questions
Part III Sequence Control Structures
Chapter 10 Introduction to Sequence Control Structures
10.1 What is the Sequence Control Structure?Exercise 10.1-1 Calculating the Area of a RectangleExercise 10.1-2 Calculating the Area of a CircleExercise 10.1-3 Where is the Car? Calculating Distance TraveledExercise 10.1-4 Kelvin to FahrenheitExercise 10.1-5 Calculating Sales TaxExercise 10.1-6 Calculating a Sales DiscountExercise 10.1-7 Calculating a Sales Discount and Tax10.2 Review Exercises
Chapter 11 Manipulating Numbers
11.1 Introduction11.2 Useful Mathematical Functions (Subprograms), and MoreExercise 11.2-1 Calculating the Distance Between Two PointsExercise 11.2-2 How Far Did the Car Travel?11.3 Review Questions: True/False11.4 Review Questions: Multiple Choice11.5 Review Exercises
Chapter 12 Complex Mathematical Expressions
12.1 Writing Complex Mathematical ExpressionsExercise 12.1-1 Representing Mathematical Expressions in PythonExercise 12.1-2 Writing a Mathematical Expression in PythonExercise 12.1-3 Writing a Complex Mathematical Expression in Python12.2 Review Exercises
Chapter 13 Exercises With a Quotient and a Remainder
13.1 IntroductionExercise 13.1-1 Calculating the Quotient and Remainder of Integer DivisionExercise 13.1-2 Finding the Sum of DigitsExercise 13.1-3 Displaying an Elapsed TimeExercise 13.1-4 Reversing a Number13.2 Review Exercises
Chapter 14 Manipulating Strings
14.1 Introduction14.2 The Position of a Character in a String14.3 Useful String Functions/Methods (Subprograms), and MoreExercise 14.3-1 Displaying a String BackwardsExercise 14.3-2 Switching the Order of NamesExercise 14.3-3 Creating a Login IDExercise 14.3-4 Creating a Random WordExercise 14.3-5 Finding the Sum of Digits14.4 Review Questions: True/False14.5 Review Questions: Multiple Choice14.6 Review Exercises
Review in “Sequence Control Structures”
Review Crossword PuzzleReview Questions
Part IV Decision Control Structures
Chapter 15 Making Questions
15.1 Introduction15.2 What is a Boolean Expression?15.3 How to Write Simple Boolean ExpressionsExercise 15.3-1 Filling in the Table15.4 Logical Operators and Complex Boolean ExpressionsExercise 15.4-1 Calculating the Results of Complex Boolean Expressions15.5 Python's Membership Operators15.6 Assigning the Result of a Boolean Expression to a Variable15.7 What is the Order of Precedence of Logical Operators?Exercise 15.7-1 Filling in the Truth TableExercise 15.7-2 Converting English Sentences to Boolean Expressions15.8 What is the Order of Precedence of Arithmetic, Comparison, Membership, and Logical Operators?15.9 How to Negate Boolean ExpressionsExercise 15.9-1 Negating Boolean Expressions15.10 Review Questions: True/False15.11 Review Questions: Multiple Choice15.12 Review Exercises
Chapter 16 The Single-Alternative Decision Structure
16.1 The Single-Alternative Decision StructureExercise 16.1-1 Trace Tables and Single-Alternative Decision StructuresExercise 16.1-2 The Absolute Value of a Number16.2 Review Questions: True/False16.3 Review Questions: Multiple Choice16.4 Review Exercises
Chapter 17 The Dual-Alternative Decision Structure
17.1 The Dual-Alternative Decision StructureExercise 17.1-1 Finding the Output MessageExercise 17.1-2 Trace Tables and Dual-Alternative Decision StructuresExercise 17.1-3 Who is the Greatest?Exercise 17.1-4 Finding Odd and Even NumbersExercise 17.1-5 Weekly Wages17.2 Review Questions: True/False17.3 Review Questions: Multiple Choice17.4 Review Exercises
Chapter 18 The Multiple-Alternative Decision Structure
18.1 The Multiple-Alternative Decision StructureExercise 18.1-1 Trace Tables and Multiple-Alternative Decision StructuresExercise 18.1-2 The Days of the WeekExercise 18.1-3 Counting the Digits18.2 Review Questions: True/False18.3 Review Exercises
Chapter 19 Nested Decision Control Structures
19.1 What are Nested Decision Control Structures?Exercise 19.1-1 Trace Tables and Nested Decision Control StructuresExercise 19.1-2 Positive, Negative or Zero?19.2 Review Questions: True/False19.3 Review Exercises
Chapter 20 More about Flowcharts with Decision Control Structures
20.1 Introduction20.2 Converting Python Programs to FlowchartsExercise 20.2-1 Designing the FlowchartExercise 20.2-2 Designing the FlowchartExercise 20.2-3 Designing the Flowchart20.3 A Mistake That You Will Probably Make!20.4 Converting Flowcharts to Python ProgramsExercise 20.4-1 Writing the Python ProgramExercise 20.4-2 Writing the Python ProgramExercise 20.4-3 Writing the Python Program20.5 Review Exercises
Chapter 21 Tips and Tricks with Decision Control Structures
21.1 Introduction21.2 Choosing a Decision Control Structure21.3 Streamlining the Decision Control StructureExercise 21.3-1 “Shrinking” the AlgorithmExercise 21.3-2 “Shrinking” the Python ProgramExercise 21.3-3 “Shrinking” the Algorithm21.4 Logical Operators – to Use, or not to Use: That is the Question!Exercise 21.4-1 Rewriting the CodeExercise 21.4-2 Rewriting the Code21.5 Merging Two or More Single-Alternative Decision StructuresExercise 21.5-1 Merging the Decision Control StructuresExercise 21.5-2 Merging the Decision Control Structures21.6 Replacing Two Single-Alternative Decision Structures with a Dual-Alternative OneExercise 21.6-1 “Merging” the Decision Control Structures21.7 Put the Boolean Expressions Most Likely to be True FirstExercise 21.7-1 Rearranging the Boolean Expressions21.8 Review Questions: True/False21.9 Review Questions: Multiple Choice21.10 Review Exercises
Chapter 22 More with Decision Control Structures
22.1 Simple Exercises with Decision Control StructuresExercise 22.1-1 Is it an Integer?Exercise 22.1-2 Validating Data Input and Finding Odd and Even NumbersExercise 22.1-3 Where is the Tollkeeper?Exercise 22.1-4 The Most Scientific Calculator Ever!Exercise 22.1-5 Converting Gallons to Liters, and Vice VersaExercise 22.1-6 Converting Gallons to Liters, and Vice Versa (with Data Validation)22.2 Finding Minimum and Maximum Values with Decision Control StructuresExercise 22.2-1 Finding the Name of the Heaviest Person22.3 Decision Control Structures in Solving Mathematical ProblemsExercise 22.3-1 Finding the Value of yExercise 22.3-2 Finding the Values of yExercise 22.3-3 Solving the Linear Equation ax + b = 0Exercise 22.3-4 Solving the Quadratic Equation ax2 + bx + c = 022.4 Exercises with Series of Consecutive Ranges of ValuesExercise 22.4-1 Calculating the DiscountExercise 22.4-2 Validating Data Input and Calculating the DiscountExercise 22.4-3 Sending a ParcelExercise 22.4-4 Finding the Values of yExercise 22.4-5 Progressive Rates and Electricity ConsumptionExercise 22.4-6 Progressive Rates and Text Messaging Services22.5 Exercises of a General Nature with Decision Control StructuresExercise 22.5-1 Finding a Leap YearExercise 22.5-2 Displaying the Days of the MonthExercise 22.5-3 Checking for Proper Capitalization and PunctuationExercise 22.5-4 Is the Number a Palindrome?22.6 Boolean Expressions Reference and Handy Tips22.7 Review Exercises
Review in “Decision Control Structures”
Review Crossword PuzzleReview Questions
Part V Loop Control Structures
Chapter 23 Introduction to Loop Control Structures
23.1 What is a Loop Control Structure?23.2 From Sequence Control to Loop Control Structures23.3 Review Questions: True/False
Chapter 24 Pre-Test, Mid-Test and Post-Test Loop Structures
24.1 The Pre-Test Loop StructureExercise 24.1-1 Designing the Flowchart and Counting the Total Number of IterationsExercise 24.1-2 Counting the Total Number of IterationsExercise 24.1-3 Counting the Total Number of IterationsExercise 24.1-4 Counting the Total Number of IterationsExercise 24.1-5 Finding the Sum of Four NumbersExercise 24.1-6 Finding the Sum of Odd NumbersExercise 24.1-7 Finding the Sum of N NumbersExercise 24.1-8 Finding the Sum of an Unknown Quantity of NumbersExercise 24.1-9 Finding the Product of 20 Numbers24.2 The Post-Test Loop StructureExercise 24.2-1 Designing the Flowchart and Counting the Total Number of IterationsExercise 24.2-2 Counting the Total Number of IterationsExercise 24.2-3 Designing the Flowchart and Counting the Total Number of IterationsExercise 24.2-4 Counting the Total Number of IterationsExercise 24.2-5 Finding the Product of N Numbers24.3 The Mid-Test Loop StructureExercise 24.3-1 Designing the Flowchart and Counting the Total Number of Iterations24.4 Review Questions: True/False24.5 Review Questions: Multiple Choice24.6 Review Exercises
Chapter 25 Definite Loops
25.1 The for statementExercise 25.1-1 Creating the Trace TableExercise 25.1-2 Creating the Trace TableExercise 25.1-3 Counting the Total Number of IterationsExercise 25.1-4 Finding the Sum of Four NumbersExercise 25.1-5 Finding the Square Roots from 0 to NExercise 25.1-6 Finding the Sum of 1 + 2 + 3 + … + 100Exercise 25.1-7 Finding the Product of 2 × 4 × 6 × 8 × 10Exercise 25.1-8 Finding the Sum of 22 + 42 + 62 + … (2N)2Exercise 25.1-9 Finding the Sum of 33 + 66 + 99 + … (3N)3NExercise 25.1-10 Finding the Average Value of Positive NumbersExercise 25.1-11 Counting the Vowels25.2 Rules that Apply to For-LoopsExercise 25.2-1 Finding the Sum of N Numbers25.3 Review Questions: True/False25.4 Review Questions: Multiple Choice25.5 Review Exercises
Chapter 26 Nested Loop Control Structures
26.1 What is a Nested Loop?Exercise 26.1-1 Say “Hello Zeus”. Counting the Total Number of Iterations.Exercise 26.1-2 Creating the Trace Table26.2 Rules that Apply to Nested LoopsExercise 26.2-1 Violating the First RuleExercise 26.2-2 Violating the Second Rule26.3 Review Questions: True/False26.4 Review Questions: Multiple Choice26.5 Review Exercises
Chapter 27 More about Flowcharts with Loop Control Structures
27.1 Introduction27.2 Converting Python Programs to FlowchartsExercise 27.2-1 Designing the FlowchartExercise 27.2-2 Designing the FlowchartExercise 27.2-3 Designing the FlowchartExercise 27.2-4 Designing the FlowchartExercise 27.2-5 Designing the Flowchart27.3 Converting Flowcharts to Python ProgramsExercise 27.3-1 Writing the Python ProgramExercise 27.3-2 Writing the Python ProgramExercise 27.3-3 Writing the Python ProgramExercise 27.3-4 Writing the Python Program27.4 Review Exercises
Chapter 28 Tips and Tricks with Loop Control Structures
28.1 Introduction28.2 Choosing a Loop Control Structure28.3 The “Ultimate” Rule28.4 Breaking Out of a Loop28.5 Cleaning Out Your LoopsExercise 28.5-1 Cleaning Out the LoopExercise 28.5-2 Cleaning Out the Loop28.6 Endless Loops and How to Stop Them28.7 The “From Inner to Outer” Method28.8 Review Questions: True/False28.9 Review Questions: Multiple Choice28.10 Review Exercises
Chapter 29 More with Loop Control Structures
29.1 Simple Exercises with Loop Control StructuresExercise 29.1-1 Counting the Numbers According to Which is GreaterExercise 29.1-2 Counting the Numbers According to Their DigitsExercise 29.1-3 How Many Numbers Fit in a SumExercise 29.1-4 Finding the Total Number of Positive IntegersExercise 29.1-5 Iterating as Many Times as the User WishesExercise 29.1-6 Finding the Sum of the Digits29.2 Exercises with Nested Loop Control StructuresExercise 29.2-1 Displaying all Three-Digit Integers that Contain a Given DigitExercise 29.2-2 Displaying all Instances of a Specified Condition29.3 Data Validation with Loop Control StructuresExercise 29.3-1 Finding Odd and Even Numbers - Validation Without Error MessagesExercise 29.3-2 Finding the Sum of Four Numbers29.4 Finding Minimum and Maximum Values with Loop Control StructuresExercise 29.4-1 Validating and Finding the Minimum and the Maximum ValueExercise 29.4-2 Validating and Finding the Hottest PlanetExercise 29.4-3 ”Making the Grade”29.5 Using Loop Control Structures to Solve Mathematical ProblemsExercise 29.5-1 Calculating the Area of as Many Triangles as the User WishesExercise 29.5-2 Finding x and yExercise 29.5-3 The Russian Multiplication AlgorithmExercise 29.5-4 Finding the Number of DivisorsExercise 29.5-5 Is the Number a Prime?Exercise 29.5-6 Finding all Prime Numbers from 1 to NExercise 29.5-7 Heron's Square RootExercise 29.5-8 Calculating πExercise 29.5-9 Approximating a Real with a Fraction29.6 Exercises of a General Nature with Loop Control StructuresExercise 29.6-1 Fahrenheit to Kelvin, from 0 to 100Exercise 29.6-2 Rice on a ChessboardExercise 29.6-3 Just a PollExercise 29.6-4 Is the Message a Palindrome?29.7 Review Questions: True/False29.8 Review Exercises
Review in “Loop Control Structures”
Review Crossword PuzzleReview Questions
Part VI Data Structures in Python
Chapter 30 One-Dimensional Lists and Dictionaries
30.1 Introduction30.2 What is a List?Exercise 30.2-1 Designing a ListExercise 30.2-2 Designing ListsExercise 30.2-3 Designing Lists30.3 Creating One-Dimensional Lists in Python30.4 How to Get Values from a One-Dimensional ListExercise 30.4-1 Creating the Trace TableExercise 30.4-2 Using a Non-Existing Index30.5 How to Alter the Value of a List Element30.6 How to Iterate Through a One-Dimensional ListExercise 30.6-1 Finding the Sum30.7 How to Add User-Entered Values to a One-Dimensional ListExercise 30.7-1 Displaying Words in Reverse OrderExercise 30.7-2 Displaying Positive Numbers in Reverse OrderExercise 30.7-3 Finding the Average ValueExercise 30.7-4 Displaying Reals OnlyExercise 30.7-5 Displaying Elements with Odd-Numbered IndexesExercise 30.7-6 Displaying Even Numbers in Odd–Numbered Index Positions30.8 More about the Concatenation and Repetition Operators30.9 What is a Dictionary?30.10 Creating Dictionaries in Python30.11 How to Get a Value from a DictionaryExercise 30.11-1 Roman Numerals to NumbersExercise 30.11-2 Using a Non-Existing Key in Dictionaries30.12 How to Alter the Value of a Dictionary ElementExercise 30.12-1 Assigning a Value to a Non-Existing Key30.13 How to Iterate Through a Dictionary30.14 More about the Membership Operators30.15 Review Questions: True/False30.16 Review Questions: Multiple Choice30.17 Review Exercises
Chapter 31 Two-Dimensional Lists
31.1 Creating Two-Dimensional Lists in Python31.2 How to Get Values from Two-Dimensional ListsExercise 31.2-1 Creating the Trace Table31.3 How to Iterate Through a Two-Dimensional List31.4 How to Add User-Entered Values to a Two-Dimensional ListExercise 31.4-1 Displaying Reals OnlyExercise 31.4-2 Displaying Odd Columns Only31.5 What's the Story on Variables i and j?31.6 Square MatricesExercise 31.6-1 Finding the Sum of the Elements on the Main DiagonalExercise 31.6-2 Finding the Sum of the Elements on the AntidiagonalExercise 31.6-3 Filling in the List31.7 Review Questions: True/False31.8 Review Questions: Multiple Choice31.9 Review Exercises
Chapter 32 Tips and Tricks with Data Structures
32.1 Introduction32.2 Processing Each Row IndividuallyExercise 32.2-1 Finding the Average Value32.3 Processing Each Column IndividuallyExercise 32.3-1 Finding the Average Value32.4 How to Use More Than One Data Structures in a ProgramExercise 32.4-1 Using Three One-Dimensional ListsExercise 32.4-2 Using a One-Dimensional List Along with a Two-Dimensional ListExercise 32.4-3 Using a List Along with a Dictionary32.5 Creating a One-Dimensional List from a Two-Dimensional List32.6 Creating a Two-Dimensional List from a One-Dimensional List32.7 Useful Data Structures Functions/Methods (Subprograms)32.8 Review Questions: True/False32.9 Review Questions: Multiple Choice32.10 Review Exercises
Chapter 33 More with Data Structures
33.1 Simple Exercises with ListsExercise 33.1-1 Creating a List that Contains the Average Values of its Neighboring ElementsExercise 33.1-2 Creating a List with the Greatest ValuesExercise 33.1-3 Merging One-Dimensional ListsExercise 33.1-4 Creating Two Lists – Separating Positive from Negative ValuesExercise 33.1-5 Creating a List with Those who Contain Digit 533.2 Data Validation with ListsExercise 33.2-1 Displaying Odds in Reverse Order33.3 Finding Minimum and Maximum Values in ListsExercise 33.3-1 Which Depth is the Greatest?Exercise 33.3-2 Which Lake is the Deepest?Exercise 33.3-3 Which Lake, in Which Country, Having Which Average Area, is the Deepest?Exercise 33.3-4 Which Students Have got the Greatest Grade?Exercise 33.3-5 Finding the Minimum Value of a Two-Dimensional ListExercise 33.3-6 Finding the City with the Coldest DayExercise 33.3-7 Finding the Minimum and the Maximum Value of Each Row
33.4 Sorting Lists
Exercise 33.4-1 The Bubble Sort Algorithm – Sorting One-Dimensional Lists with Numeric ValuesExercise 33.4-2 Sorting One-Dimensional Lists with Alphanumeric ValuesExercise 33.4-3 Sorting One-Dimensional Lists While Preserving the Relationship with a Second ListExercise 33.4-4 Sorting Last and First NamesExercise 33.4-5 Sorting a Two-Dimensional ListExercise 33.4-6 The Modified Bubble Sort Algorithm – Sorting One-Dimensional ListsExercise 33.4-7 The Selection Sort Algorithm – Sorting One-Dimensional ListsExercise 33.4-8 Sorting One-Dimensional Lists While Preserving the Relationship with a Second ListExercise 33.4-9 The Insertion Sort Algorithm – Sorting One-Dimensional ListsExercise 33.4-10 The Three Worst Elapsed Times33.5 Searching Elements in Data StructuresExercise 33.5-1 The Linear Search Algorithm – Searching in a One-Dimensional List that may Contain the Same Value Multiple TimesExercise 33.5-2 Display the Last Names of All Those People Who Have the Same First NameExercise 33.5-3 The Linear Search Algorithm – Searching in a Two-Dimensional List that May Contain the Same Value Multiple TimesExercise 33.5-4 The Linear Search Algorithm – Searching in a One-Dimensional List that Contains Unique ValuesExercise 33.5-5 Searching for a Social Security NumberExercise 33.5-6 The Linear Search Algorithm – Searching in a Two-Dimensional List that Contains Unique ValuesExercise 33.5-7 Checking if a Value Exists in all ColumnsExercise 33.5-8 The Binary Search Algorithm – Searching in a Sorted One-Dimensional ListExercise 33.5-9 Display all the Historical Events for a CountryExercise 33.5-10 Searching in Each Column of a Two-Dimensional List33.6 Exercises of a General Nature with Data StructuresExercise 33.6-1 On Which Days was There a Possibility of Snow?Exercise 33.6-2 Was There Any Possibility of Snow?Exercise 33.6-3 In Which Cities was There a Possibility of Snow?Exercise 33.6-4 Display from Highest to Lowest Grades by Student, and in Alphabetical OrderExercise 33.6-5 Archery at the Summer OlympicsExercise 33.6-6 The Five Best ScorersExercise 33.6-7 Counting the Frequency of Vowels33.7 Review Questions: True/False33.8 Review Exercises
Review in “Data Structures in Python”
Review Crossword PuzzleReview Questions
Part VII Subprograms
Chapter 34 Introduction to Subprograms
34.1 What Exactly is a Subprogram?34.2 What is Procedural Programming?34.3 What is Modular Programming?34.4 Review Questions: True/False
Chapter 35 User-Defined Subprograms
35.1 Subprograms that Return Values35.2 How to Make a Call to a Function35.3 Subprograms that Return no Values35.4 How to Make a Call to a void Function35.5 Formal and Actual Arguments35.6 How Does a Function Execute?Exercise 35.6-1 Back to Basics – Calculating the Sum of Two NumbersExercise 35.6-2 Calculating the Sum of Two Numbers Using Fewer Lines of Code!35.7 How Does a void Function Execute?Exercise 35.7-1 Back to Basics – Displaying the Absolute Value of a Number35.8 Review Questions: True/False35.9 Review Exercises
Chapter 36 Tips and Tricks with Subprograms
36.1 Can Two Subprograms use Variables of the Same Name?36.2 Can a Subprogram Call Another Subprogram?36.3 Passing Arguments by Value and by Reference36.4 Returning a List36.5 Default Argument Values (Optional Arguments) and Keyword Arguments36.6 The Scope of a Variable36.7 Converting Parts of Code into Subprograms36.8 Recursion36.9 Review Questions: True/False36.10 Review Exercises
Chapter 37 More with Subprograms
37.1 Simple Exercises with SubprogramsExercise 37.1-1 A Simple Currency ConverterExercise 37.1-2 Finding the Average Values of Positive IntegersExercise 37.1-3 Finding the Sum of Odd Positive IntegersExercise 37.1-4 Finding the Values of y37.2 Exercises of a General Nature with SubprogramsExercise 37.2-1 Validating Data Input Using a SubprogramExercise 37.2-2 Sorting a List Using a SubprogramExercise 37.2-3 Progressive Rates and Electricity ConsumptionExercise 37.2-4 Roll, Roll, Roll the… Dice!Exercise 37.2-5 How Many Times Does Each Number of the Dice Appear?37.3 Review Exercises
Review in “Subprograms”
Review Crossword PuzzleReview Questions
Part VIII Object-Oriented Programming
Chapter 38 Introduction to Object-Oriented Programming
38.1 What is Object-Oriented Programming?38.2 Classes and Objects in Python38.3 The Constructor and the Keyword self38.4 Passing Initial Values to the Constructor38.5 Class Fields vs Instance Fields38.6 Getter and Setter Methods vs PropertiesExercise 38.6-1 The Roman Numerals38.7 Can a Method Call Another Method of the Same Class?Exercise 38.7-1 Doing Math38.8 Class Inheritance38.9 Review Questions: True/False38.10 Review Exercises
Review in “Object-Oriented Programming”
Review Crossword PuzzleReview Questions
Part IX Files
Chapter 39 Introduction to Files
39.1 Introduction39.2 Opening a File39.3 Closing a File39.4 Writing in (or Appending to) a File39.5 The File Pointer39.6 Reading from a File39.7 Iterating Through the Contents of a File39.8 Review Questions: True/False39.9 Review Exercises
Chapter 40 More with Files
40.1 Exercises of a General Nature with FilesExercise 40.1-1 Calculating the Sum of 10 NumbersExercise 40.1-2 Calculating the Average Value of an Unknown Quantity of NumbersExercise 40.1-3 Finding Minimum and Maximum ValuesExercise 40.1-4 Concatenating FilesExercise 40.1-5 Searching in a FileExercise 40.1-6 Combining Files with Subprograms40.2 Review Exercises
Review in “Files”
Review Crossword PuzzleReview Questions
Some Final Words from the Author

Content preview from Python and Algorithmic Thinking for the Complete Beginner

Chapter 10 Introduction to Sequence Control Structures

10.1 What is the Sequence Control Structure?

Sequence control structure refers to the line-by-line execution by which statements are executed sequentially, in the same order in which they appear in the program, without skipping any of them. They might, for example, carry out a series of read or write operations, arithmetic operations, or assignments to variables.

The following program shows an example of Python statements that are executed sequentially.

file_10.1

#Prompt the user to enter value for num

num = int(input("Enter a number: "))

#Calculate the square of num

result = num ** 2

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781836209270

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Python and Algorithmic Thinking for the Complete Beginner

by Aristides Bouras

Chapter 10 Introduction to Sequence Control Structures

10.1 What is the Sequence Control Structure?

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.