| Titre : |
Data Structure and Algorithms : exercices and problrms with solutions |
| Type de document : |
texte imprimé |
| Auteurs : |
Brahim Bessaa, Auteur |
| Editeur : |
page bleu |
| Année de publication : |
2024 |
| Format : |
17,5 cm × 24,0 cm × 0,6 cm |
| ISBN/ISSN/EAN : |
978-9947-34-335-7 |
| Langues : |
Français (fre) |
| Mots-clés : |
Teaching algorithms staks and queus trees |
| Index. décimale : |
004.40 Généralités sur les logiciels
|
| Résumé : |
The author, Dr. Brahim BESSAA, is s senior lecturer at the University of Science and Technology Houari Boumediene. He has been teaching algorithms in ie computer science faculty for several years.
This book on algorithms is primarily aimed at second-year undergraduate students in computer science, but also at anyone who will need to develop computer programs during their studies or in their professional life.
The author is a teacher who fully understands the expectations of students and offers an interesting approach here, Rather than presenting a course with à few exercises, the author has chosen to summarize the course by retaining the most relevant elements followed by several exercises with solutions.
The presentation of this work is clear, the algorithms are described in an algorihmic notation of great simplicity, and the exercises are accompanied bÿ solutions carefully selected. The reader can easily familiarize themselves with and deepen their understanding of the concepts encountered through numerous graded exercises with solutions. For pedagogical reasons, some solutions have been translated into the C language. C language is still wideiy used today for reasons of code efficiency, speed, and also if there are limited computational resources.
A particular pedagogical challenge is well defended in this book: that of wnbng efficient algorithms. Designing algorithms is a difficult task that requires deep thought; it is the moment when one seeks to find the brilliant idea, the hidden structure that will allow solving the problem. For the same problem, there are often several algorithms that lead to its solution. The choice of the “best” algorithm is generally guided by critena of efficiency. Thus, for the majority of exercises, the author proposes different solutions, giving the theoretical complexity of each
solution followed by an analysis to draw conclusions about their efficiency.
The range of algorithms presented ranges from the simplest data structures (siahc or dynamic arrays and linked lists) to the most sophisticated (trees, stacks, queues, and hash tables). Also noteworthy is the importance given to different measures of complexity, which allow, among other things, to deepen the study of |
Data Structure and Algorithms : exercices and problrms with solutions [texte imprimé] / Brahim Bessaa, Auteur . - page bleu, 2024 . - ; 17,5 cm × 24,0 cm × 0,6 cm. ISBN : 978-9947-34-335-7 Langues : Français ( fre)
| Mots-clés : |
Teaching algorithms staks and queus trees |
| Index. décimale : |
004.40 Généralités sur les logiciels
|
| Résumé : |
The author, Dr. Brahim BESSAA, is s senior lecturer at the University of Science and Technology Houari Boumediene. He has been teaching algorithms in ie computer science faculty for several years.
This book on algorithms is primarily aimed at second-year undergraduate students in computer science, but also at anyone who will need to develop computer programs during their studies or in their professional life.
The author is a teacher who fully understands the expectations of students and offers an interesting approach here, Rather than presenting a course with à few exercises, the author has chosen to summarize the course by retaining the most relevant elements followed by several exercises with solutions.
The presentation of this work is clear, the algorithms are described in an algorihmic notation of great simplicity, and the exercises are accompanied bÿ solutions carefully selected. The reader can easily familiarize themselves with and deepen their understanding of the concepts encountered through numerous graded exercises with solutions. For pedagogical reasons, some solutions have been translated into the C language. C language is still wideiy used today for reasons of code efficiency, speed, and also if there are limited computational resources.
A particular pedagogical challenge is well defended in this book: that of wnbng efficient algorithms. Designing algorithms is a difficult task that requires deep thought; it is the moment when one seeks to find the brilliant idea, the hidden structure that will allow solving the problem. For the same problem, there are often several algorithms that lead to its solution. The choice of the “best” algorithm is generally guided by critena of efficiency. Thus, for the majority of exercises, the author proposes different solutions, giving the theoretical complexity of each
solution followed by an analysis to draw conclusions about their efficiency.
The range of algorithms presented ranges from the simplest data structures (siahc or dynamic arrays and linked lists) to the most sophisticated (trees, stacks, queues, and hash tables). Also noteworthy is the importance given to different measures of complexity, which allow, among other things, to deepen the study of |
|  |
Accueil
004 Informatique
