Cantitate/Preț
Produs

Java Foundations: Introduction to Program Design and Data Structures: International Version

Autor John Lewis, Peter DePasquale, Joseph Chase
en Limba Engleză Mixed media product – 15 apr 2010
Inspired by the success of their best-selling introductory programming text, Java Software Solutions, authors Lewis, DePasquale, and Chase now release Java Foundations, Second Edition. This text is a comprehensive resource for instructors who want a two-or three-semester introduction to programming textbook that includes detail on data structures topics. Java Foundations introduces a Software Methodology early on and revisits it throughout to ensure students develop sound program development skills from the beginning. Control structures are covered before writing classes, providing a solid foundation of fundamental concepts and sophisticated topics.
Citește tot Restrânge

Preț: 44541 lei

Preț vechi: 55676 lei
-20% Nou

Puncte Express: 668

Preț estimativ în valută:
8525 8885$ 7097£

Carte indisponibilă temporar

Doresc să fiu notificat când acest titlu va fi disponibil:

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780137055340
ISBN-10: 013705534X
Pagini: 912
Dimensiuni: 187 x 232 mm
Greutate: 1.19 kg
Ediția:2Nouă
Editura: Pearson Education
Colecția Pearson Education
Locul publicării:Upper Saddle River, United States

Cuprins

1. Introduction
2. Data and Expressions
3. Using Classes and Objects
4. Conditionals and Loops
5. Writing Classes
6. Graphical User Interfaces
7. Arrays
8. Inheritance
9. Polymorphism
10. Exceptions
11. Recursion
12. Analysis of Algorithms
13. Searching and Sorting
14. Stacks
15. Queues
16. Trees
17. Binary Search Trees
18. Heaps and Priority Queues
19. Graphs
20. Hashing
21. Databases

Notă biografică

John Lewis is the co-author of the best-selling introductory Java programming book Java Software Solutions, as well as Java Software Structures,Programming with Alice and Java, and books for AP computer science.  He teaches courses at both Virginia Tech and Radford University. He received his Ph.D. degree from Virginia Tech.

Peter DePasquale is an assistant professor of computer science at the College of New Jersey (TCNJ). He is the author of Addison-Wesley’s Java Backpack Reference Guide and Addison-Wesley’s C++ Backpack Reference Guide as well as Programming with Alice and Java.

Joe Chase is an associate professor of computer science at Radford University. He is the co-author of Java Software Structures and Java Software Structures for AP* Computer Science AB.
 

Textul de pe ultima copertă

CourseSmart
Save money. Lighten your backpack. Access your textbooks anytime, from anywhere.

This title is available as an eTextbook from CourseSmart. Purchase your assigned textbook as a CourseSmart eTextbook, and stop lugging books around campus! You can also access CourseSmart eTextbooks from your iPhone.

Instructors, request your exam copies online and get instant access. Learn more at coursesmart.com.

Caracteristici

  • Presents objects in a gradual, natural manner. Concepts that overlap with procedural programming, such as methods and their invocation, are discussed in terms of an object-oriented approach.
  • Loaded with fully implemented examples, intertwining small examples, and realistic larger examples that are easy to understand.
  • Offers complete chapter on Graphical User Interfaces that includes engaging graphical examples.
  • Exclusive coverage of software-testing and debugging effective practices.
  • Provides plenty of opportunity for practice with extensive end-of-chapter questions, exercises, and projects.
SUPPLEMENTS
  • Source Code Files
  • Solutions Manual
  • PPTs
  • Test Bank
  • Labs
  • CourseSmart

Caracteristici noi

The following modifications have been made to improve the presentation of particular topics and the overall flow:
  • A stack is now used as the initial example of a collection so that the concept of a collection is more clearly established.
  • The discussion of Generics has been expanded and clarified.
  • The coverage of the Quick Sort and Merge Sort algorithms has been expanded.
  • The coverage of Analysis of Algorithms has been separated into its own chapter and expanded.
  • Material on Testing and Debugging has been incorporated into moreappropriate locations of the text.
  • The coverage of Search Trees and Heaps have been divided into separate chapters.
  • Two new chapters covering Hashing and Databases have been added.
  • End-of-chapter exercises and projects have been updated to reflect changes in the book.