data structures & problem solving using java 4th edition

Data Structures and Problem Solving Using Java (4th Edition)

By mark allen weiss.

• ★ ★ ★ ★ 4.00 ·
• 5 Want to read
• 0 Currently reading
• 2 Have read

My Reading Lists:

Use this Work

Create a new list

My book notes.

My private notes about this edition:

Download Options

Check nearby libraries

• Library.link

Buy this book

This edition doesn't have a description yet. Can you add one ?

Previews available in: English

Showing 7 featured editions. View all 7 editions?

Add another edition?

Book Details

Classifications, the physical object, community reviews (0).

• Created April 30, 2008
• 11 revisions

Wikipedia citation

Copy and paste this code into your Wikipedia page. Need help?

Source Code for Data Structures and Problem Solving Using Java, Fourth Edition

Organization of files.

• Most of the general, standalone, code is in the root directory.
• There is an implementation of a large subset of java.util in package weiss.util . Its purpose is to illustrate how the concepts are used in an actual library implementation. This can be found in the weiss\util folder. Some of the sample code imports classes in weiss.util , but you can freely replace all occurrences of weiss.util with java.util . Needless to say, everything in weiss.util has a name clash with java.util , so you should not use wild-card import directives. These files are displayed in BOLDFACE font.
• The package weiss.nonstandard , in the weiss\nonstandard folder, contains nonstandard implementations of various data structures. The code is generally simpler that the code in the Java Collections API, and there are occasional name clashes (e.g. LinkedList and Stack ). This package also contains priority queue implementations, since that is not part of the Java Collections API. These files are display in ITALICS font.

CLASSPATH Info

• For MS-DOS: set CLASSPATH=C:\bookcode;.
• For Unix: setenv CLASSPATH bookcode:.

Complete Bundle

Package documentation, chapter 1: basic java, chapter 2: references, chapter 3: classes, chapter 4: inheritance, chapter 5: running times, chapter 6: the collections api, chapter 7: recursion, chapter 8: sorting, chapter 9: randomization, chapter 10: fun and games, chapter 11: applications of stacks -- compilers and parsing, chapter 12: utilities, chapter 13: simulation, chapter 14: shortest path algorithms, chapter 15: inner classes and arraylist implementation, chapter 16: stacks, chapter 17: linked lists, chapter 18: trees, chapter 19: search trees, chapter 20: hash tables, chapter 21: heaps, chapter 22: splay trees, chapter 23: pairing heaps, chapter 24: disjoint sets, appendix d: swing.

• Computadoras y Tecnología
• Programación

Disfruta de una entrega rápida y GRATIS, ofertas exclusivas y películas y programas de TV galardonados con Prime Prueba Prime y comienza a ahorrar hoy con entrega rápida y gratis

Amazon Prime incluye:

Las entregas GRATIS y rápidas están disponibles para los miembros Prime. Para unirte, selecciona "Prueba Amazon Prime y comienza a ahorrar hoy mismo con entregas GRATIS y rápidas" debajo del botón Agregar al Carrito.

• Los tarjetahabientes obtienen un 5% de vuelta en Amazon.com con la Tarjeta de Crédito Prime.
• Entrega gratis en dos días ilimitado
• Streaming de películas y programas de televisión con anuncios limitados en Prime Video.
• Un libro Kindle para tomar prestado cada mes - plazos
• Escucha más de 2 millónes de canciones y cientos de listas de reproducción.
• Almacenamiento de fotos sin límite con acceso desde cualquier lugar

Importante:  Tu tarjeta de crédito no será cobrada cuando comiences tu período de prueba gratuito, o si cancelas durante este período. Si estás contento con Amazon Prime, no hagas nada. Al final del período de prueba gratuito, tu membresía se actualizará automáticamente a una membresía mensual.

