Cantitate/Preț
Produs
Total produse
Vezi coșul
Problems on Algorithms: A Comprehensive Exercise Book for Students in Software Engineering de Habib Izadkhah

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

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

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 41298 lei  6-8 săpt.
  Springer International Publishing – 3 noi 2023 41298 lei  6-8 săpt.
Hardback (1) 63836 lei  6-8 săpt.
  Springer International Publishing – 2 noi 2022 63836 lei  6-8 săpt.

Preț: 63836 lei

Preț vechi: 79795 lei
-20% Nou

Puncte Express: 958
Preț estimativ în valută:
12217€ • 12889$ • 10181£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031170423
ISBN-10: 3031170423
Pagini: 513
Ilustrații: XII, 513 p. 95 illus., 4 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.91 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția 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ă

Dr. Habib Izadkhah is an associate professor at the Department of Computer Science, University of Tabriz, Iran. He worked in the industry for a decade as a software engineer before becoming an academic. His research interests include algorithms and graphs, software engineering, and bioinformatics. More recently, he has been working on developing and applying deep learning to a variety of problems, dealing with biomedical images, speech recognition, text understanding, and generative models. He has contributed to various research projects, authored a number of research papers in international conferences, workshops, and journals, and also has written five books, including Source Code Modularization: Theory and Techniques from Springer and Deep Learning in Bioinformatics from Elsevier.

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