Store besparelser
Hurtig levering
Gemte
Log ind
0
Kurv
Bøger
Bestsellers
Kommer snart
Nyheder
Spil og hobby
Hjem
Kategorier
Bestsellers
Kommer snart
Nyheder
FAQ
Konto
Kontakt
Kurv
  1. Bog
  2. Kunstig intelligens
  3. Machine learning

Problems on Algorithms

- A Comprehensive Exercise Book for Students in Software Engineering
Af: Habib Izadkhah Engelsk Hardback

Problems on Algorithms

- A Comprehensive Exercise Book for Students in Software Engineering
Af: Habib Izadkhah Engelsk Hardback
Tjek vores konkurrenters priser
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.

Vis mere
Tjek vores konkurrenters priser
Normalpris
kr 907
Fragt: 39 kr
6 - 8 hverdage
20 kr
Pakkegebyr
God 4 anmeldelser på
Tjek vores konkurrenters priser
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.

Vis mere
Se mere i:
Produktdetaljer
Sprog: Engelsk
Sider: 513
ISBN-13: 9783031170423
Indbinding: Hardback
Udgave:
ISBN-10: 3031170423
Kategori: Machine learning
Udg. Dato: 2 nov 2022
Længde: 0mm
Bredde: 155mm
Højde: 235mm
Forlag: Springer International Publishing AG
Oplagsdato: 2 nov 2022
Forfatter(e): Habib Izadkhah
Forfatter(e) Habib Izadkhah

Kategori Machine learning

ISBN-13 9783031170423

Sprog Engelsk

Indbinding Hardback

Sider 513

Udgave

Længde 0mm

Bredde 155mm

Højde 235mm

Udg. Dato 2 nov 2022

Oplagsdato 2 nov 2022

Forlag Springer International Publishing AG

Kategori sammenhænge