Data Structures and Algorithms in C++
Adam Drozdek
Building
on widespread use of the C++ programming language in industry and
education, this book provides a broad-based and case-driven study of
data structures -- and the algorithms associated with them -- using C++
as the language of implementation.
Year:
2000
Edition:
2
Language:
English
Pages:
665
Handbook of algorithms and data structures
Gaston H. Gonnet, Gaston Gonnet, Ricardo Baeza-Yates, R. Baeza-Yates
Both
this book and the preceding (smaller) edition have earned their place
on my reference shelf. More up to date than Knuth's 2nd edition and
covering much broader territory than (for example) Samet's D&A of
Spatial Data Structures, I've found a number of algorithms and data
structures in this text that have been directly applicable to my work as
a systems programmer.One of the major features of this book is, where
possible, the consistent presentation and comparison of expected running
times under a variety of input data conditions, with both theoretical
and empirical results.A very browseable handbook. Not one of the
hundreds of 1st year textbooks. It's a shame that it's out of print.
Year:
1991
Edition:
2nd
Language:
English
Pages:
433
Efficient data structures and algorithms, three volumes
Mehlhorn K.
This
book is a concise introduction addressed to students and professionals
familiar with programming and basic mathematical language. Individual
chapters cover arrays and linked lists, hash tables and associative
arrays, sorting and selection, priority queues, sorted sequences, graph
representation, graph traversal, shortest paths, minimum spanning trees,
and optimization. The algorithms are presented in a modern way, with
explicitly formulated invariants, and comment on recent trends such as
algorithm engineering, memory hierarchies, algorithm libraries and
certifying algorithms. The authors use pictures, words and high-level
pseudocode to explain the algorithms, and then they present more detail
on efficient implementations using real programming.
Year:
1984
Language:
English
Pages:
674
Handbook of data structures and applications
Dinesh P. Mehta
Reflecting
progress in the field in the decades since Donald Knuth's work in the
late 1960s defined data structures and Niklaus Wirth stated that
"Algorithms + Data Structures = Programs," this handbook presents a
comprehensive survey. Mehta (Colorado School of Mines) and Sahni (U. of
Florida) present introductory material, which is followed by discussion
of priority queues, dictionary structures, and multidimensional
structures-all well known-and a section addressing less-easily
classified data structures. These theoretical chapters lead to a more
practical discussion of mechanisms and tools for using the structures,
and a final section on applications"
Year:
2004
Edition:
1
Language:
English
Pages:
1321
Data structures and network algorithms
Robert Endre Tarjan
The
first half of the book covers the data structures used in solving the
network problems that are presented in the second half. These data
structures including disjoint sets, heaps, and search trees. Highlights
of this half of the book are Tarjan's proof of the amoritized cost of
union find, and explaination of self-adjusting binary trees.The second
half of the book covers four classical network problems: minimum
spanning tree, shortest paths, network flows (e.g. min-cut), and
matchings.
Year:
1987
Language:
English
Pages:
131
Genetic Algorithms + Data Structures = Evolution Programs
Zbigniew Michalewicz
Zbigniew
Michalewicz's Genetic Algorithms + Data Structures = Evolution Programs
has three sections. The first section is a straightforward introduction
to genetic algorithms. In the second section, Michalewicz describes how
to apply genetic algorithms to numerical optimization. Michalewicz, who
is a pioneer in this field, discusses the rationale for using genetic
algorithms for numerical optimization and describes several experiments
that show how this new type of genetic algorithm performs. The author
devotes the third section of the book to evolution programs.
Year:
1998
Edition:
3
Language:
English
Pages:
388
A laboratory course in C++ data structures
James Roberge
A
Laboratory Course in C++ Data Structures, Second Edition exemplifies
the active learning experience. With a dynamic learn-by-doing focus,
this laboratory manual encourages students to explore data structures by
implementing them, a process through which students discover how data
structures work and how they can be applied. Providing a framework that
offers feedback and support, this text challenges students to exercise
their creativity in both programming and analysis. Each laboratory unit
consists of four parts: the Prelab, the Bridge, the In-lab, and the
Postlab, which create an excellent hands-on learning opportunity for
students in supervised labs and students engaged in independent study.
Year:
2003
Edition:
2 Sub
Language:
English
Pages:
381
No comments:
Post a Comment