Des services pour PMB
Accueil
Détail de l'éditeur
|
|
Documents disponibles chez cet éditeur (7)
Faire une suggestion Affiner la rechercheALGORITHMIQUE structure des donneés (2008) / 978-9961-734-93-3
Exemplaires(1)
Code-barres Date d'acquisition Origine Cote Support Localisation Section Disponibilité 2723 004.42 BEL1 Livre BIB-SE BIB-SE Exclu du prêt
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(7)
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 290 004.421.63 BES6 Livre BIB-SE BIB-SE Exclu du prêt 12/12/2025 291 004.421.63 BES7 Livre BIB-SE BIB-SE Exclu du prêt 12/12/2025
Titre : English for Engineers: Teachers and Students : teachers and student Type de document : texte imprimé Editeur : page bleu Année de publication : 2024 Format : 17,5 cm × 24,0 cm × 0,6 cm ISBN/ISSN/EAN : 978-9947-34-314-2 Langues : Anglais (eng) Mots-clés : vocabulary electrical engineering Résumé : English for Teachers & Students of Engineering contains worksheets that facilh the teaching and the learning of the vocabulary of the engineering fields of st fisted below: 1
1. LA +.
6. Electrical engineering [telecommunication, information technology, « processing & computing, power) Mechanical engineering (thermal, fluid mechanics, production manufacturing, design of mechanical systems) Chemical engineering Civil engineering Nuclear engineering Aerospace engineering (air & space) Navigation engineering (sea & undersea) Medical engineering Assortments of self-contained, subject-specific vocabulary worksheets have standardised for classwork and homework in the following order: di. 2. Crosswords Match the word/phrase with the definition Label the picture/diagram Anagrams Word Search puzzles Filkin the-gap exercises Brainstorming Mind Mapping Muitiple chorce questionsEnglish for Engineers: Teachers and Students : teachers and student [texte imprimé] . - page bleu, 2024 . - ; 17,5 cm × 24,0 cm × 0,6 cm.
ISBN : 978-9947-34-314-2
Langues : Anglais (eng)
Mots-clés : vocabulary electrical engineering Résumé : English for Teachers & Students of Engineering contains worksheets that facilh the teaching and the learning of the vocabulary of the engineering fields of st fisted below: 1
1. LA +.
6. Electrical engineering [telecommunication, information technology, « processing & computing, power) Mechanical engineering (thermal, fluid mechanics, production manufacturing, design of mechanical systems) Chemical engineering Civil engineering Nuclear engineering Aerospace engineering (air & space) Navigation engineering (sea & undersea) Medical engineering Assortments of self-contained, subject-specific vocabulary worksheets have standardised for classwork and homework in the following order: di. 2. Crosswords Match the word/phrase with the definition Label the picture/diagram Anagrams Word Search puzzles Filkin the-gap exercises Brainstorming Mind Mapping Muitiple chorce questionsExemplaires(7)
Code-barres Date d'acquisition Origine Cote Support Localisation Section Disponibilité fssa7481 811.111 ZOU10 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 fssa7473 811.111 ZOU2 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 fssa7474 811.111 ZOU3 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 fssa7475 811.111 ZOU4 Livre BIB-SE BIB-SE Disponible 31/12/2024 fssa7476 811.111 ZOU5 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 fssa7479 811.111 ZOU8 Livre BIB-SE BIB-SE Disponible 31/12/2024 fssa7480 811.111 ZOU9 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024
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 Disponible 31/12/2024 7589 004.42 BES 4 Livre BIB-SE BIB-SE Disponible 31/12/2024 7470 004.42 BES 9 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 7471 004.42 BES10 Livre BIB-SE BIB-SE Sorti jusqu'au 14/12/2025 31/12/2024 fssa7587 004.42 BES2 Livre BIB-SE BIB-SE Exclu du prêt 31/12/2024 7588 004.42 BES3 Livre BIB-SE BIB-SE Disponible 31/12/2024 7590 004.42 BES5 Livre BIB-SE BIB-SE Disponible 31/12/2024
Titre : Notion Fondamental pour l'électricité et l'électronique : Cours et exercices et sujet d'examen corrigés Type de document : texte imprimé Editeur : page bleu Année de publication : 2014 Format : 17,5 cm × 24,0 cm × 0,6 cm ISBN/ISSN/EAN : 978-9947-850-96-1 Index. décimale : 621.38 Résumé : Notre cours est destiné aux étudiants du premier cycle universitaire en sciences physiques et techniques dans la formation LMD ainsi qu'aux Ctudiants
des classes preparatoires sciences et techniques pour les écoles supérieures, qui auront à suivre des formations varices telles que l'électronique générale, les . Ha
telecommunicanons, l'electronique biomedicale, le génie biomédical.. pour but d'enseigner les élements de base de la physique, de donner des
imitations aux senu conducteurs et de presenter leurs applications les plus courantes. Le principal but est la maîtrise des théorèmes fondamentaux de
l'électricité qui permettent aux étudiants d'aborder avec aisance les circuits
complexes qu'ils auront tout au long de leurs formations. q Nous commençons le cours avec un rappel des notions élémentaires de
la physique. Après ; nous étudions les composants passifs : la résistance, le condensateur et l’inductance. Ensuite nous traitons le régime sinusoïdal, les transformées de Laplace, la représentation des fonctions de réseaux et les théorèmes généraux. Le théorème de Fourier relève du signal et non du circuit, mais il est d’une grande importance et les étudiants l'utilisent dès la troisième année toute filières confondues. Nous jugeons alors nécessaire de le traiter dans notre cours. Ensuite ; nous étudions les quadripôles d’une manière très détaillée, et le transformateur. Puis nous introduisons les semi-conducteurs et LB jonction PN ; le calcul sera détaillé dans les spécialités, où d’ailleurs des
dispositifs électroniques et optoélectroniques seront aussi étudiés, en faisant
appel à la mécanique quantique.
Dans le dixième chapitre ; nous étudions qualitativement toutes les diodes avec une explication voulue simple et suffisante, et nous donnons leurs applications les plus répandues. Au dernier chapitre ; nous étudions en détail les circuits fondamentaux à base des diodes redresseuses.
Pour une meilleure assimilation du cours, chaque chapitre est suivi d'exercices (voire de problèmes). Nous essayons de classer ces derniers, à la fois par ordre de difficulté croissante et par ordre d’exposition des notionsNotion Fondamental pour l'électricité et l'électronique : Cours et exercices et sujet d'examen corrigés [texte imprimé] . - page bleu, 2014 . - ; 17,5 cm × 24,0 cm × 0,6 cm.
ISBN : 978-9947-850-96-1
Index. décimale : 621.38 Résumé : Notre cours est destiné aux étudiants du premier cycle universitaire en sciences physiques et techniques dans la formation LMD ainsi qu'aux Ctudiants
des classes preparatoires sciences et techniques pour les écoles supérieures, qui auront à suivre des formations varices telles que l'électronique générale, les . Ha
telecommunicanons, l'electronique biomedicale, le génie biomédical.. pour but d'enseigner les élements de base de la physique, de donner des
imitations aux senu conducteurs et de presenter leurs applications les plus courantes. Le principal but est la maîtrise des théorèmes fondamentaux de
l'électricité qui permettent aux étudiants d'aborder avec aisance les circuits
complexes qu'ils auront tout au long de leurs formations. q Nous commençons le cours avec un rappel des notions élémentaires de
la physique. Après ; nous étudions les composants passifs : la résistance, le condensateur et l’inductance. Ensuite nous traitons le régime sinusoïdal, les transformées de Laplace, la représentation des fonctions de réseaux et les théorèmes généraux. Le théorème de Fourier relève du signal et non du circuit, mais il est d’une grande importance et les étudiants l'utilisent dès la troisième année toute filières confondues. Nous jugeons alors nécessaire de le traiter dans notre cours. Ensuite ; nous étudions les quadripôles d’une manière très détaillée, et le transformateur. Puis nous introduisons les semi-conducteurs et LB jonction PN ; le calcul sera détaillé dans les spécialités, où d’ailleurs des
dispositifs électroniques et optoélectroniques seront aussi étudiés, en faisant
appel à la mécanique quantique.
Dans le dixième chapitre ; nous étudions qualitativement toutes les diodes avec une explication voulue simple et suffisante, et nous donnons leurs applications les plus répandues. Au dernier chapitre ; nous étudions en détail les circuits fondamentaux à base des diodes redresseuses.
Pour une meilleure assimilation du cours, chaque chapitre est suivi d'exercices (voire de problèmes). Nous essayons de classer ces derniers, à la fois par ordre de difficulté croissante et par ordre d’exposition des notionsExemplaires(2)
Code-barres Date d'acquisition Origine Cote Support Localisation Section Disponibilité 5267 621.38 HAM1 Livre BIB-SE BIB-SE Disponible 31/12/2024 5268 621.38 HAM2 Livre BIB-SE BIB-SE Disponible 31/12/2024
