This accessible and engaging textbook/guide provides a concise introduction to data structures and associated algorithms. Emphasis is placed on the fundamentals of data structures, enabling the reader to quickly learn the key concepts, and providing a strong foundation for later studies of more complex topics. The coverage includes discussions on stacks, queues, lists, (using both arrays and links), sorting, and elementary binary trees, heaps, and hashing. This content is also a natural continuation from the material provided in the separate Springer title Guide to Java by the same authors.Topics and features: reviews the preliminary concepts, and introduces stacks and queues using arrays, along with a discussion of array-based lists; examines linked lists, the implementation of stacks and queues using references, binary trees, a range of varied sorting techniques, heaps, and hashing; presents both primitive and generic data types in each chapter, and makes use of contour diagrams to illustrate object-oriented concepts; includes chapter summaries, and asks the reader questions to help them interact with the material; contains numerous examples and illustrations, and one or more complete program in every chapter; provides exercises at the end of each chapter, as well as solutions to selected exercises, and a glossary of important terms.
This clearly-written work is an ideal classroom text for a second semester course in programming using the Java programming language, in preparation for a subsequent advanced course in data structures and algorithms. The book is also eminently suitable as a self-study guide in either academe or industry.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Dr. James T. Streib is a Professor of Computer Science at Illinois College, Jacksonville, IL, USA. Dr. Takako Soma is an Associate Professor of Computer Science at the same institution.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
paperback. Etat : Very Good. Cover and edges may have some wear. N° de réf. du vendeur mon0003654851
Quantité disponible : 3 disponible(s)
Vendeur : eCampus, Lexington, KY, Etats-Unis
Etat : Very Good. N° de réf. du vendeur U:9783319700830:ONHAND
Quantité disponible : 3 disponible(s)
Vendeur : PsychoBabel & Skoob Books, Didcot, Royaume-Uni
Paperback. Etat : Very Good. Paperback in very good condition. Cover edges are slightly bumped and rubbed. Covers are clean, binding is sound and content is as unread. LW. N° de réf. du vendeur 611068
Quantité disponible : 1 disponible(s)
Vendeur : GoldBooks, Denver, CO, Etats-Unis
Etat : new. N° de réf. du vendeur 89H36_32_3319700839
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore, Milano, MI, Italie
Etat : new. N° de réf. du vendeur fd07ad5fab39aa4ac90709584d8257e8
Quantité disponible : 20 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 30245909-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEOCT25-15898
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. N° de réf. du vendeur fd07ad5fab39aa4ac90709584d8257e8
Quantité disponible : 20 disponible(s)
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEOCT25-275929
Quantité disponible : 5 disponible(s)
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-29283
Quantité disponible : 2 disponible(s)