Data Structures

✍ Scribed by E. Balagurusamy

Publisher: McGraw-Hill Education
Year: 2019
Tongue: English
Leaves: 264
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Title
Contents
Unit-1 Linear Data Structures – List
1 Introduction To Algorithm And Data Structures
2 Arrays
3 Linked Lists
Unit-2 Linear Data Structures- Stacks, Queues
4 Stacks
5 Queues
Unit-3 Non Linear Data Structures-Trees
6 Trees
Unit-4 Non Linear Data Structures-Graphs
7 Graphs
Unit-5 Searching, Sorting And Hashing Techniques
8 Sorting And Searching

📜 SIMILAR VOLUMES

Data Structures

📁 Data Structures

✍ N.K. Tiwari, Jitendra Agrawal, Shishir K. Shandilya 📂 Library 📅 2016 🏛 I K International Publishing House 🌐 English

Data structure is a way of organizing data in a computer memory so that it can be used efficiently. Data structures can implement one or more particular abstract data types (ADT), which are the means of specifying the nature of operations and their complexity. This book focuses on the design and

Data Structures.

📁 Data Structures.

✍ Koffman, Elliot B.; Wolfgang, Paul A. T. 📂 Library 📅 2015 🏛 Wiley 🌐 English

Data Structures

📁 Data Structures

✍ Lipschutz, Seymour 📂 Library 📅 2014 🏛 McGraw Hill Education 🌐 English

Data Structures

📁 Data Structures

✍ Evangel P. Quiwa 📂 Library 📅 2007 🏛 Electronics Hobbyists Publishing House 🌐 English

C & Data Structures

📁 C & Data Structures

✍ P S Deshpande, O G Kakde 📂 Library 📅 2004 🏛 Charles River Media 🌐 English

Avoid this book like the plague. The authors did a decent job in presenting the ideas and concepts, BUT here's why I do not recommend this book: - Too Many Errors in the source code. I spent more time debugging the code than actually trying to learn about Data Structures in C. - Poorly Edited. It

Data Structures Demystified

📁 Data Structures Demystified

✍ James Edward Keogh, Ken Davidson 📂 Library 📅 2004 🏛 McGraw-Hill/Osborne 🌐 English

Whether you are an entry-level or seasoned designer or programmer, learn all about data structures in this easy-to-understand, self-teaching guide that can be directly applied to any programming language. From memory and addresses to hashtables, authors Keogh and Davidson, provide clear explanations