Java Software Solutions: Foundations of Program DesignThis book takes an object-oriented approach to Java using it in a way that is appropriate for those just learning to write high-quality programs. The book features both text-based and GUI-based examples to demonstrate computing concepts and provide readers with maximum versatility. This title has an early evolution of object concepts, developed in a way that capitalizes on the power of objects without overwhelming beginning programmers. It places less empahsis on applets and more emphasis on GUI-based applications, while still maintaining a clean division between graphical and non-graphical topics. This book is appropriate for beginning programmers who want to learn to program with Java as well as experienced programmers who want to add Java to their skill-set. |
From inside the book
Results 1-3 of 23
Page xvi
... data types ? What is a dynamic data structure ? Describe the steps , depicted in Figure 12.2 , to insert a node into a list . What special cases exist ? Answers to Self - Review Questions SR 12.1 GIES OF TU 5 OF DIEGU LIB 4310 ERS ...
... data types ? What is a dynamic data structure ? Describe the steps , depicted in Figure 12.2 , to insert a node into a list . What special cases exist ? Answers to Self - Review Questions SR 12.1 GIES OF TU 5 OF DIEGU LIB 4310 ERS ...
Page 625
... data structure may be worthwhile if it makes common operations on the structure more efficient . 12.3 LINEAR DATA STRUCTURES In addition to lists , some data structures have become classic in that they repre- sent important generic ...
... data structure may be worthwhile if it makes common operations on the structure more efficient . 12.3 LINEAR DATA STRUCTURES In addition to lists , some data structures have become classic in that they repre- sent important generic ...
Page 629
... structure . Key Concept A tree is a non - linear data structure that organizes data into a hierarchy . In a binary tree , each node can have no more than two child nodes . Binary trees are useful in various ... DATA STRUCTURES 629.
... structure . Key Concept A tree is a non - linear data structure that organizes data into a hierarchy . In a binary tree , each node can have no more than two child nodes . Binary trees are useful in various ... DATA STRUCTURES 629.
Other editions - View all
Java Software Solutions: Foundations of Program Design John Lewis,William Loftus No preview available - 2006 |
Java Software Solutions: Foundations of Program Design John Lewis,William Loftus No preview available - 2006 |
Common terms and phrases
allows the user applet args array ArrayList binary bits bitwise operators boolean button byte Chapter color components constructor containment hierarchy contains created data structure declared defined Design and implement digits disk displayed drawing enumerated type event example executed Expression Figure floating point graphical user interface hexadecimal hierarchy inheritance input insertion sort instantiated integer invoked Java Development Kit Java program Java reserved word javadoc Key Concept label layout manager Lewis/Loftus linked list listener loop main memory main method method called modifier mouse myCodeMate node num2 number system object-oriented operands operator output package panel parameter particular polymorphic println prints programming language public class public static void public void recursion reference represents Scanner selection sort shown in Listing specified stack standard class library statement static void main stored String object System.out.println toString Unicode variable void main String