Imagen de portada de Amazon
Imagen de Amazon.com
Imagen de cubierta Syndetics
Portada de Syndetics
Imagen de OpenLibrary

Java software solutions foundations of program design John Lewis, William Loftus.

Por: Colaborador(es): Detalles de publicación: Boston Prentice Hall 2012.Edición: 7th edDescripción: xxvi, 806 p. (some col.) ill. 24 cmISBN:
  • 9780132149181 (alk. paper)
Tema(s): Clasificación CDD:
  • 005.13/3 22
Clasificación LoC:
  • QA76.73.J38 L49 2012
Valoración
    Valoración media: 0.0 (0 votos)
Existencias
Imagen de cubierta Tipo de ítem Biblioteca actual Biblioteca de origen Colección Ubicación en estantería Signatura topográfica Materiales especificados Info Vol URL Copia número Estado Notas Fecha de vencimiento Código de barras Reserva de ítems Prioridad de la cola de reserva de ejemplar Reservas para cursos
Libro Biblioteca de Mayagüez Colección General mb QA76.73 .J38 L49 2012 (Navegar estantería(Abre debajo)) Disponible 50000003229662
Total de reservas: 0

Descripciones mejoradas de Syndetics:

Java Software Solutions teaches a foundation of programming techniques to foster well-designed object-oriented software. Heralded for its integration of small and large realistic examples, this worldwide best-selling text emphasizes building solid problem-solving and design skills to write high-quality programs.

MyProgrammingLab , Pearson's new online homework and assessment tool, is available with this edition. Subscriptions to MyProgrammingLab are available to purchase online or packaged with your textbook (unique ISBN). Use the following ISBNs to purchase MyProgrammingLab:

Java Software Solutions: Foundations of Program Design & MyProgrammingLab with Pearson eText Student Access Code Card for Java Software Solutions, 7/E ISBN:0132760770
This package includes the Java Software Solutions , textbook, an access card for MyProgrammingLab, and a Pearson eText student access code card for the Java Software Solutions Pearson eText. MyProgrammingLab with Pearson eText -- Access Card -- for Java Software Solutions, 7/E ISBN: 013277478X
This stand-alone access card package contains an access card for MyProgrammingLab and a Pearson eText student access code card for the Java Software Solutions Pearson eText. Purchase instant access to MyProgrammingLab online.

eigm 03/2012

Includes bibliographical references and index.

