Data Abstraction and Problem Solving with Java: Walls and Mirrors

From the Publisher: Data Abstraction and Problem Solving in C++, and is now updated to the Java programming language. It uses the running theme of "Walls and Mirrors" to help make clear the challenging concepts of recursion (the mirrors) and data abstraction (the walls). Authors Carrano and Prichard cover key object-oriented concepts, including encapsulation, inheritance, and polymorphism. However, the focus of the book remains on data abstraction instead of simply Java syntax. Features: Provides a firm foundation in data abstraction (the walls), emphasizing the distinction between specification and implementation as the foundation for the object-oriented approach Offers extensive coverage of recursion (the mirrors) and uses the technique throughout many examples and exercises. Introduces analysis of algorithms and Big "O" notation. Provides an appendix covering basic Java syntax for those know a different language or who need a refresher Contains many pedagogica.

See Full PDF See Full PDF

Related Papers

Download Free PDF View PDF

We discuss a problem of handling resource reservations. The resource can be reserved for some time, it can be freed or it can be queried what is the largest amount of reserved resource during a time interval. We show that the problem has a lower bound of $\Omega(\log n)$ per operation on average and we give a matching upper bound algorithm. Our solution also solves a dynamic version of the related problems of a prefix sum and a partial sum.

Download Free PDF View PDF

This course has two aims. The first is to teach programming. The second is to present some fundamental principles of computer science, especially algorithm design. Most students will have some programming experience already, but there are few people whose programming cannot be improved through greater knowledge of basic principles. Please bear this point in mind if you have extensive experience and find parts of the course rather slow.

Download Free PDF View PDF

Software testing is typically a rushed and neglected activity that is done at the final stages of software development. In particular, most students tend to test their programs manually and very seldom perform adequate testing. In this paper, two basic data structures are utilized to highlight the importance of writing effective test cases by testing their fundamental properties. The paper also includes performance testing at the unit level, of a classic recursive problem called the Towers of Hanoi. This teaching approach accomplishes two important pedagogical objectives: (1) it allows students to think about how to find hidden bugs and defects in their programs and (2) it encourages them to test more effectively by leveraging data structures that are already familiar to them.

Download Free PDF View PDF

Binary tree traversal refers to the process of visiting each node in a specified order. Given the inorder traversal of a binary tree, along with one of its preorder or postorder traversals, the original binary tree can be uniquely identified. Many recursive and non recursive method of construction of the tree from inorder and any of the postorder or preorder traversal have been proposed. In this paper one of the proposed algorithms has been examined. This algorithm computes the wrong tree for some input sequences. We show a particular situation in which the algorithm fails and a solution for this situation is proposed. The proposed a modified non-recursive algorithm for reconstructing a binary tree which generates the correct tree otherwise an error has been reported.

Download Free PDF View PDF

Prerequisite: Purpose: To introduce learners to basics in programming and algorithms.

Download Free PDF View PDF

Design patterns may introduce a new perspective on the traditional subject of data structures. We analyze in this paper how design patterns can be used for data structures implementation, and their advantages. The presentation is leaded by the design patterns classification: behavioral, structural and creational, and we prove here that all classes of patterns could be successfully used for data structures implementation. By using design patterns for data structures construction we emphasize new perspectives on data structures: separation between concepts and their representations, storage independence, reusability, and others. These could bring important changes in the design of the new collections libraries or frameworks. Examples that illustrate the impact of the design patterns in this context are presented, too. This analysis shows that design patterns could bring important advantages in basic fields of computer science, too. 2000 Mathematics Subject Classification: 68P05.

Download Free PDF View PDF

See Full PDF

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

RELATED PAPERS

Download Free PDF View PDF

Electronics And Electrical Engineering

Download Free PDF View PDF

Proceedings of the ACMSE 2006, Melbourne, Florida, USA, pp. 312-318, ACM, March 2006.

Download Free PDF View PDF

Science of Computer Programming

Download Free PDF View PDF

INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY

Download Free PDF View PDF

Discrete Mathematics & Theoretical Computer Science

Download Free PDF View PDF

International Journal of Computer Applications

Download Free PDF View PDF