検索結果をRefWorksへエクスポートします。対象は1件です。
Export
RT Book, Whole SR Electronic DC OPAC T1 Problems on Algorithms : A Comprehensive Exercise Book for Students in Software Engineering / by Habib Izadkhah A1 Izadkhah, Habib A1 SpringerLink (Online service) YR 2022 FD 2022 SP XII, 513 p. 95 illus., 4 illus. in color K1 Engineering -- Data processing K1 Computational intelligence K1 Machine learning K1 Engineering mathematics K1 Data Engineering K1 Computational Intelligence K1 Machine Learning K1 Mathematical and Computational Engineering Applications ED 1st ed. 2022. PB Springer International Publishing : Imprint: Springer PP Cham SN 9783031170430 LA English (英語) CL LCC:TA345-345.5 CL DC23:620.00285 NO Mathematical Induction -- Growth of Functions -- Recurrence Relations -- Algorithm Analysis -- Basic Data Structure -- Hash -- Tree -- Search -- Sorting -- Divide and Conquer -- Dynamic Programming -- Greedy Algorithms -- Graph -- Backtracking Algorithms -- P, NP, NP-Complete, and NP-Hard Problems NO With approximately 2500 problems, this book provides a collection of practical problems on the basic and advanced data structures, design, and analysis of algorithms. To make this book suitable for self-instruction, about one-third of the algorithms are supported by solutions, and some others are supported by hints and comments. This book is intended for students wishing to deepen their knowledge of algorithm design in an undergraduate or beginning graduate class on algorithms, for those teaching courses in this area, for use by practicing programmers who wish to hone and expand their skills, and as a self-study text for graduate students who are preparing for the qualifying examination on algorithms for a Ph.D. program in Computer Science or Computer Engineering. About all, it is a good source for exam problems for those who teach algorithms and data structure. The format of each chapter is just a little bit of instruction followed by lots of problems. This book is intended to augment the problem sets found in any standard algorithms textbook. This book • begins with four chapters on background material that most algorithms instructors would like their students to have mastered before setting foot in an algorithms class. The introductory chapters include mathematical induction, complexity notations, recurrence relations, and basic algorithm analysis methods. • provides many problems on basic and advanced data structures including basic data structures (arrays, stack, queue, and linked list), hash, tree, search, and sorting algorithms. • provides many problems on algorithm design techniques: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, and backtracking algorithms. • is rounded out with a chapter on NP-completeness NO HTTP:URL=https://doi.org/10.1007/978-3-031-17043-0 NO 書誌ID=EB00000994; LK [E Book]https://doi.org/10.1007/978-3-031-17043-0 OL 30