Cantitate/Preț
Produs
Total produse
Vezi coșul
Problems on Algorithms de Habib Izadkhah

Problems on Algorithms

Autor Habib Izadkhah
en Limba Engleză Hardback – 2 noi 2022
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.

Citește tot Restrânge

Preț: 68776 lei

Preț vechi: 85970 lei
-20%

Puncte Express: 1032
Paperback 41644 lei
Hardback 68776 lei

Carte tipărită la comandă

Livrare economică 19 decembrie 26 - 02 ianuarie 27

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783031170423
ISBN-10: 3031170423
Pagini: 528
Ilustrații: XII, 513 p. 95 illus., 4 illus. in color.
Dimensiuni: 160 x 241 x 34 mm
Greutate: 0.9 kg
Ediția:1st ed. 2022
Editura: Springer
Locul publicării:Cham, Switzerland

Cuprins

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.

Notă biografică

Ayaz Isazadeh is Professor and the founding member of the Department of Computer Science, University of Tabriz, Iran. His research interests include software engineering, software architecture, and recently, software structural evolution, with over 100 papers in international journals and conference proceedings. He has served as the chair and honorary chair of numerous national and international conferences. Ayaz received his Master's degree in Electrical Engineering and Computer Science from Princeton University, in 1978, and Ph.D. degree in Computing and Information Science from Queen's University, Canada, in 1996. Before returning to graduate school in 1992, he worked with AT&T Bell Laboratories for over 8 years on various software systems development.
Habib Izadkhah is Assistant Professor at the Department of Computer Science, University of Tabriz, Iran. His research interests include software engineering, software architecture, reverse engineering, and organic software. More recently he has been working on the application of reverse engineering and modularization to the extract of software structure for large scale and multi programming languages source code. He contributed to various research projects, co-authored a number of research papers in international conferences, workshops and journals, and also has written five books.
Islam Elgedawy is Associate Professor at the Computer Engineering Department, Middle East Technical University, Northern Cyprus Campus. His research interests include the areas of service-oriented computing, organic computing, and software engineering. More recently he has been working on designing and building organic composite web services, where different models for machine consciousness and digital brains are incorporated. He led and contributed to various research projects, and co-authored a number of research papers in international conferences, workshops and journals, and he also has a growing record of consultancy and professional services.

Textul de pe ultima copertă

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.

Caracteristici

Provides a comprehensive collection of practical problems on the design, analysis and verification of algorithms Includes approximately 1500 designed problems Presents algorithms which are supported by figures, hints, solutions, and comments