Python for Everyone, EMEA Edition - Cay S. Horstmann

. .

Auteur(s) : Cay S. Horstmann - Rance D. Necaise

Editeur : John Wiley & Sons Inc

Langue : Anglais

Parution : 01/08/2019

Format : Moyen, de 350g à 1kg

Nombre de pages : 752

Expédition : 1548

Dimensions : 25.4 x 20.5 x 5.0

ISBN : 9781119638292

Résumé :

Python for Everyone, 3rd Edition is an introduction to programming designed to serve a wide range of student interests and abilities, focused on the essentials, and on effective learning. It is suitable for a first course in programming for computer scientists, engineers, and students in other disciplines. This text requires no prior programming experience and only a modest amount of high school algebra. Objects are used where appropriate in early chapters and students start designing and implementing their own classes in Chapter 9. New to this edition are examples and exercises that focus on various aspects of data science.

...

Biographie:

Preface iii

Special Features xviii

1 Introduction 1

1.1 Computer Programs 2

1.2 The Anatomy of a Computer 3

CS1 Computers Are Everywhere 5

1.3 The Python Programming Language 5

1.4 Becoming Familiar with Your Programming Environment 6

PT1 Interactive Mode 8

PT2 Backup Copies 9

ST1 The Python Interpreter 10

1.5 Analyzing Your First Program 11

1.6 Errors 13

CE1 Misspelling Words 14

1.7 PROBLEM SOLVING: Algorithm Design 15

CS2 Data Is Everywhere 17

HT1 Describing an Algorithm with Pseudocode 18

WE1 Writing an Algorithm for Tiling a Floor 20

2 Programming with Numbers and Strings 23

2.1 Variables 24

Defining Variables 24

Number Types 26

Variable Names 27

Constants 28

Comments 29

CE1 Using Undefined Variables 30

Pt1 Choose Descriptive Variable Names 30

PT2 Do Not Use Magic Numbers 30

2.2 Arithmetic 31

Basic Arithmetic Operations 31

Powers 32

Floor Division and Remainder 32

Calling Functions 33

Mathematical Functions 35

CE2 Roundoff Errors 36

CE3 Unbalanced Parentheses 37

PT3 Use Spaces in Expressions 37

ST1 Other Ways to Import Modules 38

ST2 Combining Assignment and Arithmetic 38

ST3 Line Joining 38

2.3 PROBLEM SOLVING: First Do It By Hand 39

WE1 Computing Travel Time 40

2.4 Strings 41

The String Type 41

Concatenation and Repetition 42

Converting Between Numbers and Strings 43

Strings and Characters 44

String Methods 45

ST4 Character Values 46

ST5 Escape Sequences 47

CS1 International Alphabets and Unicode 47

2.5 Input and Output 48

User Input 48

Numerical Input 49

Formatted Output 50

PT4 Don't Wait to Convert 53

HT1 Writing Simple Programs 53

WE2 Computing the Cost of Stamps 56

CS2 Bugs in Silicon 58

2.6 GRAPHICS: Simple Drawings 58

Creating a Window 59

Lines and Polygons 60

Filled Shapes and Color 62

Ovals, Circles, and Text 64

HT2 GRAPHICS: Drawing Graphical Shapes 65

TOOLBOX 1 Symbolic Processing with SymPy 68

3 Decisions 73

3.1 The if Statement 74

CE1 Tabs 77

PT1 Avoid Duplication in Branches 78

ST1 Conditional Expressions 78

3.2 Relational Operators 79

CE2 Exact Comparison of Floating-Point Numbers 82

ST2 Lexicographic Ordering of Strings 82

HT1 Implementing an if Statement 83

WE1 Extracting the Middle 85

3.3 Nested Branches 87

PT2 Hand-Tracing 89

CS1 Dysfunctional Computerized Systems 90

3.4 Multiple Alternatives 91

TOOLBOX 1 Sending E-mail 93

3.5 PROBLEM SOLVING: Flowcharts 96

3.6 PROBLEM SOLVING: Test Cases 99

PT3 Make a Schedule and Make Time for Unexpected Problems 100

3.7 Boolean Variables and Operators 101

CE3 Confusing and and or Conditions 104

PT4 Readability 104

ST3 Chaining Relational Operators 105

ST4 Short-Circuit Evaluation of Boolean Operators 105

ST5 De Morgan's Law 106

3.8 Analyzing Strings 106

3.9 APPLICATION: Input Validation 110

ST6 Terminating a Program 112

