Python For Everyone (2nd Edition)

$19.99

Download Python For Everyone (2nd Edition) written by Cay S. Horstmann, Rance D. Necaise in PDF format. This book is under the category Computers and bearing the isbn/isbn13 number 1119056551; 1119056365/9781119056553/ 9781119056362. You may reffer the table below for additional details of the book.

SKU: 515ab26c135e Category: Tags: ,

Specifications

book-author

Cay S. Horstmann, Rance D. Necaise

publisher

Wiley; 2nd edition

file-type

PDF

pages

752 pages

language

English

asin

B07ZN7N5KW

isbn10

1119056551; 1119056365

isbn13

9781119056553/ 9781119056362


Book Description

Python for Everyone; 2nd Edition; (PDF)  is an introduction to programming designed to serve a broad range of student interests and abilities; dedicated to the essentials; and on effective learning. It is appropriate for a first course in programming for computer engineers; scientists; and college students in other disciplines. This textbook requires no prior programming experience and only a moderate amount of high school algebra. Objects are used where appropriate in initial chapters and all students start designing and implementing their own classes in Chapter 9. New to this 2nd edition are exercises and examples that focus on various aspects of data science.

NOTE: The product only includes the ebook; Python for Everyone; 2nd Edition in PDF. No access codes are included.

Additional information

book-author

Cay S. Horstmann, Rance D. Necaise

publisher

Wiley; 2nd edition

file-type

PDF

pages

752 pages

language

English

asin

B07ZN7N5KW

isbn10

1119056551; 1119056365

isbn13

9781119056553/ 9781119056362

Table of contents


