Introduction to Java Programming and Data Structures, 13th edition

Published by Pearson (May 24, 2023) © 2024

  • Y Daniel Liang Georgia Southern University
Products list

eTextbook features

  • Instant access to eTextbook
  • Search, highlight, and notes
  • Create flashcards
Products list

Access details

  • Instant access once purchased
  • Anytime, anywhere learning via mobile app
  • Register via course invite or LMS link (Blackboardâ„¢, Canvasâ„¢, Moodle or D2L®)

Features

  • All-in-one digital learning platform
  • Integrated videos and rich multimedia
  • Immediate feedback on tests and quizzes
  • Highlighting, notetaking and study tips
  • App syncs progress across devices

Introduction to Java Programming and Data Structures seamlessly integrates programming, data structures and algorithms into 1 text. It takes a fundamentals-first approach, helping you build a strong foundation of basic programming concepts and techniques before moving on to object-oriented programming and advanced Java programming. Author Daniel Liang explains programming in an easy-to-follow, problem-driven way that focuses on problem solving rather than syntax. Basic concepts are illustrated by example, and interesting exercises with various levels of difficulty offer many opportunities for you to practice and apply what you have learned.

The 13th Edition is aligned to the latest Java 18 technology and completely revised to enhance clarity, presentation, content, examples, and exercises.

  1. Introduction to Computers, Programs, and Java
  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

APPENDICES

  1. Java Keywords
  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

Need help? Get in touch