Bine ați venit la Eliva Press BookStore!
EN RO
Selectați cartea care vi se potrivește cel mai bine!
Cart
0
Close

Coșul este gol

A New Approach: Data Structure and Algorithms With Python

$ 79.5

Pages:333
Published: 2023-11-23
ISBN:978-99993-1-265-3
Category: Computer Science
Description Reviews (1) Leave review

Description

A comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation in Python, is provided by Data Structures and Algorithms in Python. It offers comprehensive algorithmic methodologies for creating effective realizations of popular data structures including arrays, stacks, queues, linked lists, trees, maps, hash tables, search trees, and graphs while maintaining a consistent object-oriented perspective throughout the entire book. The book also offers a thorough examination of algorithmic performance, which aids readers in identifying typical compromises made by opposing tactics. The book includes several pedagogical elements, such as code snippets, activities at the end of each chapter, and graphics. A thorough and complete introduction to data structures and algorithms, including their design, analysis, and implementation in Python, is provided by Data Structures and Algorithms in Python. It offers comprehensive algorithmic methodologies for creating effective realizations of popular data structures such as arrays, stacks, queues, linked lists, trees, maps, hash tables, search trees, and graphs. The book has a consistent object-oriented viewpoint throughout. Additionally, the book offers a thorough examination of algorithmic performance, which aids readers in identifying typical trade-offs between conflicting tactics. Numerous instructional elements are incorporated throughout the book, such as activities at the end of each chapter, code snippets, and graphics. The concept of abstract data type, small-oh and small-omega notations, recursive implementation of the Tower of Hanoi puzzle, circular queues, evaluation of arithmetic expressions using stacks, collision-handling mechanisms like hashing using buckets, extensible hashing, and perfect hashing, Bellman-Ford algorithm, and search algorithms-linear, Fibonacci, and index-as well as alternative sorting algorithm implementations-bubble-sort, selection-sort, insertion-sort, and shell-sort-are all included in this restructured Indian adaptation, strengthening the coverage.

Nov-25 2023

Super book.. so informative



Serviciile de livrare internațională

more info