Des services pour PMB
Accueil
Détail de l'auteur
Auteur Brahim Bessaa |
Documents disponibles écrits par cet auteur (3)
Faire une suggestion Affiner la recherche
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 ofData 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 ofExemplaires(5)
Code-barres Date d'acquisition Origine Cote Support Localisation Section Disponibilité fssa7571 004.421.63 BES1 Livre BIB-SE BIB-SE Disponible 31/12/2024 fssa7572 004.421.63 BES2 Livre BIB-SE BIB-SE Disponible 31/12/2024 fssa7573 004.421.63 BES3 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 fssa7574 004.421.63 BES4 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 fssa7575 004.421.63 BES5 Livre BIB-SE BIB-SE Disponible 31/12/2024
Titre : Digital Logic and computer organization : exercies with solutions Type de document : texte imprimé Auteurs : Brahim Bessaa, Auteur Année de publication : 2024 Format : 16 x 24 ISBN/ISSN/EAN : 978-9947-34-324-1 Langues : Français (fre) Mots-clés : algebraic simplification, and canonical forms. Résumé : he course on “Computer Architecture” is intended for students in the first year of their university journey, particularly those in the field of Computer Science. This course delves into the fundamental operational principles of
computers. It equips students with an in-depth comprehension of the intricate organization of these machines at a low level.
This book, titled ‘Digital Logic and Computer Organization: Exercises with Solutions,' serves as a complementary resource to fortify this comprehension.
Through a diverse array of exercises spanning the chapters of the course, the book reinforces key concepts. It comprises over 120 exercises accompanied
by meticulously crafted solutions.
The content is thoughtfully structured across seven chapters, aligned with the curriculum of the “Computer Architecture” module.
Chapter 1: ‘Number Systems’ encompasses exercises centered around conversions between various number systems, as well as arithmetic operations within B-based systems.
Chapter 2: ‘Data Representation in Computers’ presents exercises that delve
into distinct methodologies for representing numeric (integer and real) as wel as alphanumeric data. Additionally, it addresses codes such as DCB, Gray
and ASCII.
Chapter 3: 'Boolean Algebra and Logic Functions' delves into Boolea Algebra, elucidating topics like function representation through truth table
Karnaugh tables, algebraic simplification, and canonical forms.
Chapter 4: ‘'Combinational Logic Circuits’ offers an array of exercises th explore the representation of logic functions via logic circuits. Furthermot it tackles common combinational circuits like Decoders and Multiplexers.Digital Logic and computer organization : exercies with solutions [texte imprimé] / Brahim Bessaa, Auteur . - 2024 . - ; 16 x 24.
ISBN : 978-9947-34-324-1
Langues : Français (fre)
Mots-clés : algebraic simplification, and canonical forms. Résumé : he course on “Computer Architecture” is intended for students in the first year of their university journey, particularly those in the field of Computer Science. This course delves into the fundamental operational principles of
computers. It equips students with an in-depth comprehension of the intricate organization of these machines at a low level.
This book, titled ‘Digital Logic and Computer Organization: Exercises with Solutions,' serves as a complementary resource to fortify this comprehension.
Through a diverse array of exercises spanning the chapters of the course, the book reinforces key concepts. It comprises over 120 exercises accompanied
by meticulously crafted solutions.
The content is thoughtfully structured across seven chapters, aligned with the curriculum of the “Computer Architecture” module.
Chapter 1: ‘Number Systems’ encompasses exercises centered around conversions between various number systems, as well as arithmetic operations within B-based systems.
Chapter 2: ‘Data Representation in Computers’ presents exercises that delve
into distinct methodologies for representing numeric (integer and real) as wel as alphanumeric data. Additionally, it addresses codes such as DCB, Gray
and ASCII.
Chapter 3: 'Boolean Algebra and Logic Functions' delves into Boolea Algebra, elucidating topics like function representation through truth table
Karnaugh tables, algebraic simplification, and canonical forms.
Chapter 4: ‘'Combinational Logic Circuits’ offers an array of exercises th explore the representation of logic functions via logic circuits. Furthermot it tackles common combinational circuits like Decoders and Multiplexers.Exemplaires(8)
Code-barres Date d'acquisition Origine Cote Support Localisation Section Disponibilité 7452 004.31 BES1 Livre BIB-SE BIB-SE Disponible 31/12/2024 7461 004.31 BES10 Livre BIB-SE BIB-SE Disponible 31/12/2024 7583 004.31 BES3 Livre BIB-SE BIB-SE Disponible 31/12/2024 7584 004.31 BES4 Livre BIB-SE BIB-SE Disponible 31/12/2024 7585 004.31 BES5 Livre BIB-SE BIB-SE Disponible 31/12/2024 7485 004.31 BES7 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 7459 004.31 BES8 Livre BIB-SE BIB-SE Disponible 31/12/2024 7460 004.31 BES9 Livre BIB-SE BIB-SE Disponible
Titre : From Algorithm to C program : exercices with source codes in C language Type de document : texte imprimé Auteurs : Brahim Bessaa, Auteur Editeur : page bleu Année de publication : 2024 ISBN/ISSN/EAN : 9789947343528 Langues : Français (fre) Mots-clés : Algorithm Programmation en C
Structures de données
Conception d'algorithmeRésumé : it is with great pleasure that we present to you this second book, "From Algorithm to C Program: Exercises with source codes in C language" following the success of our first book, "Algorithms: Exercises with
solutions". This new volume focuses on the second part of the algorithmics module, dedicated to practical exercises.
In "From Algorithm to C Program," we have taken the exercises from the previous book and provided you with the corresponding C programs for each algorithm. Our goal is not to teach a comprehensive C language course, but rather to offer a practical approach to translating algorithmic instructions into executable code in C. Once you have grasped the fundamentals of writing a correct algorithm, the transition to C programming becomes straightforward by adhering to a set of
guidelines.
This book is designed as a companion to reinforce your understanding of algorithms and to help you gain proficiency in implementing them in C. It is assumed that you have already familiarized yourself with the basics
of algorithm design, and now you can put that knowledge into practice through the practical exercises presented here. As you embark on this journey through the world of algorithms and C
programming, we hope this book will serve as a valuable resource to
complement your learning experience. While the focus is on algorithm:TO-code translation xe encourage you to explore additional it is with great pleasure that we present to you this second book, "From Algorithm to C Program: Exercises with source codes in C language" following the success of our first book, "Algorithms: Exercises with
solutions". This new volume focuses on the second part of the algorithmics module, dedicated to practical exercises.
In "From Algorithm to C Program," we have taken the exercises from the previous book and provided you with the corresponding C programs for each algorithm. Our goal is not to teach a comprehensive C language course, but rather to offer a practical approach to translating algorithmic instructions into executable code in C. Once you have grasped the fundamentals of writing a correct algorithm, the transition to C programming becomes straightforward by adhering to a set of
guidelines.
This book is designed as a companion to reinforce your understanding of algorithms and to help you gain proficiency in implementing them in C. It is assumed that you have already familiarized yourself with the basics
of algorithm design, and now you can put that knowledge into practice through the practical exercises presented here. As you embark on this journey through the world of algorithms and C
programming, we hope this book will serve as a valuable resource to
complement your learning experience. While the focus is on algorithm:
From Algorithm to C program : exercices with source codes in C language [texte imprimé] / Brahim Bessaa, Auteur . - page bleu, 2024.
ISSN : 9789947343528
Langues : Français (fre)
Mots-clés : Algorithm Programmation en C
Structures de données
Conception d'algorithmeRésumé : it is with great pleasure that we present to you this second book, "From Algorithm to C Program: Exercises with source codes in C language" following the success of our first book, "Algorithms: Exercises with
solutions". This new volume focuses on the second part of the algorithmics module, dedicated to practical exercises.
In "From Algorithm to C Program," we have taken the exercises from the previous book and provided you with the corresponding C programs for each algorithm. Our goal is not to teach a comprehensive C language course, but rather to offer a practical approach to translating algorithmic instructions into executable code in C. Once you have grasped the fundamentals of writing a correct algorithm, the transition to C programming becomes straightforward by adhering to a set of
guidelines.
This book is designed as a companion to reinforce your understanding of algorithms and to help you gain proficiency in implementing them in C. It is assumed that you have already familiarized yourself with the basics
of algorithm design, and now you can put that knowledge into practice through the practical exercises presented here. As you embark on this journey through the world of algorithms and C
programming, we hope this book will serve as a valuable resource to
complement your learning experience. While the focus is on algorithm:TO-code translation xe encourage you to explore additional it is with great pleasure that we present to you this second book, "From Algorithm to C Program: Exercises with source codes in C language" following the success of our first book, "Algorithms: Exercises with
solutions". This new volume focuses on the second part of the algorithmics module, dedicated to practical exercises.
In "From Algorithm to C Program," we have taken the exercises from the previous book and provided you with the corresponding C programs for each algorithm. Our goal is not to teach a comprehensive C language course, but rather to offer a practical approach to translating algorithmic instructions into executable code in C. Once you have grasped the fundamentals of writing a correct algorithm, the transition to C programming becomes straightforward by adhering to a set of
guidelines.
This book is designed as a companion to reinforce your understanding of algorithms and to help you gain proficiency in implementing them in C. It is assumed that you have already familiarized yourself with the basics
of algorithm design, and now you can put that knowledge into practice through the practical exercises presented here. As you embark on this journey through the world of algorithms and C
programming, we hope this book will serve as a valuable resource to
complement your learning experience. While the focus is on algorithm:
Exemplaires(7)
Code-barres Date d'acquisition Origine Cote Support Localisation Section Disponibilité 7586 004.42 BES 1 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 7589 004.42 BES 4 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 7470 004.42 BES 9 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 4771 004.42 BES10 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 7587 004.42 BES2 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 7588 004.42 BES3 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 7590 004.42 BES5 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024
