Request full copy

Introduction to Java Programming and Data Structures, 12th edition

Published by Pearson Prentice Hall (December 4, 2019) © 2020

  • Y Daniel Liang Georgia Southern University

eTextbook

per month

  • Anytime, anywhere learning with the Pearson+ app
  • Easy-to-use search, navigation and notebook
  • Simpler studying with flashcards
from$53.32

  • Hardcover, paperback or looseleaf edition
  • Affordable rental option for select titles

For courses in Java programming.

Seamlessly integrates programming, data structures and algorithms in 1 text

With a fundamentals-first approach, Introduction to Java Programming and Data Structures, Comprehensive Version builds a strong foundation of basic programming concepts and techniques before teaching 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 many 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.

Hallmark features of this title

  • 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.
  • 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 and grouped by sections for students to self-test programming concepts and techniques.

New and updated features of this title

  • 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.
  • 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.
  • 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.
  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
  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

APPENDICES

  • A. Java Keywords and Reserved Words
  • B. The ASCII Character Set
  • C. Operator Precedence Chart
  • D. Java Modifiers
  • E. Special Floating-Point Values
  • F. Number Systems
  • G. Bitwise Operations
  • H. Regular Expressions
  • I. Enumerated Types
  • J. The Big-O, Big-Omega, and Big-Theta Notations

About our author

Dr. Liang earned his Ph.D. in Computer Science from the University of Oklahoma in 1991, and his M.S. and B.S. in Computer Science from Fudan University in Shanghai, China in 1986 and 1983. Prior to joining Armstrong State University (now merged with Georgia Southern University), he was an Associate Professor in computer science at Purdue University in Fort Wayne, Indiana, where he twice received the Excellence in Research award.

Dr. Liang is currently a Professor of Computer Science at Georgia Southern University. He was trained in theoretical computer science. He has published in the SIAM Journal on Computing, Discrete Applied Mathematics, Acta Informatics and Information Processing Letters. He is the author of more than 30 books. His popular computer science texts are widely used in the world.

Dr. Liang was elected a Java Champion by Sun Microsystems (now Oracle) in 2005. He has given lectures on programming internationally.

Need help? Get in touch

Pearson+

All in one place. Pearson+ offers instant access to eTextbooks, videos and study tools in one intuitive interface. Students choose how they learn best with enhanced search, audio and flashcards. The Pearson+ app lets them read where life takes them, no wi-fi needed. Students can access Pearson+ through a subscription or their MyLab or Mastering course.

Video
Play
Privacy and cookies
By watching, you agree Pearson can share your viewership data for marketing and analytics for one year, revocable by deleting your cookies.

Video transcript (PDF | 16KB) 

Pearson eTextbook: What’s on the inside just might surprise you

They say you can’t judge a book by its cover. It’s the same with your students. Meet each one right where they are with an engaging, interactive, personalized learning experience that goes beyond the textbook to fit any schedule, any budget, and any lifestyle. 

Digital Learning NOW

Extend your professional development and meet your students where they are with free weekly Digital Learning NOW webinars. Attend live, watch on-demand, or listen at your leisure to expand your teaching strategies. Earn digital professional development badges for attending a live session.

Explore webinars