Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
39,40 €*
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
Kategorien:
Beschreibung
"Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.
Topics Covered:Introduction
Recursion and Backtracking
Linked Lists
Stacks
Queues
Trees
Priority Queue and Heaps
Disjoint Sets ADT
Graph Algorithms
Sorting
Searching
Selection Algorithms [Medians]
Symbol Tables
Hashing
String Algorithms
Algorithms Design Techniques
Greedy Algorithms
Divide and Conquer Algorithms
Dynamic Programming
Complexity Classes
Miscellaneous Concepts
Topics Covered:Introduction
Recursion and Backtracking
Linked Lists
Stacks
Queues
Trees
Priority Queue and Heaps
Disjoint Sets ADT
Graph Algorithms
Sorting
Searching
Selection Algorithms [Medians]
Symbol Tables
Hashing
String Algorithms
Algorithms Design Techniques
Greedy Algorithms
Divide and Conquer Algorithms
Dynamic Programming
Complexity Classes
Miscellaneous Concepts
"Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.
Topics Covered:Introduction
Recursion and Backtracking
Linked Lists
Stacks
Queues
Trees
Priority Queue and Heaps
Disjoint Sets ADT
Graph Algorithms
Sorting
Searching
Selection Algorithms [Medians]
Symbol Tables
Hashing
String Algorithms
Algorithms Design Techniques
Greedy Algorithms
Divide and Conquer Algorithms
Dynamic Programming
Complexity Classes
Miscellaneous Concepts
Topics Covered:Introduction
Recursion and Backtracking
Linked Lists
Stacks
Queues
Trees
Priority Queue and Heaps
Disjoint Sets ADT
Graph Algorithms
Sorting
Searching
Selection Algorithms [Medians]
Symbol Tables
Hashing
String Algorithms
Algorithms Design Techniques
Greedy Algorithms
Divide and Conquer Algorithms
Dynamic Programming
Complexity Classes
Miscellaneous Concepts
Details
| Erscheinungsjahr: | 2023 |
|---|---|
| Fachbereich: | Programmiersprachen |
| Genre: | Importe, Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| ISBN-13: | 9788193245286 |
| ISBN-10: | 8193245288 |
| Sprache: | Englisch |
| Ausstattung / Beilage: | Paperback |
| Einband: | Kartoniert / Broschiert |
| Autor: | Karumanchi, Narasimha |
| Hersteller: | CareerMonk Publications |
| Verantwortliche Person für die EU: | Books on Demand GmbH, In de Tarpen 42, D-22848 Norderstedt, info@bod.de |
| Maße: | 280 x 216 x 26 mm |
| Von/Mit: | Narasimha Karumanchi |
| Erscheinungsdatum: | 21.07.2023 |
| Gewicht: | 1,172 kg |
Details
| Erscheinungsjahr: | 2023 |
|---|---|
| Fachbereich: | Programmiersprachen |
| Genre: | Importe, Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| ISBN-13: | 9788193245286 |
| ISBN-10: | 8193245288 |
| Sprache: | Englisch |
| Ausstattung / Beilage: | Paperback |
| Einband: | Kartoniert / Broschiert |
| Autor: | Karumanchi, Narasimha |
| Hersteller: | CareerMonk Publications |
| Verantwortliche Person für die EU: | Books on Demand GmbH, In de Tarpen 42, D-22848 Norderstedt, info@bod.de |
| Maße: | 280 x 216 x 26 mm |
| Von/Mit: | Narasimha Karumanchi |
| Erscheinungsdatum: | 21.07.2023 |
| Gewicht: | 1,172 kg |
Sicherheitshinweis
Ähnliche Produkte
Buch
Lieferzeit 2-3 Wochen
Taschenbuch
Buch
Lieferzeit 2-3 Wochen
Taschenbuch
