Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Algorithm and Data Structures - M.M. Raghuwanshi

Algorithm and Data Structures

Buch | Hardcover
384 Seiten
2016
Alpha Science International Ltd (Verlag)
978-1-84265-946-5 (ISBN)
CHF 107,90 inkl. MwSt
  • Versand in 10-20 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
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.

INTRODUCTION: Introduction / Algorithm / Analysis of Algorithm / Asymptotic Notations / Types and Data Types / Abstract Data Types / ARRAYS: Representation of Array in Memory / Linear List / Stack / Queue / Multiple Stacks and Queues / LINKED LIST: Introduction / Singly Linked List / Circular Singly Linked List / Linded Stack / linked Queue / Polynomial Representation using Linked List / Doubly Linked List / Generalized List / TREES: Basic Terminology / Binary Tree / Binary Tree Representation / Binary Tree Traversals / Treaded Binary Tree / Binary Search Tree / Other Tree Structures / GRAPHS: Terminology and Representation / Traversal / Connected Components and Spanning Tree / Shortest Path / SYMBOL TABLES: Static Tree Tables / Dynamic Tree Tables / Hash Tables / SORTING TECHNIQUES: Searching / Bubble Sort / Selection Sort / Insertion Sort / Shell Sort / Radix Sort / Quick Sort / Merge Sort / Heap Sort / Bucket Sort / External Sorting / AMORTIZED ANALYSIS: Introduction / Sample Examples / The Basics / The Aggregate Methods / The Accounting Method / The Potential Method.

Erscheint lt. Verlag 30.6.2016
Verlagsort Oxford
Sprache englisch
Themenwelt Informatik Theorie / Studium Algorithmen
ISBN-10 1-84265-946-4 / 1842659464
ISBN-13 978-1-84265-946-5 / 9781842659465
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15