Regardless of major, students will be able to grasp concepts of problem-solving and programming -- thanks to Liang's ground breaking fundamentals-first approach, which enables students to understand problem solving and core constructs before object-oriented programming. Liang's approach has been extended to application-rich programming examples, which go beyond the traditional math-based problems found in most texts. Although students begin using objects early, they are introduced to topics like control statements, methods, and arrays before learning to create classes Later chapters introduce advanced topics including graphical user interface, exception handling, I/O, and data structures. Small, simple examples demonstrate concepts and techniques while longer examples are presented in case studies with overall discussions and thorough line-by-line explanations. In the Seventh Edition, only standard classes are used. Supplements: Author Website: http://www.cs.armstrong.edu/liang/intro7e/ *Student Resources include: Source Code, Solutions to even numbered Programming Problems, Answers to review questions, Software related links and errata*Instructor Resources include: Interactive and Animated Slides, full programming exercises. UML diagram solutions, quiz generator, LiveLab, and sample exams. (contact your local sales rep for password) Prentice Hall Companion Website: Student Resources: *VideoNotes are Pearson's new visual tool designed for teaching students key programming concepts and techniques. These short step-by-step videos demonstrate how to solve problems from design through coding. VideoNotes allow for self-paced instruction with easy navigation including the ability to select, play, rewind, fast-forward, and stop within each VideoNote exercises. Margin icons in your textbook let you know when a VideoNotes video is available for a particular concept or homework problem. *GOAL Pearson's premier online homework and assessment system for Computer Science. Instructor Resources also available at password protected Instructor Resources. Click on the Resouces tab above to "view downloadable files". *Power Point Lecture Slides *Solutions *GOAL : Pearson's premier online homework and assessment system for Computer Science. *Test Files

Table of Contents

NOTE: this is a comprehensive version. For a brief text, please visit "Introduction to Java Programming, Brief Edition" Chapter 1 Introduction to Computers, Programs, and Java Chapter 2 Elementary Programming Chapter 3 Selections Chapter 4 Loops Chapter 5 Methods Chapter 6 Arrays Chapter 7 Objects and Classes Chapter 8 Strings and Text I/O Chapter 9 Thinking in Objects Chapter 10 Inheritance and Polymorphism Chapter 11 Abstract Classes and Interfaces Chapter 12 Object-Oriented Design and Patterns Chapter 13 GUI Basics Chapter 14 Graphics Chapter 15 Event-Driven Programming Chapter 16 Creating User Interfaces Chapter 17 Applets and Multimedia Chapter 18 Exception Handling Chapter 19 Binary I/O Chapter 20 Recursion Chapter 21 Generics Chapter 22 Java Collections Framework Chapter 23 Algorithm Efficiency Chapter 24 Lists, Stacks, and Queues Chapter 25 Trees, Heaps, and Priority Queues Chapter 26 Sorting Chapter 27 Graph Applications Chapter 28 Weighted Graph Applications Chapter 29 Multithreading Chapter 30 Networking Chapter 31 Internationalization Chapter 32 JavaBeans and Bean Events Chapter 33 Containers, Layout Managers, and Borders Chapter 34 Menus, Toolbars, and Dialogs Chapter 35 MVC and Swing Models Chapter 36 JTable and JTree Chapter 37 Java Database Programming Chapter 38 Advanced Java Database Programming Chapter 39 Servlets Chapter 40 JavaServer Pages Chapter 41 JSF and Visual Web Development Chapter 42 Web Services Chapter 43 Remote Method Invocation ***Note that Chapters 38-43 are bonus chapters in the companying CD-ROM Appendixes Appendix A Java Keywords Appendix B The ASCII Character Set Appendix C Operator Precedence Chart Appendix D Java Modifiers Appendix E Special Floating-Point Values Appendix F Correlation between the 7E and 6E

About the Author

Dr. Liang earned his Ph.D. in Computer Science from the University of Okalahoma in 1991, and an MS and BS in Computer Science from Fudan University in Shanghai, China, in 1986 and 1983. Prior to joining Armstrong, he was an associate professor in computer science at Purdue University in Fort Wayne, where he twice received the Excellence in Research award. Dr. Liang was trained in theoretical computer science. He was active in graph algorithms from 1990 to 1995 and published more than ten papers in several established journals such as SIAM Journal on Computing, Discrete Applied Mathematics, Acta Informatics, and Information Processing Letters. Since 1996, he has devoted to writing texts and published more than thirty books with Prentice Hall. His popular computer science texts are widely adopted in the world. Dr. Liang was elected a Java Champion in 2005 by Sun Microsystems. He has given lectures on Java internationally.