ST7 Interactive Graphical Programs 112

CS2 Artificial Intelligence 113

WE2 GRAPHICS: Intersecting Circles 113

TOOLBOX 2 Plotting Simple Graphs 117

4 Loops 125

4.1 The while Loop 126

CE1 Don't Think Are We There Yet? 130

CE2 ?Infinite Loops 130

CE3 Off-by-One Errors 131

ST1 Special Form of the print Function 132

CS1 Th...

Sommaire:

Preface iii

Special Features xviii

1 Introduction 1

1.1 Computer Programs 2

1.2 The Anatomy of a Computer 3

CS1 Computers Are Everywhere 5

1.3 The Python Programming Language 5

1.4 Becoming Familiar with Your Programming Environment 6

PT1 Interactive Mode 8

PT2 Backup Copies 9

ST1 The Python Interpreter 10

1.5 Analyzing Your First Program 11

1.6 Errors 13

CE1 Misspelling Words 14

1.7 PROBLEM SOLVING: Algorithm Design 15

CS2 Data Is Everywhere 17

HT1 Describing an Algorithm with Pseudocode 18

WE1 Writing an Algorithm for Tiling a Floor 20

2 Programming with Numbers and Strings 23

2.1 Variables 24

Defining Variables 24

Number Types 26

Variable Names 27

Constants 28

Comments 29

CE1 Using Undefined Variables 30

Pt1 Choose Descriptive Variable Names 30

PT2 Do Not Use Magic Numbers 30

2.2 Arithmetic 31

Basic Arithmetic Operations 31

Powers 32

Floor Division and Remainder 32

Calling Functions 33

Mathematical Functions 35

CE2 Roundoff Errors 36

CE3 Unbalanced Parentheses 37

PT3 Use Spaces in Expressions 37

ST1 Other Ways to Import Modules 38

ST2 Combining Assignment and Arithmetic 38

ST3 Line Joining 38

2.3 PROBLEM SOLVING: First Do It By Hand 39

WE1 Computing Travel Time 40

2.4 Strings 41

The String Type 41

Concatenation and Repetition 42

Converting Between Numbers and Strings 43

Strings and Characters 44

String Methods 45

ST4 Character Values 46

ST5 Escape Sequences 47

CS1 International Alphabets and Unicode 47

2.5 Input and Output 48

User Input 48

Numerical Input 49

Formatted Output 50

PT4 Don't Wait to Convert 53

HT1 Writing Simple Programs 53

WE2 Computing the Cost of Stamps 56

CS2 Bugs in Silicon 58

2.6 GRAPHICS: Simple Drawings 58

Creating a Window 59

Lines and Polygons 60

Filled Shapes and Color 62

Ovals, Circles, and Text 64

HT2 GRAPHICS: Drawing Graphical Shapes 65

TOOLBOX 1 Symbolic Processing with SymPy 68

3 Decisions 73

3.1 The if Statement 74

CE1 Tabs 77

PT1 Avoid Duplication in Branches 78

ST1 Conditional Expressions 78

3.2 Relational Operators 79

CE2 Exact Comparison of Floating-Point Numbers 82

ST2 Lexicographic Ordering of Strings 82

HT1 Implementing an if Statement 83

WE1 Extracting the Middle 85

3.3 Nested Branches 87

PT2 Hand-Tracing 89

CS1 Dysfunctional Computerized Systems 90

3.4 Multiple Alternatives 91

TOOLBOX 1 Sending E-mail 93

3.5 PROBLEM SOLVING: Flowcharts 96

3.6 PROBLEM SOLVING: Test Cases 99

PT3 Make a Schedule and Make Time for Unexpected Problems 100

3.7 Boolean Variables and Operators 101

CE3 Confusing and and or Conditions 104

PT4 Readability 104

ST3 Chaining Relational Operators 105

ST4 Short-Circuit Evaluation of Boolean Operators 105

ST5 De Morgan's Law 106

3.8 Analyzing Strings 106

3.9 APPLICATION: Input Validation 110

ST6 Terminating a Program 112

ST7 Interactive Graphical Programs 112

CS2 Artificial Intelligence 113

WE2 GRAPHICS: Intersecting Circles 113

TOOLBOX 2 Plotting Simple Graphs 117

4 Loops 125

4.1 The while Loop 126

CE1 Don't Think Are We There Yet? 130

CE2 ?Infinite Loops 130

CE3 Off-by-One Errors 131

ST1 Special Form of the print Function 132

CS1 Th...