Problems on algorithms : a comprehensive exercise book for students in software engineering / Habib Izadkhah.

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 su...

Full description

Saved in:
Bibliographic Details
Main Author: Izadkhah, Habib
Format: eBook
Language:English
Published: Cham, Switzerland : Springer, 2022.
Subjects:
Online Access:Click for online access

MARC

LEADER 00000cam a2200000 a 4500
001 on1350185707
003 OCoLC
005 20240808213014.0
006 m o d
007 cr un|---aucuu
008 221105s2022 sz ob 000 0 eng d
040 |a YDX  |b eng  |c YDX  |d GW5XE  |d EBLCP  |d OCLCF  |d UKAHL  |d OCLCQ  |d INT  |d OCLCO  |d WSU  |d OCLCO 
019 |a 1350420454  |a 1374612274 
020 |a 9783031170430  |q (electronic bk.) 
020 |a 3031170431  |q (electronic bk.) 
020 |z 3031170423 
020 |z 9783031170423 
020 |a 9788303117045  |q (0) 
020 |a 8303117041 
024 7 |a 10.1007/978-3-031-17043-0  |2 doi 
035 |a (OCoLC)1350185707  |z (OCoLC)1350420454  |z (OCoLC)1374612274 
050 4 |a QA76.9.A43 
072 7 |a UN  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UN  |2 thema 
049 |a HCDD 
100 1 |a Izadkhah, Habib. 
245 1 0 |a Problems on algorithms :  |b a comprehensive exercise book for students in software engineering /  |c Habib Izadkhah. 
260 |a Cham, Switzerland :  |b Springer,  |c 2022. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent  |0 http://rdaregistry.info/termList/RDAContentType/1020 
337 |a computer  |b c  |2 rdamedia  |0 http://rdaregistry.info/termList/RDAMediaType/1003 
338 |a online resource  |b cr  |2 rdacarrier  |0 http://rdaregistry.info/termList/RDACarrierType/1018 
347 |a text file  |2 rdaft  |0 http://rdaregistry.info/termList/fileType/1002 
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. 
504 |a Includes bibliographical references. 
588 0 |a Online resource; title from PDF title page (SpringerLink, viewed November 15, 2022). 
650 0 |a Computer algorithms  |v Problems, exercises, etc. 
650 0 |a Software engineering  |x Mathematics. 
650 7 |a Computer algorithms  |2 fast 
650 7 |a Software engineering  |x Mathematics  |2 fast 
655 7 |a exercise books.  |2 aat 
655 7 |a Problems and exercises  |2 fast 
655 7 |a Problems and exercises.  |2 lcgft 
655 7 |a Problèmes et exercices.  |2 rvmgf 
776 0 8 |c Original  |z 3031170423  |z 9783031170423  |w (OCoLC)1341438587 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://link.springer.com/10.1007/978-3-031-17043-0  |y Click for online access 
903 |a SPRING-COMP2022 
994 |a 92  |b HCD