Taylor's Library Banner
Image from Google Jackets

Java collections : an introduction to abstract data types, data structures, and algorithms / David A. Watt, Deryck F. Brown.

By: Contributor(s): Publication details: Chichester, England : John Wiley, c2001Description: xvi, 549 p. ; 24 cmISBN:
  • 047189978X
Subject(s): DDC classification:
  • 005.133 WAT
Contents:
Preface. - 1. Introduction. 2. Algorithms. 3. The Array Data Structure. 4. Linked-List Data Structures. 5. Abstract Data Types. 6. Stack Abstract Data Types. 7. Queue Abstract Data Types. 8. List Abstract Data Types. 9. Set Abstract Data Types. 10. Binary Tree Data Structures. 11. Map Abstract Data Types. 12. Hash-Table Data Structures. 13. Priority-Queue Abstract Data Types. 14. Tree Abstract Data Types. 15. Graph Abstract Data Types. 16. Balanced Search Tree Data Structures 17. Conclusion. - A. Summary of Mathematics for Algorithm Analysis. - B. Summary of Java. - C. Summary of the Java Collections Framework. - Further reading. - Index.
Summary: Java Collections is an introductory text on abstract data types, data structures, and algorithms using Java. Written at an appropriate level for a first course in algorithms and data structures, or a second course in programming using Java, this text concentrates on practical matters like software design and the Java Collection framework. Only essential supporting theory is included. The text focuses on abstract data types (ADTs) that turn up again and again in software design. It uses these ADTs to introduce and motivate the data structures required to implement them and the algorithms associated with the data structures. This approach helps Java programmers to chose the most suitable collection classes for their applications. - Back cover.
Holdings
Cover image Item type Current library Home library Collection Shelving location Shelf location Call number Materials specified Vol info Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Main Collection Taylor's Library-TU

Floor 3, Shelf 1 , Side 1, TierNo 6, BayNo 2

 005.133 WAT (Browse shelf(Opens below)) 1 Available SOCIT,15009,02,GR 5000038538

Preface. - 1. Introduction. 2. Algorithms. 3. The Array Data Structure. 4. Linked-List Data Structures. 5. Abstract Data Types. 6. Stack Abstract Data Types. 7. Queue Abstract Data Types. 8. List Abstract Data Types. 9. Set Abstract Data Types. 10. Binary Tree Data Structures. 11. Map Abstract Data Types. 12. Hash-Table Data Structures. 13. Priority-Queue Abstract Data Types. 14. Tree Abstract Data Types. 15. Graph Abstract Data Types. 16. Balanced Search Tree Data Structures 17. Conclusion. - A. Summary of Mathematics for Algorithm Analysis. - B. Summary of Java. - C. Summary of the Java Collections Framework. - Further reading. - Index.

Java Collections is an introductory text on abstract data types, data structures, and algorithms using Java. Written at an appropriate level for a first course in algorithms and data structures, or a second course in programming using Java, this text concentrates on practical matters like software design and the Java Collection framework. Only essential supporting theory is included. The text focuses on abstract data types (ADTs) that turn up again and again in software design. It uses these ADTs to introduce and motivate the data structures required to implement them and the algorithms associated with the data structures. This approach helps Java programmers to chose the most suitable collection classes for their applications. - Back cover.