Table of contents :
Cover……Page 1
Title Page……Page 3
Copyright……Page 4
Preface……Page 5
New to This Edition……Page 6
A Tour of the Book……Page 7
Acknowledgments……Page 9
A Walkthrough of the Learning Aids……Page 10
Contents……Page 14
Chapter 1 Introduction……Page 25
1.1 Computer Programs……Page 26
1.2 The Anatomy of a Computer……Page 27
1.3 The Python Programming Language……Page 29
Chapter 2 Programming with Numbers and Strings……Page 51
2.1.1 Defining Variables……Page 52
2.1.2 Number Types……Page 54
2.1.3 Variable Names……Page 55
2.1.4 Constants……Page 56
2.1.5 Comments……Page 57
2.2.1 Basic Arithmetic Operations……Page 59
2.2.2 Powers……Page 60
2.2.4 Calling Functions……Page 61
2.2.5 Mathematical Functions……Page 63
Chapter 3 Decisions……Page 115
3.1 The if Statement……Page 116
3.2 Relational Operators……Page 121
3.3 Nested Branches……Page 130
3.4 Multiple Alternatives……Page 134
3.5 Problem Solving: Flowcharts……Page 140
3.6 Problem Solving: Test Cases……Page 143
3.7 Boolean Variables and Operators……Page 145
3.8 Analyzing Strings……Page 150
3.9 Application: Input Validation……Page 154
Chapter 4 Loops……Page 189
4.1 The while Loop……Page 190
4.2 Problem Solving: Hand-Tracing……Page 196
4.3 Application: Processing Sentinel Values……Page 200
4.4 Problem Solving: Storyboards……Page 204
4.5.1 Sum and Average Value……Page 207
4.5.4 Maximum and Minimum……Page 208
4.5.5 Comparing Adjacent Values……Page 209
4.6 The for Loop……Page 211
4.7 Nested Loops……Page 218
4.8.1 Counting Matches……Page 226
4.8.3 Finding the First or Last Match……Page 227
4.8.5 Building a New String……Page 228
4.9 Application: Random Numbersand Simulations……Page 230
4.9.2 Simulating Die Tosses……Page 231
4.9.3 The Monte Carlo Method……Page 232
4.10.1 Filtering Images……Page 236
4.10.2 Reconfiguring Images……Page 239
4.11 Problem Solving: Solve a SimplerProblem First……Page 241
Chapter 5 Functions……Page 269
5.1 Functions as Black Boxes……Page 270
5.2.1 Implementing a Function……Page 272
5.2.3 Programs that Contain Functions……Page 273
5.3 Parameter Passing……Page 276
5.4 Return Values……Page 279
5.5 Functions Without Return Values……Page 287
5.6 Problem Solving: Reusable Functions……Page 289
5.7 Problem Solving: Stepwise Refinement……Page 293
5.8 Variable Scope……Page 306
5.9.1 Getting Started……Page 312
5.9.2 Comparing Images……Page 313
5.9.3 Adjusting Image Brightness……Page 314
5.9.4 Rotating an Image……Page 315
5.9.5 Using the Toolkit……Page 317
5.10 Recursive Functions (Optional)……Page 320
Chapter 6 Lists……Page 339
6.1.1 Creating Lists……Page 340
6.1.2 Accessing List Elements……Page 341
6.1.4 List References……Page 343
6.2.2 Inserting an Element……Page 346
6.2.3 Finding an Element……Page 347
6.2.4 Removing an Element……Page 348
6.2.7 Sum, Maximum, Minimum, and Sorting……Page 349
6.2.8 Copying Lists……Page 350
6.3.2 Combining List Elements……Page 352
6.3.3 Element Separators……Page 353
6.3.4 Maximum and Minimum……Page 354
6.3.7 Removing Matches……Page 355
6.3.8 Swapping Elements……Page 356
6.3.9 Reading Input……Page 357
6.4 Using Lists with Functions……Page 362
6.5 Problem Solving: Adapting Algorithms……Page 369
6.6 Problem Solving: Discovering Algorithms byManipulating Physical Objects……Page 376
6.7 Tables……Page 380
6.7.1 Creating Tables……Page 381
6.7.3 Locating Neighboring Elements……Page 382
6.7.4 Computing Row and Column Totals……Page 383
6.7.5 Using Tables with Functions……Page 384
Chapter 7 Files and Exceptions……Page 407
7.1.1 Opening a File……Page 408
7.1.2 Reading from a File……Page 409
7.1.4 A File Processing Example……Page 410
7.2.1 Iterating over the Lines of a File……Page 412
7.2.2 Reading Words……Page 414
7.2.3 Reading Characters……Page 416
7.2.4 Reading Records……Page 417
7.3 Command Line Arguments……Page 425
7.4.1 Reading and Writing Binary Files……Page 437
7.4.2 Random Access……Page 438
7.4.3 Image Files……Page 439
7.4.4 Processing BMP Files……Page 440
7.5 Exception Handling……Page 446
7.5.1 Raising Exceptions……Page 447
7.5.2 Handling Exceptions……Page 448
7.5.3 The finally Clause……Page 450
7.6 Application: Handling Input Errors……Page 454
Chapter 8 Sets and Dictionaries……Page 481
8.1.1 Creating and Using Sets……Page 482
8.1.2 Adding and Removing Elements……Page 483
8.1.3 Subsets……Page 484
8.1.4 Set Union, Intersection, and Difference……Page 485
8.2.1 Creating Dictionaries……Page 493
8.2.3 Adding and Modifying Items……Page 494
8.2.4 Removing Items……Page 495
8.2.5 Traversing a Dictionary……Page 496
8.3.1 A Dictionary of Sets……Page 502
8.3.2 A Dictionary of Lists……Page 505
Chapter 9 Objects and Classes……Page 523
9.1 Object-Oriented Programming……Page 524
9.2 Implementing a Simple Class……Page 526
9.3 Specifying the Public Interface of a Class……Page 530
9.4 Designing the Data Representation……Page 532
9.5 Constructors……Page 534
9.6 Implementing Methods……Page 537
9.7 Testing a Class……Page 541
9.8 Problem Solving: Tracing Objects……Page 549
9.9.1 Keeping a Total……Page 552
9.9.3 Collecting Values……Page 553
9.9.5 Modeling Objects with Distinct States……Page 554
9.9.6 Describing the Position of an Object……Page 555
9.10 Object References……Page 557
9.10.1 Shared References……Page 558
9.10.3 The self Reference……Page 560
9.10.4 The Lifetime of Objects……Page 561
9.11.1 Fraction Class Design……Page 562
9.11.2 The Constructor……Page 563
9.11.3 Special Methods……Page 564
9.11.4 Arithmetic Operations……Page 566
9.11.5 Logical Operations……Page 567
Chapter 10 Inheritance……Page 587
10.1 Inheritance Hierarchies……Page 588
10.2 Implementing Subclasses……Page 593
10.3 Calling the Superclass Constructor……Page 597
10.4 Overriding Methods……Page 601
10.5 Polymorphism……Page 604
10.6 Application: A Geometric ShapeClass Hierarchy……Page 618
10.6.1 The Base Class……Page 619
10.6.2 Basic Shapes……Page 621
10.6.3 Groups of Shapes……Page 624
Chapter 11 Recursion……Page 635
11.1 Triangle Numbers Revisited……Page 636
11.2 Problem Solving: Thinking Recursively……Page 640
11.3 Recursive Helper Functions……Page 645
11.4 The Efficiency of Recursion……Page 646
11.5 Permutations……Page 651
11.6 Backtracking……Page 655
11.7 Mutual Recursion……Page 663
Chapter 12 Sorting and Searching……Page 679
12.1 Selection Sort……Page 680
12.2 Profiling the Selection Sort Algorithm……Page 682
12.3 Analyzing the Performanceof the Selection Sort Algorithm……Page 684
12.4 Merge Sort……Page 688
12.5 Analyzing the Merge Sort Algorithm……Page 691
12.6.1 Linear Search……Page 695
12.6.2 Binary Search……Page 696
12.7.1 Linear Time……Page 698
12.7.2 Quadratic Time……Page 699
12.7.3 The Triangle Pattern……Page 700
12.7.4 Logarithmic Time……Page 701
Appendix A Python Operator Summary……Page 715
Appendix B Python Reserved Word Summary……Page 717
Appendix C The Python Standard Library……Page 719
Appendix D The Basic Latin and Latin-1 Subsets of Unicode……Page 734
Binary Numbers……Page 737
Bit and Shift Operations……Page 739
Appendix F HTML Summary……Page 741
Glossary……Page 746
Index……Page 751
Credits……Page 766
EULA……Page 769

Recent Posts

5 tips for a good business blog

Follow my blog with BloglovinAre you also looking for a good structure for your business blogs? That you finally have a serious and good structure for all your texts that are online? On your website but also on social media. In this review you will find 5 tips from Susanna Florie from her…

Study tips from a budding engineer

“Why engineering?” is a question I get often. The answer for me is simple: I like to solve problems. Engineering is a popular field for many reasons. Perhaps this is because almost everything around us is created by engineers in one way or another, and there are always new, emerging and exciting technologies impacting…

How do I study mathematics and pass my exam?

Not sure how best to study math ? Are you perhaps someone who starts studying the day before the exam? Then you know yourself that your situation is not the most ideal. Unfortunately, there is no magic bullet to make you a maths crack or pass your exam in no time . It is important to know that mathematics always builds on…

(0)
×