The Java Collections Framework Revisited

Table of contents:

Projects

6.30

Rewrite the LinkedStack class from scratch so that it holds primitive ints. The ListNode class must also be altered. (This revised LinkedStack is more efficient than the general-purpose one, because it doesn't have to follow references or create instances of the Integer class.)

6.31

Implement the Deque interface from Problem 4.18. Write it from scratchdon't extend one of the classes from the Java collections framework. (Hint: Use a doubly linked list.)

6.32

Devise and write code for an efficient List implementation where elements are always inserted in groups of five and are never removed.

6.33

Write a DoublyLinkedList class which implements List but uses DoublyLinkedNodes. Use two interfaces, Predecessor and Successor. (Hint: The prev field of the first node and the next field of the last node should refer back to the DoublyLinkedList.)


Part I: Object-Oriented Programming

Encapsulation

Polymorphism

Inheritance

Part II: Linear Structures

Stacks and Queues

Array-Based Structures

Linked Structures

Part III: Algorithms

Analysis of Algorithms

Searching and Sorting

Recursion

Part IV: Trees and Sets

Trees

Sets

Part V: Advanced Topics

Advanced Linear Structures

Strings

Advanced Trees

Graphs

Memory Management

Out to the Disk

Part VI: Appendices

A. Review of Java

B. Unified Modeling Language

C. Summation Formulae

D. Further Reading

Index



Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
ISBN: 0131469142
EAN: 2147483647
Year: 2004
Pages: 216
Authors: Peter Drake

Similar book on Amazon

Flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net