Nuevo: .savingPriceOverride { color:#CC0C39!important; font-weight: 300!important; } .reinventMobileHeaderPrice { font-weight: 400; } #apex_offerDisplay_mobile_feature_div .reinventPriceSavingsPercentageMargin, #apex_offerDisplay_mobile_feature_div .reinventPricePriceToPayMargin { margin-right: 4px; } -46% US$114.97 US$ 114 . 97 Entrega GRATIS el miércoles, 29 de mayo Enviado por: Amazon Vendido por: HZM Book Team

Devolver gratis este producto.

Las devoluciones gratis están disponibles para la dirección de envío que elegiste. Puedes devolver el producto por cualquier motivo, en estado nuevo y sin usar: no se aplican gastos de envío

• Ve a tus pedidos y empieza el proceso de devolución
• Selecciona el método de devolución

Ahorra con Usado - Muy Bueno .savingPriceOverride { color:#CC0C39!important; font-weight: 300!important; } .reinventMobileHeaderPrice { font-weight: 400; } #apex_offerDisplay_mobile_feature_div .reinventPriceSavingsPercentageMargin, #apex_offerDisplay_mobile_feature_div .reinventPricePriceToPayMargin { margin-right: 4px; } US$40.08 US$ 40 . 08 Entrega GRATIS el martes, 28 de mayo Enviado por: Amazon Vendido por: TEXTBOOKIE

Descarga la app de Kindle gratis y comienza a leer libros Kindle al instante desde tu smartphone, tablet o computadora, sin necesidad de ningún dispositivo Kindle .

Lee al instante desde tu navegador con Kindle para la web.

Usando la cámara de tu celular escanea el siguiente código y descarga la aplicación Kindle.

Seguir al autor

Imagen no disponible

• Para ver la descarga de este video Flash Player
• VISTA EN 360º

Data Structures and Problem Solving Using Java 4th Edición

Opciones de compra y productos add-on.

Data Structures and Problem Solving Using Java takes a practical and unique approach to data structures that separates interface from implementation. It is suitable for the second or third programming course.

This book provides a practical introduction to data structures with an emphasis on abstract thinking and problem solving, as well as the use of Java. It does this through what remains a unique approach that clearly separates each data structure’s interface (how to use a data structure) from its implementation (how to actually program that structure). Parts I (Tour of Java), II (Algorithms and Building Blocks), and III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, while Part IV (Implementations) focuses on implementation of data structures. This forces the reader to think about the functionality of the data structures before the hash table is implemented.

The Fourth Edition features many new updates as well as new exercises.

• ISBN-10 0321541405
• ISBN-13 978-0321541406
• Edición 4th
• Editorial Pearson
• Fecha de publicación 7 Octubre 2009
• Idioma Inglés
• Dimensiones 7.3 x 1.3 x 9.1 pulgadas
• Número de páginas 1032 páginas
• Ver todos los detalles

Comprados juntos habitualmente

Los clientes que compraron este producto también compraron

Opiniones editoriales

Biografía del autor.

Mark Allen Weiss is a Professor in the School of Computing and Information Sciences at Florida International University in Miami Florida. He received his Bachelor's Degree in Electrical Engineering from The Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987, and was promoted to Professor in 1996. His interests include data structures, algorithms, and education, and he is most well-known for his highly-acclaimed Data Structures textbooks, which have been used at hundreds of universities worldwide.

Detalles del producto

• Editorial ‏ : ‎ Pearson; 4th edición (7 Octubre 2009)
• Idioma ‏ : ‎ Inglés
• Tapa blanda ‏ : ‎ 1032 páginas
• ISBN-10 ‏ : ‎ 0321541405
• ISBN-13 ‏ : ‎ 978-0321541406
• Dimensiones ‏ : ‎ 7.3 x 1.3 x 9.1 pulgadas
• nº38 en Estructuras y Algoritmos de Datos
• nº317 en Almacenamiento y Diseño para Bases de Datos
• nº339 en Programación Java (Libros)

Sobre el autor

Mark allen weiss.

Descubre más de los libros del autor, mira autores similares, lee blogs del autor y más

Opiniones de clientes

Las opiniones de clientes, incluidas las valoraciones de productos ayudan a que los clientes conozcan más acerca del producto y decidan si es el producto adecuado para ellos.

Para calcular la valoración global y el desglose porcentual por estrella, no utilizamos un promedio simple. En cambio, nuestro sistema considera cosas como la actualidad de la opinión y si el revisor compró el producto en Amazon. También analiza las opiniones para verificar la confiabilidad.

• Ordenar opiniones por Opiniones principales Más recientes Opiniones principales

Opiniones destacadas de los Estados Unidos

Ha surgido un problema al filtrar las opiniones justo en este momento. vuelva a intentarlo en otro momento..

• Trabaja en Amazon
• Boletín de Amazon
• Acerca de Amazon
• Accesibilidad
• Sostenibilidad
• Notas de Prensa
• Relaciones con los Inversionistas
• Dispositivos Amazon
• Amazon Science
• Vende en Amazon
• Vende tus Apps en Amazon
• Suministrar a Amazon
• Protege y construye tu marca
• Programa de Afiliados
• Únete al Equipo de Transportistas
• Comienza una Empresa Transportista
• Anuncia tus Productos
• Publica tu Libro en Kindle
• Hazte socio de Amazon Hub
• › Ver más Gana Dinero con Nosotros
• Amazon Visa
• Amazon Store Card
• Amazon Secured Card
• Compra con Puntos
• Tarjeta de Crédito
• Recarga tu Saldo
• Tarjetas de Regalo
• Conversor de divisas de Amazon
• Tus Pedidos
• Tarifas de Envío y Políticas
• Amazon Prime
• Devoluciones y Reemplazos
• Administrar Contenido y Dispositivos
• Retiros y alertas de seguridad del producto
• Condiciones de uso
• Aviso de privacidad
• Aviso de Privacidad de Datos de Salud del Consumidor
• Tus opciones de privacidad de los anuncios

Get full access to Object-Oriented Data Structures Using Java, 4th Edition and 60K+ other titles, with a free 10-day trial of O'Reilly.

There are also live events, courses curated by job role, and more.

Object-Oriented Data Structures Using Java, 4th Edition

Read it now on the O’Reilly learning platform with a 10-day free trial.

O’Reilly members get unlimited access to books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Book description

Object-Oriented Data Structures Using Java, Fourth Edition presents traditional data structures and object-oriented topics with an emphasis on problem-solving, theory, and software engineering principles.

Table of contents

• Copyright Page
• The Unified Method
• Applications
• Inheritance
• Handling Exceptional Situations
• Exceptions and Classes: An Example
• Implementation-Dependent Structures
• Implementation-Independent Structures
• What Is a Data Structure?
• Measuring an Algorithm’s Time Efficiency
• Complexity Cases
• Size of Input
• Comparing Algorithms
• Order of Growth
• Selection Sort
• Common Orders of Growth
• Information Hiding
• Data Abstraction
• Data Levels
• Preconditions and Postconditions
• Java Interfaces
• Interface-Based Polymorphism
• Operations on Stacks
• Using Stacks
• Generally Usable Collections
• Exceptional Situations
• The Interface
• Example Use
• The ArrayBoundedStack Class
• Definitions of Stack Operations
• The ArrayListStack Class
• The Balanced Class
• The Application
• The Software Architecture
• Arrays Versus Linked Lists
• The LLNode Class
• Operations on Linked Lists
• The LinkedStack Class
• The push Operation
• The pop Operation
• The Other Stack Operations
• Comparing Stack Implementations
• Evaluating Postfix Expressions
• Postfix Expression Evaluation Algorithm
• Error Processing
• The PostFixEvaluator Class
• The PFixCLI Class
• Revisiting Our Stack ADT
• The Java Stack Class and the Collections Framework
• Recursive Definitions
• Recursive Algorithms
• Recursive Programs
• Iterative Solution for Factorial
• Verifying Recursive Algorithms
• Determining Input Constraints
• Writing Recursive Methods
• Debugging Recursive Methods
• Binary Search
• Recursive Nature of Linked Lists
• Traversing a Linked List
• Transforming a Linked List
• The Algorithm
• The Program
• A T-Square Fractal
• How Recursion Works
• Tail Call Elimination
• Direct Use of a Stack
• Recursion Overhead
• Inefficient Algorithms
• Operations on Queues
• Using Queues
• The ArrayBoundedQueue Class
• The ArrayUnboundedQueue Class
• The General Approach
• A Test Driver for the ArrayBoundedQueue Class
• Using the Test Driver
• The Enqueue Operation
• The Dequeue Operation
• A Circular Linked Queue Design
• Comparing Queue Implementations
• The Palindrome Class
• The Applications
• The GlassQueue
• The Double-Ended Queue
• Doubly Linked Lists
• The Java Library Collection Framework Queue/Deque
• Problem Discussion and Example
• The Customer Class
• The Simulation
• Testing Considerations
• The Counter Class
• Java Threads
• Interference
• Synchronization
• A Synchronized Queue
• Concurrency and the Java Library Collection Classes
• Assumptions for Our Collections
• 5.2 Array-Based Collection Implementation
• 5.3 Application: Vocabulary Density
• The equals Method
• The Comparable Interface
• Comparable Elements
• The Implementation
• Implementing ADTs “by Copy” or “by Reference”
• Sample Application
• The Internal Representation
• The Operations
• Comparing Collection Implementations
• The Java Collections Framework
• The Bag ADT
• The Set ADT
• Assumptions for Our Lists
• Array-Based Implementation
• Link-Based Implementation
• The Card Class
• The CardDeck Class
• Application: Arranging a Card Hand
• Application: Higher or Lower?
• Application: How Rare Is a Pair?
• The Insertion Sort
• Unsupported Operations
• Comparator Interface
• Constructors
• Java Library Lists
• Linked List Variations
• A Linked List as an Array of Nodes
• Large Integers
• The LargeIntList class
• The LargeInt Class
• Addition and Subtraction
• The LargeIntCLI Program
• Tree Traversals
• Binary Trees
• Binary Search Trees
• Binary Tree Traversals
• 7.4 The Implementation Level: Basics
• Recursive Approach to the size Method
• Iterative Approach to the size Method
• Recursion or Iteration?
• The contains and get Operations
• The Traversals
• The add Operation
• The remove Operation
• Text Analysis Experiment Revisited
• Insertion Order and Tree Shape
• Balancing a Binary Search Tree
• The WordFreq Class
• Application-Specific Variations
• Balanced Search Trees
• 8.1 The Map Interface
• Unsorted Array
• Sorted Array
• Unsorted Linked List
• Sorted Linked List
• Binary Search Tree
• An ArrayList-Based Implementation
• 8.3 Application: String-to-String Map
• The Hash Function
• Java’s Support for Hashing
• Using the HMap class
• A Hybrid Structure
• Java Support for Maps
• Using Priority Queues
• 9.3 The Heap
• A Nonlinked Representation of Binary Trees
• Implementing a Heap
• The enqueue Method
• The dequeue Method
• A Sample Use
• Heaps Versus Other Representations of Priority Queues
• 10.1 Introduction to Graphs
• 10.2 The Graph Interface
• Linked Implementation
• Depth-First Searching
• Breadth-First Searching
• 10.5 Application: The Single-Source Shortest-Paths Problem
• A Test Harness
• Bubble Sort
• Insertion Sort
• Objects and References
• Comparing Objects
• Sequential Searching
• High-Probability Ordering
• Sorted Collections
• Appendix A: Java Reserved Words
• Appendix B: Operator Precedence
• Appendix C: Primitive Data Types
• Appendix D: ASCII Subset of Unicode

Product information

• Title: Object-Oriented Data Structures Using Java, 4th Edition
• Author(s): Dale
• Release date: September 2016
• Publisher(s): Jones & Bartlett Learning
• ISBN: 9781284089103

You might also like

Introducing data structures with java.

by David Cousins

Introducing Data Structures with Java sets out to provide a firm understanding of dealing with arrays, …

Object-Oriented Programming with Java

by Caleb Curry

5+ Hours of Video Instruction Java was introduced to the open-source community more than 20 years …

Beginning Java Data Structures and Algorithms

by James Cutajar

Though your application serves its purpose, it might not be a high performer. Learn techniques to …

Data Structures and Algorithms in Java, 2nd Edition

by Robert Lafore

Data Structures and Algorithms in Java, Second Edition is designed to be easy to read and …

Don’t leave empty-handed

Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.

It’s yours, free.

Check it out now on O’Reilly

Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.