Data Structures and Other Objects Using JavaThis book takes a gentle approach to the data structures course in Java. It offers an early, self-contained review of object-oriented programming and Java to give students a firm grasp of key concepts, and allows those experienced in other languages to adjust easily. The book also offers a flexibility which allows professors such options as emphasizing object-oriented programming, covering recursion and sorting early or accelerating the pace of the course. This title meets the needs of professors searching for a book to balance the introduction of object-oriented programming and data structures with Java. The new edition has been updated to cover Java 1.3 and includes new appendices with more reference material on such topics as Java collections. It also features increased coverage of object-oriented programming and inheritance. New exercises on radix sort and shell sort have also been added. |
From inside the book
Results 1-3 of 70
... number of elements in a bag as the input size . For example , if b is a bag containing n integers , then the number of operations required by b.count - Occurrences is a formula involving n . To determine the operations , we'll see how ...
... number of elements in this sequence . Returns : start the number of elements in this sequence public void start ( ) Set the current element at the front of this sequence . Postcondition : The front element of this sequence is now the ...
... number of nodes accessed is still O ( d ) for all the operations . For example , consider adding an element to a ... elements in the tree rather than in terms of the tree's depth . To express the time analyses in these terms , we must first ...
Contents
CHAPTER | 2 |
LEARNING OBJECTIVES | 14 |
Java Classes and Information Hiding | 40 |
Copyright | |
44 other sections not shown