Tabla de contenidos provista por Syndetics

  • Preface(p. v)
  • Chapter 1 Introduction(p. 1)
  • 1.1 Computer Processing(p. 2)
  • Software Categories(p. 3)
  • Digital Computers(p. 4)
  • Binary Numbers(p. 7)
  • 1.2 Hardware Components(p. 10)
  • Computer Architecture(p. 11)
  • Input/Output Devices(p. 12)
  • Main Memory and Secondary Memory(p. 13)
  • The Central Processing Unit(p. 17)
  • 1.3 Networks(p. 20)
  • Network Connections(p. 20)
  • Local-Area Networks and Wide-Area Networks(p. 22)
  • The Internet(p. 23)
  • The World Wide Web(p. 24)
  • Uniform Resource Locators(p. 25)
  • 1.4 The Java Programming Language(p. 26)
  • A Java Program(p. 27)
  • Comments(p. 29)
  • Identifiers and Reserved Words(p. 31)
  • White Space(p. 33)
  • 1.5 Program Development(p. 36)
  • Programming Language Levels(p. 36)
  • Editors, Compilers, and Interpreters(p. 38)
  • Development Environments(p. 40)
  • Syntax and Semantics(p. 41)
  • Errors(p. 42)
  • 1.6 Object-Oriented Programming(p. 44)
  • Problem Solving(p. 45)
  • Object-Oriented Software Principles(p. 46)
  • Chapter 2 Data and Expressions(p. 57)
  • 2.1 Character Strings(p. 58)
  • The print and println Methods(p. 58)
  • String Concatenation(p. 60)
  • Escape Sequences(p. 63)
  • 2.2 Variables and Assignment(p. 65)
  • Variables(p. 65)
  • The Assignment Statement(p. 67)
  • Constants(p. 69)
  • 2.3 Primitive Data Types(p. 71)
  • Integers and Floating Points(p. 71)
  • Characters(p. 73)
  • Booleans(p. 74)
  • 2.4 Expressions(p. 75)
  • Arithmetic Operators(p. 75)
  • Operator Precedence(p. 76)
  • Increment and Decrement Operators(p. 80)
  • Assignment Operators(p. 81)
  • 2.5 Data Conversion(p. 83)
  • Conversion Techniques(p. 85)
  • 2.6 Interactive Programs(p. 87)
  • The Scanner Class(p. 87)
  • 2.7 Graphics(p. 92)
  • Coordinate Systems(p. 92)
  • Representing Color(p. 94)
  • 2.8 Applets(p. 95)
  • Executing Applets Using the Web(p. 98)
  • 2.9 Drawing Shapes(p. 99)
  • The Graphics Class(p. 99)
  • Software Failure: NASA Mars Climate Orbiter and Polar Lander(p. 111)
  • Chapter 3 Using Classes and Objects(p. 113)
  • 3.1 Creating Objects(p. 114)
  • Aliases(p. 116)
  • 3.2 The String Class(p. 118)
  • 3.3 Packages(p. 122)
  • The import Declaration(p. 124)
  • 3.4 The Random Class(p. 126)
  • 3.5 The Math Class(p. 129)
  • 3.6 Formatting Output(p. 132)
  • The NumberFormat Class(p. 132)
  • The DecimalFormat Class(p. 134)
  • The printf Method(p. 135)
  • 3.7 Enumerated Types(p. 138)
  • 3.8 Wrapper Classes(p. 141)
  • Autoboxing(p. 143)
  • 3.9 Components and Containers(p. 143)
  • Frames and Panels(p. 144)
  • 3.10 Nested Panels(p. 148)
  • 3.11 Images(p. 151)
  • Chapter 4 Writing Classes(p. 159)
  • 4.1 Classes and Objects Revisited(p. 160)
  • 4.2 Anatomy of a Class(p. 162)
  • Instance Data(p. 167)
  • UML Class Diagrams(p. 167)
  • 4.3 Encapsulation(p. 169)
  • Visibility Modifiers(p. 170)
  • Accessors and Mutators(p. 171)
  • 4.4 Anatomy of a Method(p. 172)
  • The return Statement(p. 174)
  • Parameters(p. 175)
  • Local Data(p. 175)
  • Bank Account Example(p. 176)
  • 4.5 Constructors Revisited(p. 181)
  • 4.6 Graphical Objects(p. 182)
  • 4.7 Graphical User Interfaces(p. 191)
  • 4.8 Buttons(p. 192)
  • 4.9 Text Fields(p. 196)
  • Software Failure: Denver Airport Baggage Handling System(p. 205)
  • Chapter 5 Conditionals and Loops(p. 207)
  • 5.1 Boolean Expressions(p. 208)
  • Equality and Relational Operators(p. 209)
  • Logical Operators(p. 210)
  • 5.2 The if Statement(p. 213)
  • The if-else Statement(p. 216)
  • Using Block Statements(p. 219)
  • Nested if Statements(p. 223)
  • 5.3 Comparing Data(p. 226)
  • Comparing Floats(p. 226)
  • Comparing Characters(p. 227)
  • Comparing Objects(p. 228)
  • 5.4 The while Statement(p. 230)
  • Infinite Loops(p. 234)
  • Nested Loops(p. 236)
  • The break and continue Statements(p. 239)
  • 5.5 Iterators(p. 241)
  • Reading Text Files(p. 242)
  • 5.6 The ArrayList Class(p. 245)
  • 5.7 Determining Event Sources(p. 248)
  • 5.8 Check Boxes and Radio Buttons(p. 251)
  • Check Boxes(p. 251)
  • Radio Buttons(p. 255)
  • Software Failure: Therac-25(p. 267)
  • Chapter 6 More Conditionals and Loops(p. 269)
  • 6.1 The switch Statement(p. 270)
  • 6.2 The Conditional Operator(p. 274)
  • 6.3 The do Statement(p. 275)
  • 6.4 The for Statement(p. 279)
  • The for-each Loop(p. 282)
  • Comparing Loops(p. 284)
  • 6.5 Drawing with Loops and Conditionals(p. 285)
  • 6.6 Dialog Boxes(p. 291)
  • Chapter 7 Object-Oriented Design(p. 301)
  • 7.1 Software Development Activities(p. 302)
  • 7.2 Identifying Classes and Objects(p. 303)
  • Assigning Responsibilities(p. 305)
  • 7.3 Static Class Members(p. 305)
  • Static Variables(p. 306)
  • Static Methods(p. 306)
  • 7.4 Class Relationships(p. 310)
  • Dependency(p. 310)
  • Dependencies Among Objects of the Same Class(p. 310)
  • Aggregation(p. 316)
  • The this Reference(p. 320)
  • 7.5 Interfaces(p. 322)
  • The Comparable Interface(p. 327)
  • The Iterator Interface(p. 328)
  • 7.6 Enumerated Types Revisited(p. 329)
  • 7.7 Method Design(p. 332)
  • Method Decomposition(p. 333)
  • Method Parameters Revisited(p. 338)
  • 7.8 Method Overloading(p. 343)
  • 7.9 Testing(p. 345)
  • Reviews(p. 346)
  • Defect Testing(p. 346)
  • 7.10 GUI Design(p. 349)
  • 7.11 Layout Managers(p. 350)
  • Flow Layout(p. 352)
  • Border Layout(p. 356)
  • Grid Layout(p. 359)
  • Box Layout(p. 361)
  • 7.12 Borders(p. 365)
  • 7.13 Containment Hierarchies(p. 369)
  • Software Failure: 2003 Northeast Blackout(p. 377)
  • Chapter 8 Arrays(p. 379)
  • 8.1 Array Elements(p. 380)
  • 8.2 Declaring and Using Arrays(p. 381)
  • Bounds Checking(p. 384)
  • Alternate Array Syntax(p. 389)
  • Initializer Lists(p. 389)
  • Arrays as Parameters(p. 390)
  • 8.3 Arrays of Objects(p. 392)
  • 8.4 Command-Line Arguments(p. 402)
  • 8.5 Variable Length Parameter Lists(p. 404)
  • 8.6 Two-Dimensional Arrays(p. 408)
  • Multidimensional Arrays(p. 412)
  • 8.7 Polygons and Polylines(p. 413)
  • The Polygon Class(p. 416)
  • 8.8 Mouse Events(p. 418)
  • 8.9 Key Events(p. 427)
  • Software Failure: LA Air Traffic Control(p. 441)
  • Chapter 9 Inheritance(p. 443)
  • 9.1 Creating Subclasses(p. 444)
  • The protected Modifier(p. 447)
  • The super Reference(p. 450)
  • Multiple Inheritance(p. 453)
  • 9.2 Overriding Methods(p. 455)
  • Shadowing Variables(p. 457)
  • 9.3 Class Hierarchies(p. 458)
  • The Object Class(p. 460)
  • Abstract Classes(p. 461)
  • Interface Hierarchies(p. 463)
  • 9.4 Visibility(p. 463)
  • 9.5 Designing for Inheritance(p. 466)
  • Restricting Inheritance(p. 467)
  • 9.6 The Component Class Hierarchy(p. 468)
  • 9.7 Extending Adapter Classes(p. 471)
  • 9.8 The Timer Class(p. 475)
  • Software Failure: Ariane 5 Flight 501(p. 485)
  • Chapter 10 Polymorphism(p. 487)
  • 10.1 Late Binding(p. 488)
  • 10.2 Polymorphism via Inheritance(p. 489)
  • 10.3 Polymorphism via Interfaces(p. 502)
  • 10.4 Sorting(p. 504)
  • Selection Sort(p. 505)
  • Insertion Sort(p. 511)
  • Comparing Sorts(p. 512)
  • 10.5 Searching(p. 513)
  • Linear Search(p. 513)
  • Binary Search(p. 515)
  • Comparing Searches(p. 519)
  • 10.6 Designing for Polymorphism(p. 519)
  • 10.7 Event Processing(p. 521)
  • 10.8 File Choosers(p. 522)
  • 10.9 Color Choosers(p. 525)
  • 10.10 Sliders(p. 527)
  • Chapter 11 Exceptions(p. 537)
  • 11.1 Exception Handling(p. 538)
  • 11.2 Uncaught Exceptions(p. 539)
  • 11.3 The try-catch Statement(p. 540)
  • The finally Clause(p. 544)
  • 11.4 Exception Propagation(p. 545)
  • 11.5 The Exception Class Hierarchy(p. 549)
  • Checked and Unchecked Exceptions(p. 552)
  • 11.6 I/O Exceptions(p. 553)
  • 11.7 Tool Tips and Mnemonics(p. 557)
  • 11.8 Combo Boxes(p. 564)
  • 11.9 Scroll Panes(p. 569)
  • 11.10 Split Panes(p. 572)
  • Chapter 12 Recursion(p. 583)
  • 12.1 Recursive Thinking(p. 584)
  • Infinite Recursion(p. 584)
  • Recursion in Math(p. 585)
  • 12.2 Recursive Programming(p. 586)
  • Recursion vs Iteration(p. 589)
  • Direct vs Indirect Recursion(p. 589)
  • 12.3 Using Recursion(p. 590)
  • Traversing a Maze(p. 591)
  • The Towers of Hanoi(p. 596)
  • 12.4 Recursion in Graphics(p. 601)
  • Tiled Pictures(p. 601)
  • Fractals(p. 604)
  • Chapter 13 Collections(p. 617)
  • 13.1 Collections and Data Structures(p. 618)
  • Separating Interface from Implementation(p. 618)
  • 13.2 Dynamic Representations(p. 619)
  • Dynamic Structures(p. 619)
  • A Dynamically Linked List(p. 620)
  • Other Dynamic List Representations(p. 625)
  • 13.3 Linear Data Structures(p. 627)
  • Queues(p. 627)
  • Stacks(p. 628)
  • 13.4 Non-Linear Data Structures(p. 631)
  • Trees(p. 631)
  • Graphs(p. 632)
  • 13.5 The Java Collections API(p. 634)
  • Generics(p. 634)
  • Appendix A Glossary(p. 641)
  • Appendix B Number Systems(p. 665)
  • Appendix C The Unicode Character Set(p. 673)
  • Appendix D Java Operators(p. 677)
  • Appendix E Java Modifiers(p. 683)
  • Appendix F Java Coding Guidelines(p. 687)
  • Appendix G Java Applets(p. 693)
  • Appendix H Regular Expressions(p. 695)
  • Appendix I Javadoc Documentation Generator(p. 697)
  • Appendix J The PaintBox Project(p. 703)
  • Appendix K GUI Events(p. 715)
  • Appendix L Java Syntax(p. 719)
  • Appendix M The Java Class Library(p. 733)
  • Appendix N Answers to Self-Review Questions(p. 735)
  • Index(p. 789)

Notas de autor provistas por Syndetics

John Lewis is the co-author of the previous editions of the Java Software Solutions textbook, Java Software Structures , Java Foundations , and the Java Software Solutions textbook used for AP computer science classes.
Compartir
logopucpr-y-vive

Contáctanos

¡Queremos saber de ti!

Tel. 787.841.2000 Ext. 1801

bibliotecavaldes@pucpr.edu

⁣Búscanos en las redes

© 2026 Desarrollado por Ignite Online • All Rights Reserved • Powered by Koha.