Data Structures Using C & C++

Open Data Structures
by Pat Morin

Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code.


Data Structures Using C++
by D. S. Malik

Now in its second edition, D.S. Malik brings his proven approach to C++ programming to the CS2 course. Clearly written with the student in mind, this text focuses on Data Structures and includes advanced topics in C++ such as Linked Lists and the Standard Template Library (STL). The text features abundant visual diagrams, examples, and extended Programming Examples, all of which serve to illuminate difficult concepts. Complete programming code and clear display of syntax, explanation, and example are used throughout the text, and each chapter concludes with a robust exercise set.
Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.

Data Structures Using C
by Samir Kumar Bandyopadhyay

Data Structures Using C brings together a first course on data structures and the complete programming techniques, enabling students and professionals implement abstract structures and structure their ideas to suit different needs. This book elaborates the standard data structures using C as the basic programming tool. It is designed for a one semester course on Data Structures.

Think Data Structures
by Allen Downey

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.


Algorithms and Data Structures – Applications to Graphics and Geometry
by Textbook Equity

This is a college-level introductory textbook of algorithms and data structures with application to graphics and geometry. This textbook, released under a Creative Commons Share Alike (CC BY SA) license, is presented in its original format with the academic content unchanged. It was authored by Jurg Nievergelt (ETH Zurich) and Klaus Hinrichs (Institut fur Informatik) and provided by the University of Georgia’s Global Textbook Project. Textbookequity.org/algorithms-and-data-structures/ Photo Credit: Renato Keshet (GFDL) commons.wikimedia.org Contents Part I: Programming environments for motion, graphics, and geometry Part II: Programming concepts: beyond notation Part IV: Complexity of problems and algorithms Part V: Data structures Textbook Equity Edition http: //textbookequity.org/algorithms-and-data-structures

Advanced Data Structures
by A.A.Puntambekar

Different strategies for problem solving, Need for OOP, Overview of OOP principles-encapsulation, Inheritance, Polymorphism. C++ class overview-class definition, Objects, Class members, Access control, Class scope, Constructors and destructors, Inline functions, Static class members, This pointer, Friend functions, Dynamic memory allocation and deallocation (new and delete).Polymorphism and InheritanceFunction overloading, Operator overloading, Generic programming function and class templates, Inheritance basics, Base and derived classes, Different types of inheritance, Base class access control, Virtual base class, Function overriding, Run time polymorphism using virtual functions, Abstract classes.Streams, Libraries and error handling-stream classes hierarchy, Console I/O, Formatted I/O, File streams and string streams, Exception handling mechanism, Standard template library.Algorithms, Performance analysis-time complexity and space complexity, Review of basic data structures,The list ADT, Stack ADT, Implementation using template class in C++, Queue ADT, Implementation using template class, Priority queues-definition, ADT, Heaps, Definition, Insertion and deletion, Application-heap sort, Disjoint sets-disjoint set ADT, Disjoint set operations, Union and find algorithms.Skip lists and hashingDictionaries, Linear list representation, Skip list representation, Operations-insertion, Deletion and searching, Hash table representation, Hash functions, Collision resolution- separate chaining, Open addressing-linear probing, Quadratic probing, Double hashing, Rehashing, Extendible hashing, Comparison of hashing and skip lists.Search trees (Part I)Binary search trees, definition, ADT, Implementation, Operations searching, Insertion and deletion, Balanced search trees-AVL trees, Definition, Height of an AVL tree, Representation, operations-insertion, Deletion and searching.Search trees (Part II)Red-black trees representation, Insertion, Deletion, Searching splay trees introduction, The splay operation, B-Trees, B-Tree of order m, Height of a B-Tree, Insertion deletion and searching.Pattern matching and triesPattern matching algorithms-Brute force, The Boyer-Moore algorithm, The Knuth-Morris-Pratt algorithm, Standard tries, Compressed tries, Suffix trees, Search engines-inverted files.


About apujb86