• Title Data Structures: Fundamental Tools
• Author(s) Wikibooks Contributors
• Publisher: Wikibooks; eBook (Creative Commons Licensed)
• License(s): Creative Commons License (CC)
• Paperback N/A
• eBook HTML and PDF (161 pages)
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book Description

A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.

This book covers most of commonly used data structures in computer science: abstract data types; Sequences; Dictionaries; Sets; Priority queues; Successors and neighbors; Integer and string searching, etc.

It describes data structures from the point of view of computer programming, with examples, and presents design techniques that allow programmers to develop their own data structures. The authors include both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for programming languages.

It also offers solutions to complex data structures and algorithms. There are multiple solutions for each problem. It comes handy as an interview and exam guide for computer scientists.

• N/A

• Amazon

• Data Structures and Algorithms
• Computational Complexity
• Operations Research (OR), Linear Programming, Optimization, and Approximation

• Data Structures: Fundamental Toolss (Wikibooks)
• Fundamentals of Data Structures (Ellis Horowitz, et al.)

• An Open Guide to Data Structures and Algorithms (Paul Bible, et al)

  This textbook serves as a gentle introduction for undergraduates to theoretical concepts in data structures and algorithms in computer science while providing coverage of practical implementation (coding) issues.

• Algorithm Design and Analysis (Godfrey Justo)

  This book is designed to provide you with a solid foundation in algorithmic thinking and equip you with the essential tools and techniques necessary to design and analyze efficient algorithms.

• Algorithmic Puzzles (Anany Levitin, et al.)

  While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles.

• Lecture Notes for the Algorithms (Jeff Erickson)

  This lecture notes uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.

• The Little Book of Algorithms (William Lau)

  This workbook is designed to help those learning and teaching Computer Science at secondary school level. The aim of the book is to help students build fluency in their Python programming.

• Algorithms: Fundamental Techniques (Macneil Shonle, et al)

  The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth.

• Think Data Structures: Algorithms and Information Retrieval

  This practical book will help you learn and review some of the most important ideas in software engineering - data structures and algorithms - in a way that's clearer, more concise, and more engaging than other materials. Useful in technical interviews too.

• Elementary Algorithms (Xinyu Liu)

  This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures. It teaches you how to think like a programmer - find the practical efficiency algorithms to solve your problems.

• Algorithm Design (Jon Kleinberg, et al)

  This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

• Problems on Algorithms, 2nd Edition (Ian Parberry)

  This book provides an extensive and varied collection of useful, practical problems on the design, analysis, and verification of algorithms. By the end of this book, you will have mastered widely applicable algorithms as well as how and when to use them.