| Algorithm and Data Structures | |
| Authors: M. M. Raghuwanshi | ISBN:
978-81-8487-425-9 |
About the book ALGORITHMS AND DATA STRUCTURES is primarily designed for use in a first undergraduate course on algorithms, but it can also be used as the basis for an introductory graduate course, for researchers, or computer professionals who want to get and sense for how they might be able to use particular data structure and algorithm design techniques in the context of their own work. The goal of this book is to convey this approach to algorithms, as a design process that begins with problems arising across the full range of computing applications, builds on an understanding of algorithm design techniques, and results in the development of efficient solutions to these problems. It seek to explore the role of algorithmic ideas in computer science generally, and relate these ideas to the range of precisely formulated problems for which we can design and analyze algorithm. | |
Key Features |
|
Table of content Preface / Acknowledgement / INTRODUCTION: Overview / Algorithms / Study of Algorithms / Asymptotic Notations / Recursive and Iterative Algorithms / Types and Data Types / Abstract Data Types / ARRAYS: Representation of Array in Memory / Linear List / Stack / Queue / Multiple Stacks and Queues / LINKED LISTS: Ordered List / Linked Representation / Linked Lists / Circular Singly Linked List / Linked Stack / Linked Queue / Multiple Stacks and Queues / Representation of Polynomial using singly Linked List / Doubly Linked List / Generalized List / TREES: Definition and Terminology / Binary Tree / Binary Tree Representations / Binary Tree Traversals / Creation of Binary Tree from Different Traversals / Expression Trees / Threaded Binary Trees / Extended Binary Tree / Binary Search Tree (BST) / Balanced Binary Search Trees / m-way Search Trees / GRAPHS: Definition and Terminology / Graph Representation / Graph Traversals / Connected Component / Spanning Tree / SORTING AND SEARCHING: Introduction / Methods to Realize Fundamental or Basic Sorting Mechanism / Selection Sort / Bubble Sort / Insertion Sort / Merge Sort / Quick Sort / Search Algorithms / HASH TABLE: Introduction / Chained Hash Table / Open-Addressed Hash Table / Open-Addressed Hash Table / Hash Functions / AMORTIZED ANALYSIS: Introduction / Simple Examples / The Basics / The Aggregate (Summation) Method / The Accounting Method / The Potential Method / Index. Audience Undergraduate and Postgraduate Students, Professionals and Researchers | |
 | |