Please note you need to add our email km0bookmail.org to approved e-mail addresses.Other readers will always be interested in your opinion of the books youve read.Whether youve loved the book or not, if you give your honest and detailed thoughts then people will find new books that are right for them.Regardless of major, students will be able to grasp concepts of problem-solving and programming thanks to Liangs fundamentals-first approach, students learn critical problem solving skills and core constructs before object-oriented programming.
Liangs approach has been extended to application-rich programming examples, which go beyond the traditional math-based problems found in most texts. Students 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, IO, 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. Increased data structures chapters make the Eighth Edition ideal for a full course on data structures. Review All the topics and concepts are clearly explained with examples and tips to remember with side texts. Introduction To Java Programming Liang Code Provided WhichSyed Riaz Ahmed, North Georgia College and State University The first, best feature of this text is the rich set of clear example code provided which are located in concise textual explanations well-suited for the modern undergraduate. In addition, the wide coverage of material makes this book suitable for several courses. Frank Ducrest, University of Louisiana Lafayette One book Liang for ALL Java courses. Maureen Opkins, California State University Long Beach The thorough nature of this text Liang should be stressed; it has utility as a reference far after the course is over. Loops Chapter 5. Methods Chapter 6. Single-Dimensional Arrays Chapter 7. Sorting Chapter 25. Lists, Stacks, and Queues, and Priority Queues Chapter 26. Java 2D Chapter 45. AVL Trees and Splay Trees Chapter 46. Trees and B-Trees Chapter 47. Hashing: 1368 pages: Prentice Hall; 8th Edition (January 2010): English ISBN-10: 0132130807 ISBN-13: 978-0132130806: 13.7 MiB 1.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |