Wpisz informacje, które znasz

zamknij

PYTHON FOR EVERYONE

S. Horstmann Cay

Oprawa:
MIĘKKA

Wydawca:
John Wiley &: Sons

Data premiery:
2013-04-26

ISBN:
9781118626139

955,45 PLN
Wysyłamy w 21 dni

Opis produktu

<:i>:Python for Everyone<:/i>:, 1st Edition is a comprehensive introduction to Python and computer programming, which focuses on the principles of programming, software engineering, and effective learning. It is designed for a one–:semester, mixed–:major, first course in programming. <:p>:Nobody supports your desire to teach students good programming skills like Cay Horstmann and Rance Necaise. Active in both the classroom and the software industry, Horstmann and Necaise know that meticulous codingnot shortcutsis the base upon which great programmers are made. Using an innovative visual design that leads students step–:by–:step through intricacies of Python programming, Python For Everyone, 1st Edition instills confidence in beginning programmers and confidence leads to success.<:/p>:<:i>:Python for Everyone<:/i>:, 1st Edition is a comprehensive introduction to Python and computer programming, which focuses on the principles of programming, software engineering, and effective learning. It is designed for a one–:semester, mixed–:major, first course in programming.<:p>:PEFACE V<:/p>: <:p>:SPECIAL FEATURES XVIII<:/p>: <:p>:<:b>:CHAPTER 1 INTRODUCTION 1<:/b>:<:/p>: <:p>:1.1 Computer Programs 2<:/p>: <:p>:1.2 The Anatomy of a Computer 3<:/p>: <:p>:1.3 The Python Programming Language 5<:/p>: <:p>:1.4 Becoming Familiar with Your Programming Environment 6<:/p>: <:p>:1.5 Analyzing Your First Program 11<:/p>: <:p>:1.6 Errors 14<:/p>: <:p>:1.7 Problem Solving: Algorithm Design 16<:/p>: <:p>:<:b>:CHAPTER 2 PROGRAMMING WITH NUMBERS AND STRINGS 29<:/b>:<:/p>: <:p>:2.1 Variables 30<:/p>: <:p>:2.2 Arithmetic 37<:/p>: <:p>:2.3 Problem Solving: First Do It By Hand 45<:/p>: <:p>:2.4 Strings 48<:/p>: <:p>:2.5 Input and Output 55<:/p>: <:p>:2.6 Graphics: Simple Drawings 65<:/p>: <:p>:<:b>:CHAPTER 3 DECISIONS 91<:/b>:<:/p>: <:p>:3.1 The if Statement 92<:/p>: <:p>:3.2 Relational Operators 97<:/p>: <:p>:3.3 Nested Branches 106<:/p>: <:p>:3.4 Multiple Alternatives 109<:/p>: <:p>:3.5 Problem Solving: Flowcharts 112<:/p>: <:p>:3.6 Problem Solving: Test Cases 116<:/p>: <:p>:3.7 Boolean Variables and Operators 118<:/p>: <:p>:3.8 Analyzing Strings 124<:/p>: <:p>:3.9 Application: Input Validation 127<:/p>: <:p>:<:b>:CHAPTER 4 LOOPS 155<:/b>:<:/p>: <:p>:4.1 The while Loop 156<:/p>: <:p>:4.2 Problem Solving: Hand–:Tracing 163<:/p>: <:p>:4.3 Application: Processing Sentinel Values 166<:/p>: <:p>:4.4 Problem Solving: Storyboards 170<:/p>: <:p>:4.5 Common Loop Algorithms 173<:/p>: <:p>:4.6 The For Loop 177<:/p>: <:p>:4.7 Nested Loops 184<:/p>: <:p>:4.8 Processing Strings 190<:/p>: <:p>:4.9 Application: Random Numbers and Simulations 194<:/p>: <:p>:<:b>:CHAPTER 5 FUNCTIONS 219<:/b>:<:/p>: <:p>:5.1 Functions as Black Boxes 220<:/p>: <:p>:5.2 Implementing and Testing Functions 222<:/p>: <:p>:5.3 Parameter Passing 226<:/p>: <:p>:5.4 Return Values 229<:/p>: <:p>:5.5 Functions Without Return Values 237<:/p>: <:p>:5.6 Problem Solving: Reusable Functions 239<:/p>: <:p>:5.7 Problem Solving: Stepwise Refinement 242<:/p>: <:p>:5.8 Variable Scope 251<:/p>: <:p>:5.9 Recursive Functions (Optional) 258<:/p>: <:p>:<:b>:CHAPTER 6 LISTS 277<:/b>:<:/p>: <:p>:6.1 Basic Properties of Lists 278<:/p>: <:p>:6.2 List Operations 284<:/p>: <:p>:6.3 Common List Algorithms 290<:/p>: <:p>:6.4 Using Lists with Functions 297<:/p>: <:p>:6.5 Problem Solving: Adapting Algorithms 303<:/p>: <:p>:6.6 Problem Solving: Discovering Algorithms by Manipulating Physical Objects 310<:/p>: <:p>:6.7 Tables 314<:/p>: <:p>:<:b>:CHAPTER 7 <:/b>:<:b>:FILES AND EXCEPTIONS 341<:/b>:<:/p>: <:p>:7.1 Reading and Writing Text Files 342<:/p>: <:p>:7.2 Text Input and Output 346<:/p>: <:p>:7.3 Command Line Arguments 357<:/p>: <:p>:7.4 Binary Files and Random Access (Optional) 368<:/p>: <:p>:7.5 Exception Handling 377<:/p>: <:p>:7.6 Application: Handling Input Errors 383<:/p>: <:p>:<:b>:CHAPTER 8 SETS AND DICTIONARIES 403<:/b>:<:/p>: <:p>:8.1 Sets 404<:/p>: <:p>:8.2 Dictionaries 414<:/p>: <:p>:8.3 Complex Structures 424<:/p>: <:p>:<:b>:CHAPTER 9 OBJECTS AND CLASSES 443<:/b>:<:/p>: <:p>:9.1 Object–:Oriented Programming 444<:/p>: <:p>:9.2 Implementing a Simple Class 446<:/p>: <:p>:9.3 Specifying the Public Interface of a Class 450<:/p>: <:p>:9.4 Designing the Data Representation 452<:/p>: <:p>:9.5 Constructors 454<:/p>: <:p>:9.6 Implementing Methods 457<:/p>: <:p>:9.7 Testing A Class 461<:/p>: <:p>:9.8 Problem Solving: Tracing Objects 469<:/p>: <:p>:9.9 Problem Solving: Patterns for Object Data 472<:/p>: <:p>:9.10 Object References 478<:/p>: <:p>:9.11 Application: Writing a Fraction Class 482<:/p>: <:p>:<:b>:CHAPTER 10 INHERITANCE 507<:/b>:<:/p>: <:p>:10.1 Inheritance Hierarchies 508<:/p>: <:p>:10.2 Implementing Subclasses 513<:/p>: <:p>:10.3 Calling the Superclass Constructor 517<:/p>: <:p>:10.4 Overriding Methods 521<:/p>: <:p>:10.5 Polymorphism 524<:/p>: <:p>:10.6 Application: A Geometric Shape Class Hierarchy 538<:/p>: <:p>:<:b>:CHAPTER 11 <:/b>:<:b>:RECURSION 555<:/b>:<:/p>: <:p>:11.1 Triangle Numbers Revisited 556<:/p>: <:p>:11.2 Problem Solving: Thinking Recursively 560<:/p>: <:p>:11.3 Recursive Helper Functions 565<:/p>: <:p>:11.4 The Efficiency of Recursion 566<:/p>: <:p>:11.5 Permutations 571<:/p>: <:p>:11.6 Backtracking 575<:/p>: <:p>:11.7 Mutual Recursion 583<:/p>: <:p>:<:b>:CHAPTER 12 SORTING AND SEARCHING 597<:/b>:<:/p>: <:p>:12.1 Selection Sort 598<:/p>: <:p>:12.2 Profiling the Selection Sort Algorithm 600<:/p>: <:p>:12.3 Analyzing the Performance of the Selection Sort Algorithm 602<:/p>: <:p>:12.4 Merge Sort 606<:/p>: <:p>:12.5 Analyzing the Merge Sort Algorithm 609<:/p>: <:p>:12.6 Searching 614<:/p>: <:p>:12.7 Problem Solving: Estimating the Running Time of An Algorithm 617<:/p>: <:p>:<:b>:APPENDICES<:/b>:<:/p>: <:p>:Appendix A The Basic Latin And Latin–:1 Subsets Of Unicode A–:1<:/p>: <:p>:Appendix B Python Operator Summary A–:4<:/p>: <:p>:Appendix C Python Reserved Word Summary A–:6<:/p>: <:p>:Appendix D The Python Standard Library A–:8<:/p>: <:p>:Appendix E Binary Numbers and Bit Operations A–:29<:/p>: <:p>:Glossary G–:1<:/p>: <:p>:Index I–:1<:/p>: <:p>:Credits C–:1<:/p>:

Data Publikacji: 2013-04-26
Wymiary: 253 mm 203 mm 1162 gr 22.02 mm

Dodaj recenzję

Zaloguj sie, aby móc dodać swoją recenzję.

Kontakt

mail: prus@prus24.pl

telefon: (22) 826-18-35

Copyright © 2001-2018 Główna Księgarnia Naukowa im. B. Prusa. Wszelkie prawa zastrzeżone.
Home   /   Informacje   /   Kontakt
Projekt i realizacja:
MDA.pl