國立虎尾科技大學 |

Problems on Algorithms = A Comprehensive Exercise Book for Students in Software Engineering /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Problems on Algorithms/ by Habib Izadkhah.
其他題名:	A Comprehensive Exercise Book for Students in Software Engineering /
作者:	Izadkhah, Habib.
面頁冊數:	XII, 513 p. 95 illus., 4 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical and Computational Engineering Applications. -
電子資源:	https://doi.org/10.1007/978-3-031-17043-0
ISBN:	9783031170430

Problems on Algorithms = A Comprehensive Exercise Book for Students in Software Engineering /
Izadkhah, Habib.

Problems on AlgorithmsA Comprehensive Exercise Book for Students in Software Engineering /[electronic resource] :by Habib Izadkhah. - 1st ed. 2022. - XII, 513 p. 95 illus., 4 illus. in color.online resource.

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.

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.

ISBN: 9783031170430

Standard No.: 10.1007/978-3-031-17043-0doiSubjects--Topical Terms:

1387767
Mathematical and Computational Engineering Applications.

LC Class. No.: TA345-345.5

Dewey Class. No.: 620.00285

Problems on Algorithms = A Comprehensive Exercise Book for Students in Software Engineering /
LDR:03467nam a22003975i 4500 001 1085068
003 DE-He213
005 20221101174924.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031170430 $9 978-3-031-17043-0
024 7 $a 10.1007/978-3-031-17043-0 $2 doi
035 $a 978-3-031-17043-0
050 4 $a TA345-345.5
072 7 $a UN $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UN $2 thema
082 0 4 $a 620.00285 $2 23
100 1 $a Izadkhah, Habib. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1171748
245 1 0 $a Problems on Algorithms $h [electronic resource] : $b A Comprehensive Exercise Book for Students in Software Engineering / $c by Habib Izadkhah.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XII, 513 p. 95 illus., 4 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 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.
520 $a 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.
650 2 4 $a Mathematical and Computational Engineering Applications. $3 1387767
650 2 4 $a Machine Learning. $3 1137723
650 2 4 $a Computational Intelligence. $3 768837
650 1 4 $a Data Engineering. $3 1226308
650 0 $a Engineering mathematics. $3 562757
650 0 $a Machine learning. $3 561253
650 0 $a Computational intelligence. $3 568984
650 0 $a Engineering—Data processing. $3 1297966
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031170423
776 0 8 $i Printed edition: $z 9783031170447
776 0 8 $i Printed edition: $z 9783031170454
856 4 0 $u https://doi.org/10.1007/978-3-031-17043-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)