Home > Store

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyLab Programming with Pearson eText -- Access Card Package, 12th Edition

Register your product to gain access to bonus material or receive a coupon.

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyLab Programming with Pearson eText -- Access Card Package, 12th Edition

ValuePack

  • Sorry, this book is no longer in print.
Not for Sale

About

Features

Provide students with the most relevant and current coding practices

  • UPDATED -  Java 9, 10, 11 and FX11 are covered to keep the text up-to-date with current technologies. Examples are improved and simplified.
  • UPDATED - Lambda expressions are used in more examples and exercises in the data structures chapters to simplify coding.
  • NEW - Both Comparable and Comparator are used to compare elements in Heap, Priority-Queue, BST, and AVLTree. This is consistent with the Java API, and is more useful and flexible.
  • NEW - String matching algorithms are introduced in Chapter 22: Developing Efficient Algorithms.

Help students understand the fundamentals of programming

  • UPDATED - VideoNotes Tutorials provide step-by-step video tutorials specifically designed to enhance the programming concepts presented in the text.
  • Check Points provide review questions to help students track their progress as they read through the chapter and evaluate their learning.
  • The Chapter Summary reviews the important subjects that students should understand and remember. It helps them reinforce the key concepts they have learned in the chapter.
  • Notes, Tips, Cautions, and Design Guides are inserted throughout the text to offer valuable advice and insight on important aspects of program development.

Foster critical-thinking and problem-solving skills 

  • UPDATED - Programming Exercises are grouped by sections to provide students with opportunities to apply the new skills they have learned on their own. Additionally, more than 200 programming exercises with solutions, including several newly added exercises, are provided to the instructors on the Instructor Resource Website. These exercises are not printed in the text.
  • Problems and Case Studies teach problem-solving and programming concepts. The book uses many small, simple, and stimulating examples to demonstrate important ideas.
  • Quizzes are accessible online, grouped by sections, for students to self-test on programming concepts and techniques. 

Description

  • Copyright 2020
  • Edition: 12th
  • ValuePack
  • ISBN-10: 0-13-651935-0
  • ISBN-13: 978-0-13-651935-5

For courses in Java Programming.


A fundamentals-first introduction to basic programming concepts and techniques                                                                 

Introduction to Java Programming and Data Structures seamlessly integrates programming, data structures, and algorithms into one text. With a fundamentals-first approach, the text builds a strong foundation of basic programming concepts and techniques before teaching students object-oriented programming and advanced Java programming. Liang explains programming in a problem-driven way that focuses on problem solving rather than syntax, illustrating basic concepts by example and providing a large number of exercises with various levels of difficulty for students to practice. The 12th Edition is completely revised in every detail to enhance clarity, presentation, content, examples, and exercises.

Sample Content

Table of Contents

Brief Contents

  1. Introduction to Computers, Programs, and JavaTM
  2. Elementary Programming
  3. Selections
  4. Mathematical Functions, Characters, and Strings
  5. Loops
  6. Methods
  7. Single-Dimensional Arrays
  8. Multidimensional Arrays
  9. Objects and Classes
  10. Object-Oriented Thinking
  11. Inheritance and Polymorphism
  12. Exception Handling and Text I/O
  13. Abstract Classes and Interfaces
  14. JavaFX Basics
  15. Event-Driven Programming and Animations
  16. JavaFX UI Controls and Multimedia
  17. Binary I/O
  18. Recursion
  19. Generics
  20. Lists, Stacks, Queues, and Priority Queues
  21. Sets and Maps
  22. Developing Efficient Algorithms
  23. Sorting
  24. Implementing Lists, Stacks, Queues, and Priority Queues
  25. Binary Search Trees
  26. AVL Trees
  27. Hashing
  28. Graphs and Applications
  29. Weighted Graphs and Applications
  30. Aggregate Operations for Collection Streams
  • Bonus Chapters 31–44 are available from the Companion Website at www.pearsonhighered.com/liang:
    1. Advanced JavaFX and FXML
    2. Multithreading and Parallel Programming
    3. Networking
    4. Java Database Programming
    5. Advanced Database Programming
    6. Internationalization
    7. Servlets
    8. JavaServer Pages
    9. JavaServer Faces
    10. RMI
    11. Web Services
    12. 2-4 Trees and B-Trees
    13. Red-Black Trees
    14. Testing Using JUnit

    APPENDIXES

    1. Java Keywords and Reserved Words
    2. The ASCII Character Set
    3. Operator Precedence Chart
    4. Java Modifiers
    5. Special Floating-Point Values
    6. Number Systems
    7. Bitwise Operations
    8. Regular Expressions
    9. Enumerated Types
    10. The Big-O, Big-Omega, and Big-Theta Notations

    Updates

    Submit Errata

    More Information

    InformIT Promotional Mailings & Special Offers

    I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.