Open Data Structures

Open Data Structures
Author: Pat Morin
Publisher: Athabasca University Press
Total Pages: 336
Release: 2013
Genre: Computers
ISBN: 1927356385

Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.

CLASSIC DATA STRUCTURES, 2nd ed.

CLASSIC DATA STRUCTURES, 2nd ed.
Author: Samanta Debasis
Publisher: PHI Learning Pvt. Ltd.
Total Pages: 942
Release: 2008-12-01
Genre: Computers
ISBN: 812033731X

This book is the second edition of a text designed for undergraduate engineering courses in Data Structures. The treatment of the subject matter in this second edition maintains the same general philosophy as in the first edition but with significant additions. These changes are designed to improve the readability and understandability of all algorithms so that the students acquire a firm grasp of the key concepts. This book is recommended in Assam Engineering College, Assam, Girijananda Chowdhury Institute of Management and Technology, Assam, Supreme Knowledge Foundation Group, West Bengal, West Bengal University of Technology (WBUT) for B.Tech. The book provides a complete picture of all important data structures used in modern programming practice. It shows :  various ways of representing a data structure  different operations to manage a data structure  several applications of a data structure The algorithms are presented in English-like constructs for ease of comprehension by students, though all of them have been implemented separately in C language to test their correctness. Key Features :  Red-black tree and spray tree are discussed in detail  Includes a new chapter on Sorting  Includes a new chapter on Searching  Includes a new appendix on Analysis of Algorithms for those who may be unfamiliar with the concepts of algorithms  Provides numerous section-wise assignments in each chapter  Also included are exercises—Problems to Ponder—in each chapter to enhance learning The book is suitable for students of : (i) computer science (ii) computer applications (iii) information and communication technology (ICT) (iv) computer science and engineering.

C# Data Structures and Algorithms

C# Data Structures and Algorithms
Author: Marcin Jamro
Publisher: Packt Publishing Ltd
Total Pages: 287
Release: 2018-04-19
Genre: Computers
ISBN: 1788834682

A complete guide on using data structures and algorithms to write sophisticated C# code Key Features Master array, set and map with trees and graphs, among other fundamental data structures Delve into effective design and implementation techniques to meet your software requirements Explore illustrations to present data structures and algorithms, as well as their analysis in a clear, visual manner. Book Description Data structures allow organizing data efficiently. They are critical to various problems and their suitable implementation can provide a complete solution that acts like reusable code. In this book, you will learn how to use various data structures while developing in the C# language as well as how to implement some of the most common algorithms used with such data structures. At the beginning, you will get to know arrays, lists, dictionaries, and sets together with real-world examples of your application. Then, you will learn how to create and use stacks and queues. In the following part of the book, the more complex data structures will be introduced, namely trees and graphs, together with some algorithms for searching the shortest path in a graph. We will also discuss how to organize the code in a manageable, consistent, and extendable way. By the end of the book,you will learn how to build components that are easy to understand, debug, and use in different applications. What you will learn How to use arrays and lists to get better results in complex scenarios Implement algorithms like the Tower of Hanoi on stacks of C# objects Build enhanced applications by using hashtables, dictionaries and sets Make a positive impact on efficiency of applications with tree traversal Effectively find the shortest path in the graph Who this book is for This book is for developers who would like to learn the Data Structures and Algorithms in C#. Basic C# programming knowledge would be an added advantage.

Data Structures and Algorithms Using C#

Data Structures and Algorithms Using C#
Author: Michael McMillan
Publisher: Cambridge University Press
Total Pages: 338
Release: 2007-03-26
Genre: Computers
ISBN: 0521670152

Michael McMillan discusses the implementation of data structures and algorithms from the .NET framework. The comprehensive text includes basic data structures and algorithms plus advanced algorithms such as probabilistic algorithms and dynamics programming.

Data Structures Using C++

Data Structures Using C++
Author: D. S. Malik
Publisher: South Western Educational Publishing
Total Pages: 912
Release: 2010
Genre: C++ (Computer program language)
ISBN: 9781439040232

The latest book from Cengage Learning on Data Structures Using C++, International Edition

Data Structures using C++

Data Structures using C++
Author: Varsha H. Patil
Publisher: OUP India
Total Pages: 0
Release: 2012-04-05
Genre: Computers
ISBN: 9780198066231

Data Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of Computer Science and Information Technology as well as postgraduate students of Computer Applications. The book aims to provide a comprehensive coverage of the concepts of Data Structures using C++.

Think Data Structures

Think Data Structures
Author: Allen B. Downey
Publisher: "O'Reilly Media, Inc."
Total Pages: 149
Release: 2017-07-07
Genre: Computers
ISBN: 1491972319

If you’re a student studying computer science or a software developer preparing for technical interviews, 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. By emphasizing practical knowledge and skills over theory, author Allen Downey shows you how to use data structures to implement efficient algorithms, and then analyze and measure their performance. You’ll explore the important classes in the Java collections framework (JCF), how they’re implemented, and how they’re expected to perform. Each chapter presents hands-on exercises supported by test code online. Use data structures such as lists and maps, and understand how they work Build an application that reads Wikipedia pages, parses the contents, and navigates the resulting data tree Analyze code to predict how fast it will run and how much memory it will require Write classes that implement the Map interface, using a hash table and binary search tree Build a simple web search engine with a crawler, an indexer that stores web page contents, and a retriever that returns user query results Other books by Allen Downey include Think Java, Think Python, Think Stats, and Think Bayes.