Home   FAQs   New Arrivals   Specials   Pricing & Shipping   Location   Corporate Services   Why Choose Bookware?  
 Search:   
Call our store: 9955 5567 (from within Sydney) or 1800 734 567 (from outside Sydney)
 View Cart   Check Out   
 
Browse by Subject
 TAFE Accounting
 TAFE I.T./Computing
 TAFE - Other
I.T
 .NET
 Windows 8
 Adobe CS6
 Cisco
 CCNA 2012
 CCNP 2012
 Java
 VB
 ASP
 Web Design
 E-Commerce
 Project Management
 ITIL
 Macintosh
 Mobile Devices
 Linux
 Windows Server 2012
 SQL Server 2012
 SAP
Certification
 MCITP
 MCTS
Economics and Business
 Accounting
 Business Information Systems
 Economics
 Finance
 Management
 Marketing
 TAX
 Human Resources
Academic
 Law
 Nursing
 Medical
 Psychology
 Engineering

Introduction to Java Programming, Comprehensive: International Version, 8th Edition - **OUT OF PRINT. THERE IS A NEWER EDITION AVAILABLE. FOR THE 10th INTERNATIONAL EDITION, PLEASE PERFORM A NEW SEARCH USING THE FOLLOWING ISBN13: 9781292070018**

by: Y. Daniel Liang

Notify me when in stock

On-line Price: TBAPaperbackpackage, 1368

Retail Price: TBA

Publisher: PRENTICE HALL,02.04.10

Category: JAVA Level:

ISBN: 0132472759
ISBN13: 9780132472753

Add to Shopping Cart

**OUT OF PRINT. THERE IS A NEWER EDITION AVAILABLE. FOR THE 10th INTERNATIONAL EDITION, PLEASE PERFORM A NEW SEARCH USING THE FOLLOWING ISBN13: 9781292070018**

PRESCRIBED TEXT FOR ITC313 AT CSU DISTANCE ED - SEMESTER 2 2011

This top-selling Java book features comprehensive coverage ideal for a one-, two-, or three-semester CS1 course sequence.

Regardless of major, students will be able to grasp concepts of problem-solving and programming - thanks to Liang's fundamentals-first approach, students learn critical problem solving skills 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. 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, 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. Increased data structures chapters make the Eighth Edition ideal for a full course on data structures.

Updates to the 8e include:


  * Complete Revision - This edition is completely revised in every detail to enhance clarity, presentation, content, examples, and exercises.


  * New Problems - The book provides 20% new problems for examples and exercises to motivate and stimulate student interest in programming.


  * Early Console Input - Console input moved earlier so students can write interactive programs early.


  * Hand Trace Box - The hand trace box is added for many programs in early chapters so that students can see how a program is executed.


  * Java 2D - A brand-new bonus chapter 44 covers Java 2D.


  * Multidimensional Arrays - Single-dimensional arrays and multidimensional arrays are covered in two chapters to give instructors the flexibility to cover multidimensional arrays later.


  * Design Guidelines - Chapter 12, "Object-Oriented Design and Patterns," in the previous edition is deleted. The design guidelines and patterns are now spread in several chapters so these topics can be covered in appropriate context.


  * New Data Structures Chapters - The coverage on data structures is expanded with new bonus chapters on AVL trees, Splay trees, 2-3, B-trees, and red-black trees, and hashing. This edition can serve a full course on data structures.


  * Sudoku Problem Simplified - The case study for the Sudoku problem has been moved to the companion Website. A more pedagogically effective simple version of the Sudoku problem is presented in the textbook instead.


  * Basic GUI Earlier - The design of the API for Java GUI programming is an excellent example of how the object-oriented principle is applied. Students learn better with concrete and visual examples. So basic GUI is moved before introducing abstract classes and interfaces. You can however still choose to cover abstract classes and interfaces before GUI.


  * Exception Handling Earlier - Exception handling is covered before abstract classes and interfaces. You can however still choose to cover exception handling later.


  * Sorting - The chapter on sorting is moved to right after the chapter on algorithm efficiency so that students can immediately apply algorithm efficiency on sorting algorithms.