Sahni's "Data Structures, Algorithms, and Applications in Java" is designed to be used in a second course in computer science (CS2). Using Java, this... book provides comprehensive coverage of the fundamental data structures, making it an excellent choice for a CS2 course. The author has made this book student-friendly through intuitive discussion, real-world, applications and a gentle introduction. Sahni is unique in providing several real-world applications for each data structure presented in the book. These applications come from such areas as sorting, compression and coding, and image processing. These applications give students a flavor for the sorts of things they will be able to do with the data structures that they are learning. Almost 1,000 exercises in this text serve to reinforce concepts and get students applying what they are learning. Sahni's text is also accompanied by a web site containing all the programs in the book, as well as sample data, generated output, solutions to selected exercises, and enhanced discussion of selected material in the text.

Using C, this book develops the concepts and theory of data structures and algorithm analysis in a gradual, step-by-step manner, proceeding from... concrete examples to abstract principles. Standish covers a wide range of both traditional and contemporary software engineering topics. The text also includes an introduction to object-oriented programming using C++. By introducing recurring themes such as levels of abstraction, recursion, efficiency, representation and trade-offs, the author unifies the material throughout. Mathematical foundations can be incorporated at a variety of depths, allowing the appropriate amount of math for each user.

Data Structures and Algorithm Analysis in C++ is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis... courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language. This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm.

This revised Norton Critical Edition of one of the series' most widely read texts is based on the second quarto (1604-05). Where necessary, the editor... has also drawn from the folio text, recording all departures from the quarto in the Textual Notes. Punctuation and stage directions for the play have been refined, and textual annotations have been revised and expanded.The "Intellectual Backgrounds" and "Extracts from the Sources" sections, both highly praised, remain as germane as ever. Intellectual Backgrounds includes important readings on melancholy, demonology, the nature of man, and death, including works by Peter de la Primaudaye, Timothy Bright, Lewes Lavater, G. Gifford, Michel de Montaigne, and Heironymous Cardanus. Extracts from the Sources provides pre-Shakespearean accounts of the story of Hamlet, reprinting substantial excerpts from Saxo Grammaticus's Historia Danica and Belleforest's Histoires Tragiques. "Criticism" has been revised to accommodate the most significant recent interpretations of Hamlet while retaining the seminal essays of the First Edition. Twenty-three critical analyses are featured, including those by Samuel Johnson, Johann Wolfgang von Goethe, Samuel Taylor Coleridge, William Hazlitt, A. C. Bradley, D. H. Lawrence, T. S. Eliot, G. Wilson Knight, C. S. Lewis, Harry Levin, Peter J. Seng, Rebecca West, Arnold Kettle, Margaret W. Ferguson, Jacqueline Rose, and William Empson. An updated Selected Bibliography is also included.

A modern treatment of data structures using the C programming language. Emphasizes such programming practices as dynamic memory allocation, recursion,... data abstraction, and "generic" data structures. Appropriate for sophomore level data structures courses that use C, taking advantage of the flexibility that C provides. (vs. VanWyck, Korsh/Garrett)

Using the latest features of Java 5, this unique object-oriented presentation introduces readers to data structures via thirty, manageable chapters. ...   KEY FeaturesTOPICS: Introduces each ADT in its own chapter, including examples or applications. Provides   aA variety of exercises and projects, plus additional self-assessment questions throughout. the text   Includes generic data types as well as enumerations, for-each loops, the interface Iterable, the class Scanner, assert statements, and autoboxing and unboxing. Identifies important Java code as a Listing. Provides NNotes and Pprogramming Ttips in each chapter. For programmers and software engineers interested in learning more about data structures and abstractions.

Data Structures and Abstractions with Java, 3e, is ideal for one- or two-semester courses in data structures (CS-2) in the departments of Computer... Science, Computer Engineering, Business, and Management Information Systems. This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters — each with pedagogical tools to help students master each concept.¿Using the latest features of Java, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility. Author Frank Carrano's Making it Real blog http://frank-m-carrano.com/blog/ extends his textbooks and lectures to a lively discussion with instructors and students about teaching and learning computer science. Follow Frank on Twitter: http://twitter.com/Frank_M_Carrano Find him on Facebook: https://www.facebook.com/makingitreal

In this revision of a leading text, Mark Allen Weiss provides a concise, complete, and dynamic picture of many important data structures used in modern... programming practice, with a focus on issues of performance and efficiency. 080539057XB04062001

In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of... data from several years to less than a second. Class templates are used to describe generic data structures and first-class versions of vector and string classes are used. Included is an appendix on a Standard Template Library (STL). This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.

Mark Allen Weiss' innovative approach to algorithms and data structures teaches the simultaneous development of sound analytical and programming skills... for the advanced data structures course. Readers learn how to reduce time constraints and develop programs efficiently by analyzing the feasibility of an algorithm before it is coded. The C++ language is brought up-to-date and simplified, and the Standard Template Library is now fully incorporated throughout the text. This Third Edition also features significantly revised coverage of lists, stacks, queues, and trees and an entire chapter dedicated to amortized analysis and advanced data structures such as the Fibonacci heap. Known for its clear and friendly writing style, Data Structures and Algorithm Analysis in C++ is logically organized to cover advanced data structures topics from binary heaps to sorting to NP-completeness. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm.

A comprehensive treatment focusing on the creation of efficient data structures and algorithms, this text explains how to select or design the data... structure best suited to specific problems. It uses C++ as the programming language and is suitable for second-year data structure courses and computer science courses in algorithmic analysis.

In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of... data from several years to less than a second. This new edition contains all the enhancements of the new Java 5.0 code including detailed examples and an implementation of a large subset of the Java 5.0 Collections API. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.

Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses.... In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.   As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.   Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.  

The authors' treatment of data structures in Data Structures and Algorithms is unified by an informal notion of "abstract data types," allowing readers... to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal.