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 88
... Expressions - Specification The program takes as input a fully parenthesized numeric expression such as the following : ( ( ( ( 12 + 9 ) / 3 ) + 7.2 ) * ( ( 6 - - 4 ) / 8 ) ) The expression consists of integers or double numbers ...
Michael Main. infix expression postfix expression algorithm for fully parenthesized expressions Translating Infix to Postfix Notation Because it is so easy to evaluate a postfix expression , one strategy for evaluating an ordinary infix ...
... expression should have , but first let's look at the kind of quantity we have in mind for the variant expression of the pow method . The variant expression for pow depends on whether n is negative or not . For a negative n , the variant ...
Contents
CHAPTER | 2 |
LEARNING OBJECTIVES | 14 |
Java Classes and Information Hiding | 40 |
Copyright | |
44 other sections not shown