Wpisz informacje, które znasz

zamknij

BIG JAVA

S. Horstmann Cay

Oprawa:
MIĘKKA

Wydawca:
John Wiley &: Sons

Data premiery:
2012-02-20

ISBN:
9781118087886

976,45 PLN
Wysyłamy w 21 dni

Opis produktu

<:b>:<:i>:Big Java: Late Objects<:/i>:<:/b>: is a comprehensive introduction to Java and computer programming, which focuses on the principles of programming, software engineering, and effective learning. It is designed for a two–:semester first course in programming for computer science students. Using an innovative visual design that leads readers step–:by–:step through intricacies of Java programming, <:i>:<:b>:Big Java: Late Objects<:/b>:<:/i>: instills confidence in beginning programmers and confidence leads to success.<:b>:<:i>:Big Java: Late Objects<:/i>:<:/b>: is a comprehensive introduction to Java and computer programming, which focuses on the principles of programming, software engineering, and effective learning. It is designed for a two–:semester first course in programming for computer science students.Preface <:b>:v<:/b>: <:p>:Special Features <:b>:xxvi<:/b>:<:/p>: <:p>:<:b>:Chapter 1 INTRODUCTION 1<:/b>:<:/p>: <:p>:1.1 Computer Programs <:b>:2<:/b>:<:/p>: <:p>:1.2 The Anatomy of a Computer <:b>:3<:/b>:<:/p>: <:p>:1.3 The Java Programming Language <:b>:5<:/b>:<:/p>: <:p>:1.4 Becoming Familiar with Your Programming Environment <:b>:8<:/b>:<:/p>: <:p>:1.5 Analyzing Your First Program <:b>:12<:/b>:<:/p>: <:p>:1.6 Errors <:b>:15<:/b>:<:/p>: <:p>:1.7 Problem Solving: Algorithm Design <:b>:16<:/b>:<:/p>: <:p>:<:b>:Chapter 2 FUNDAMENTAL DATA TYPES 29<:/b>:<:/p>: <:p>:2.1 Variables <:b>:30<:/b>:<:/p>: <:p>:2.2 Arithmetic <:b>:41<:/b>:<:/p>: <:p>:2.3 Input and Output <:b>:48<:/b>:<:/p>: <:p>:2.4 Problem Solving: First Do It By Hand <:b>:57<:/b>:<:/p>: <:p>:2.5 Strings <:b>:59<:/b>:<:/p>: <:p>:<:b>:Chapter 3 DECISIONS 81<:/b>:<:/p>: <:p>:3.1 The if Statement <:b>:82<:/b>:<:/p>: <:p>:3.2 Comparing Numbers and Strings <:b>:88<:/b>:<:/p>: <:p>:3.3 Multiple Alternatives <:b>:96<:/b>:<:/p>: <:p>:3.4 Nested Branches <:b>:100<:/b>:<:/p>: <:p>:3.5 Problem Solving: Flowcharts <:b>:105<:/b>:<:/p>: <:p>:3.6 Problem Solving: Test Cases <:b>:108<:/b>:<:/p>: <:p>:3.7 Boolean Variables and Operators <:b>:111<:/b>:<:/p>: <:p>:3.8 Application: Input Validation <:b>:116<:/b>:<:/p>: <:p>:<:b>:Chapter 4 LOOPS 139<:/b>:<:/p>: <:p>:4.1 The while Loop <:b>:140<:/b>:<:/p>: <:p>:4.2 Problem Solving: Hand–:Tracing <:b>:147<:/b>:<:/p>: <:p>:4.3 The for Loop <:b>:150<:/b>:<:/p>: <:p>:4.4 The do Loop <:b>:156<:/b>:<:/p>: <:p>:4.5 Application: Processing Sentinel Values <:b>:158<:/b>:<:/p>: <:p>:4.6 Problem Solving: Storyboards <:b>:162<:/b>:<:/p>: <:p>:4.7 Common Loop algorithms <:b>:165<:/b>:<:/p>: <:p>:4.8 Nested Loops <:b>:172<:/b>:<:/p>: <:p>:4.9 Application: Random Numbers and Simulations <:b>:176<:/b>:<:/p>: <:p>:<:b>:Chapter 5 METHODS 201<:/b>:<:/p>: <:p>:5.1 Methods as Black Boxes <:b>:202<:/b>:<:/p>: <:p>:5.2 Implementing Methods <:b>:204<:/b>:<:/p>: <:p>:5.3 Parameter Passing <:b>:207<:/b>:<:/p>: <:p>:5.4 Return Values <:b>:210<:/b>:<:/p>: <:p>:5.5 Methods Without Return Values <:b>:214<:/b>:<:/p>: <:p>:5.6 Problem Solving: Reusable Methods <:b>:215<:/b>:<:/p>: <:p>:5.7 Problem Solving: Stepwise Refinement <:b>:218<:/b>:<:/p>: <:p>:5.8 Variable Scope <:b>:225<:/b>:<:/p>: <:p>:5.9 Recursive Methods (Optional) <:b>:228<:/b>:<:/p>: <:p>:<:b>:Chapter 6 ARRAYS AND ARRAY LISTS 249<:/b>:<:/p>: <:p>:6.1 Arrays <:b>:250<:/b>:<:/p>: <:p>:6.2 The Enhanced for Loop <:b>:257<:/b>:<:/p>: <:p>:6.3 Common Array Algorithms <:b>:258<:/b>:<:/p>: <:p>:6.4 Using Arrays with Methods <:b>:268<:/b>:<:/p>: <:p>:6.5 Problem Solving: Adapting Algorithms <:b>:272<:/b>:<:/p>: <:p>:6.6 Problem Solving: Discovering Algorithms by Manipulating Physical Objects <:b>:279<:/b>:<:/p>: <:p>:6.7 Two–:Dimensional Arrays <:b>:282<:/b>:<:/p>: <:p>:6.8 Array Lists <:b>:289<:/b>:<:/p>: <:p>:<:b>:Chapter 7 INPUT/OUTPUT AND EXCEPTION HANDLING 317<:/b>:<:/p>: <:p>:7.1 Reading and Writing Text files <:b>:318<:/b>:<:/p>: <:p>:7.2 Text Input and Output <:b>:323<:/b>:<:/p>: <:p>:7.3 Command Line Arguments <:b>:330<:/b>:<:/p>: <:p>:7.4 Exception Handling <:b>:337<:/b>:<:/p>: <:p>:7.5 Application: Handling Input Errors <:b>:347<:/b>:<:/p>: <:p>:<:b>:Chapter 8 OBJECTS AND CLASSES 361<:/b>:<:/p>: <:p>:8.1 Object–:Oriented Programming <:b>:362<:/b>:<:/p>: <:p>:8.2 Implementing a Simple Class <:b>:364<:/b>:<:/p>: <:p>:8.3 Specifying the Public Interface of a Class <:b>:367<:/b>:<:/p>: <:p>:8.4 Designing the Data representation <:b>:371<:/b>:<:/p>: <:p>:8.5 Implementing Instance Methods <:b>:372<:/b>:<:/p>: <:p>:8.6 Constructors <:b>:375<:/b>:<:/p>: <:p>:8.7 Testing a Class <:b>:380<:/b>:<:/p>: <:p>:8.8 Problem Solving: Tracing Objects <:b>:386<:/b>:<:/p>: <:p>:8.9 Problem Solving: Patterns for Object Data <:b>:388<:/b>:<:/p>: <:p>:8.10 Object References <:b>:395<:/b>:<:/p>: <:p>:8.11 Static Variables and Methods <:b>:400<:/b>:<:/p>: <:p>:<:b>:Chapter 9 INHERITANCE AND INTERFACES 415<:/b>:<:/p>: <:p>:9.1 Inheritance Hierarchies <:b>:416<:/b>:<:/p>: <:p>:9.2 Implementing Subclasses <:b>:420<:/b>:<:/p>: <:p>:9.3 Overriding Methods <:b>:424<:/b>:<:/p>: <:p>:9.4 Polymorphism <:b>:430<:/b>:<:/p>: <:p>:9.5 Object: The Cosmic Superclass <:b>:441<:/b>:<:/p>: <:p>:9.6 Interface Types <:b>:448<:/b>:<:/p>: <:p>:<:b>:Chapter 10 GRAPHICAL USER INTERFACES 465<:/b>:<:/p>: <:p>:10.1 Frame Windows <:b>:466<:/b>:<:/p>: <:p>:10.2 Events and Event Handling <:b>:470<:/b>:<:/p>: <:p>:10.3 Processing Text Input <:b>:481<:/b>:<:/p>: <:p>:10.4 Creating Drawings <:b>:487<:/b>:<:/p>: <:p>:<:b>:Chapter 11 ADVANCED USER INTERFACES 507<:/b>:<:/p>: <:p>:11.1 Layout Management <:b>:508<:/b>:<:/p>: <:p>:11.2 Choices <:b>:510<:/b>:<:/p>: <:p>:11.3 Menus <:b>:521<:/b>:<:/p>: <:p>:11.4 Exploring the Swing Documentation <:b>:528<:/b>:<:/p>: <:p>:11.5 Using Timer events for Animations <:b>:533<:/b>:<:/p>: <:p>:11.6 Mouse Events <:b>:536<:/b>:<:/p>: <:p>:<:b>:Chapter 12 OBJECT–:ORIENTED DESIGN 549<:/b>:<:/p>: <:p>:12.1 Classes and Their Responsibilities <:b>:550<:/b>:<:/p>: <:p>:12.2 Relationships Between Classes <:b>:554<:/b>:<:/p>: <:p>:12.3 Application: Printing an Invoice <:b>:562<:/b>:<:/p>: <:p>:12.4 Packages <:b>:574<:/b>:<:/p>: <:p>:<:b>:Chapter 13 RECURSION 585<:/b>:<:/p>: <:p>:13.1 Triangle Numbers Revisited <:b>:586<:/b>:<:/p>: <:p>:13.2 Problem Solving: Thinking Recursively <:b>:590<:/b>:<:/p>: <:p>:13.3 Recursive Helper Methods <:b>:594<:/b>:<:/p>: <:p>:13.4 The Efficiency of Recursion <:b>:596<:/b>:<:/p>: <:p>:13.5 Permutations <:b>:601<:/b>:<:/p>: <:p>:13.6 Mutual Recursion <:b>:606<:/b>:<:/p>: <:p>:13.7 Backtracking <:b>:612<:/b>:<:/p>: <:p>:<:b>:Chapter 14 SORTING AND SEARCHING 627<:/b>:<:/p>: <:p>:14.1 Selection Sort <:b>:628<:/b>:<:/p>: <:p>:14.2 Profiling the Selection Sort Algorithm <:b>:631<:/b>:<:/p>: <:p>:14.3 Analyzing the Performance of the Selection Sort Algorithm <:b>:634<:/b>:<:/p>: <:p>:14.4 Merge Sort <:b>:639<:/b>:<:/p>: <:p>:14.5 Analyzing the Merge Sort Algorithm <:b>:642<:/b>:<:/p>: <:p>:14.6 Searching <:b>:646<:/b>:<:/p>: <:p>:14.7 Problem Solving: Estimating the Running Time of an Algorithm <:b>:651<:/b>:<:/p>: <:p>:14.8 Sorting and Searching in the Java Library <:b>:656<:/b>:<:/p>: <:p>:<:b>:Chapter 15 THE JAVA COLLECTIONS FRAMEWORK 669<:/b>:<:/p>: <:p>:15.1 An Overview of the Collections Frame

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