Home
»
Basic Concepts In Algorithms
Basic Concepts In Algorithms
Regular price
€122.99
603 verified reviews
100% verified
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A01=Shmuel Tomi Klein
Algorithm Design
Algorithms
Approximations
Author_Shmuel Tomi Klein
Category=UMB
Correctness of Algorithms
Cryptography
Data Compression
Data Structures
Efficiency of Algorithms
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Graph Algorithms
Intractability
Np-Completeness
Numerical Algorithms
Pattern Matching
Primality Testing
Probabilistic Algorithms
Programming Paradigms
Recursion
Space Complexity
Text Processing
Time Complexity
Product details
- ISBN 9789811237584
- Publication Date: 27 Jul 2021
- Publisher: World Scientific Publishing Co Pte Ltd
- Publication City/Country: SG
- Product Form: Hardback
This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second year undergraduate students in study fields related to computers and programming.Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended.Related Link(s)
Shmuel Tomi Klein started teaching in high school, repeating to his classmates almost daily the lectures of their mathematics teacher. As a Computer Science undergraduate at the Hebrew University of Jerusalem, he acted as teaching assistant in the Statistics Department and has since given courses and lectures on data structures, algorithms and related topics, in English, French, German and Hebrew.
Klein's research focuses on data compression text processing algorithms. He is a full professor and former chair of the Computer Science department at Bar Ilan University, Israel. His book Basic Concepts in Data Structures was published in 2016 and he is a co-author of more than 100 academic publications and 10 patents. He is on the editorial board of the journal Information.
Basic Concepts In Algorithms
€122.99
