×
Dodano do koszyka:
Pozycja znajduje się w koszyku, zwiększono ilość tej pozycji:
Zakupiłeś już tę pozycję:
Książkę możesz pobrać z biblioteki w panelu użytkownika
Pozycja znajduje się w koszyku
Przejdź do koszyka

Zawartość koszyka

ODBIERZ TWÓJ BONUS :: »

Advanced Data Structures and Algorithms Abirami A, Priya R L

(ebook) (audiobook) (audiobook) Książka w języku 1
Autorzy:
Abirami A, Priya R L
Ocena:
Bądź pierwszym, który oceni tę książkę
Stron:
194
Dostępne formaty:
     ePub
     Mobi
Czytaj fragment
Solve complex problems by performing analysis of algorithms or selecting suitable techniques for optimal performance

Key Features
Get familiar with various concepts and techniques of advanced data structures to solve real-world problems.
Learn how to evaluate the efficiency and performance of an algorithm in terms of time and space complexity.
A practical guide for students and faculty members who are interested in this important subject area of Computer Science.

Description
Advanced Data Structures and Algorithms is an important subject area in Computer Science that covers more complex and advanced topics related to data structures and algorithms.

This book will teach you how to analyze algorithms to handle the difficulties of sophisticated programming. It will then help you understand how advanced data structures are used to store and manage data efficiently. Moving on, it will help you explore and work with Divide and Conquer techniques, Dynamic programming, and Greedy algorithms. Lastly, the book will focus on various String Matching Algorithms such as nave string matching algorithms, KnuthMorrisPratt(KMP) Algorithm, and Rabin-Karp Algorithm.

By the end of the book, you will be able to analyze various algorithms with time and space complexity to choose the best suitable algorithms for a given problem.

What you will learn
Understand how to examine an algorithm's time and space complexity.
Explore complex data structures like AVL tree, Huffman coding, and many more.
Learn how to solve larger problems using Divide and Conquer techniques.
Identify the most optimal solution using Greedy and Dynamic Programming.
Learn how to deal with real-world problems using various approaches of the String Matching algorithms.

Who this book is for
This book is aligned with the curriculum of the Computer Engineering program offered by Mumbai University. The book is designed not only for Computer Engineering and Information Technology students but also for anyone who wants to learn about advanced data structures and analysis of algorithms.

Table of Contents
1. Analysis of Algorithm
2. Advanced Data Structures
3. Divide and Conquer
4. Greedy Algorithms
5. Dynamic Algorithms and NP-Hard and NP-Complete
6. String Matching

Wybrane bestsellery

BPB Publications - inne książki

Zamknij

Przenieś na półkę

Proszę czekać...
ajax-loader

Zamknij

Wybierz metodę płatności

Ebook
67,43 zł
Dodaj do koszyka
Zamknij Pobierz aplikację mobilną Ebookpoint
Zabrania się wykorzystania treści strony do celów eksploracji tekstu i danych (TDM), w tym eksploracji w celu szkolenia technologii AI i innych systemów uczenia maszynowego. It is forbidden to use the content of the site for text and data mining (TDM), including mining for training AI technologies and other machine learning systems.