Learn the foundations of Data Structures and Algorithms while discovering how they power modern software and Generative AI systems.
Data Structures and Algorithms in the Era of GenAI presents the essential topics of a traditional undergraduate DSA course through a practical, contemporary lens. Using Python, the book explains not only how common data structures and algorithms work, but also why they matter in applications involving large language models, retrieval systems, intelligent agents, caching, ranking, and data processing.
The book begins with Python and object-oriented programming foundations, then connects Big-O analysis to real-world performance measures such as latency, throughput, memory use, and scalability. It develops the major structures and algorithms step by step, including:
Arrays, lists, strings, and sequence-processing patterns
Linked lists, stacks, queues, and deques
Trees, binary search trees, AVL trees, and Red-Black trees
Heaps and priority queues
Graph representations, traversal, shortest paths, and spanning trees
Hash tables, dictionaries, sets, caches, and memoization
Linear search, binary search, and search variants
Classic sorting algorithms, Timsort, partial sorting, and Top-K selection
Bridge Theory with Modern AI Practice
Generative AI examples are used to clarify the computer science rather than replace it. Readers will see how strings support prompt and response processing, queues manage requests and streaming work, heaps select the best candidates, graphs model workflows and relationships, hash tables support caching and token mappings, and searching and sorting contribute to retrieval and ranking.
Who This Book Is For
Designed for undergraduate students, self-learners, instructors, and industry practitioners, this book requires no prior background in machine learning. Its goal is to help readers move beyond memorizing complexity tables and develop the judgment to choose the right structure for a problem, analyze its tradeoffs, evaluate AI-generated code, and build software that remains efficient as it scales.
Whether you are preparing for a Data Structures course, strengthening your programming foundations, or building modern AI-enabled applications, this book provides the concepts and practical reasoning needed to design better systems.
"synopsis" may belong to another edition of this title.
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Print on Demand. Seller Inventory # I-9798190192667
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # L2-9798190192667
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # L2-9798190192667
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. Learn the foundations of Data Structures and Algorithms while discovering how they power modern software and Generative AI systems.Data Structures and Algorithms in the Era of GenAI presents the essential topics of a traditional undergraduate DSA course through a practical, contemporary lens. Using Python, the book explains not only how common data structures and algorithms work, but also why they matter in applications involving large language models, retrieval systems, intelligent agents, caching, ranking, and data processing.The book begins with Python and object-oriented programming foundations, then connects Big-O analysis to real-world performance measures such as latency, throughput, memory use, and scalability. It develops the major structures and algorithms step by step, including: Arrays, lists, strings, and sequence-processing patternsLinked lists, stacks, queues, and dequesTrees, binary search trees, AVL trees, and Red-Black treesHeaps and priority queuesGraph representations, traversal, shortest paths, and spanning treesHash tables, dictionaries, sets, caches, and memoizationLinear search, binary search, and search variantsClassic sorting algorithms, Timsort, partial sorting, and Top-K selectionBridge Theory with Modern AI PracticeGenerative AI examples are used to clarify the computer science rather than replace it. Readers will see how strings support prompt and response processing, queues manage requests and streaming work, heaps select the best candidates, graphs model workflows and relationships, hash tables support caching and token mappings, and searching and sorting contribute to retrieval and ranking.Who This Book Is ForDesigned for undergraduate students, self-learners, instructors, and industry practitioners, this book requires no prior background in machine learning. Its goal is to help readers move beyond memorizing complexity tables and develop the judgment to choose the right structure for a problem, analyze its tradeoffs, evaluate AI-generated code, and build software that remains efficient as it scales.Whether you are preparing for a Data Structures course, strengthening your programming foundations, or building modern AI-enabled applications, this book provides the concepts and practical reasoning needed to design better systems. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9798190192667
Quantity: 1 available