Data Structures and Algorithm Analysis in C++

Data Structures and Algorithm Analysis in C

Mark A. Weiss

0 /

0

0 comments

How much do you like this book?

What’s the quality of the file?
Download the book for quality assessment

What’s the quality of the downloaded files?

Features

This text is designed to teach students good programming and algorithm analysis skills simultaneously so that they can develop intricate programs with the maximum amount of efficiency.

By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible and see how careful implementations can reduce the time constraint for large amounts of data. No algorithm or data structure is presented without an explanation of its running time.

This book is suitable for either an advanced data structures (CS7) course or a first-year graduate course in algorithm analysis. As introductory sequences expand from two to three courses, this book is ideal at the end of the third course, bridging the way to the Algorithms course.

Discussion of algorithm and design techniques covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking.

Covers topics and data structures such as Fibonacci heaps, skew heaps, binomial queue, skip lists and splay trees.

A full chapter on amortized analysis examines the advanced data structures presented earlier in the book.

Chapter on advanced data structures and their implementation covers red black trees, top down splay trees, k-d trees, pairing heaps, and more.

End-of-chapter exercises, ranked by difficulty, reinforce the material from the chapter while providing readers an opportunity to put those concepts into practice.

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. click to read more

Year:
2014

Edition:
4th

Publisher:
Pearson

Language:
english

Pages:
654

ISBN 10:
013284737X

ISBN 13:
9780132847377

File:
PDF, 4.21 MB