000			01664 a2200205 4500
003			OSt
005			20241014154247.0
008			240930b xxu||||| |||| 00| 0 eng d
020			_a9798886130164
040			_cIIT Kanpur
041			_aeng
082			_a518.1 _bK672b
100			_aKlein, Shmuel Tomi
245			_aBasic concepts in algorithms _cShmuel Tomi Klein
260			_bWorld Scientific _c2024 _aChennai
300			_axix, 343p
520			_aThis 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
650			_aAlgorithms
942			_cBK
999			_c567106 _d567106