Titre : | Course - Algorithms and complexity |
Type de document : | texte imprimé |
Editeur : | saida : Université dr Moulay Tahar, 2024 |
Format : | 110p / 27cm |
Accompagnement : | cd |
Langues: | Français |
Mots-clés: | Algorithmic complexity ; Root ; anti-root |
Résumé : |
his course serves as a fundamental introduction to algorithms and complexity,
essential fields in computer science. Structured into five chapters, it aims to provide students with a solid and practical foundation in these crucial areas. The first chapter, "A Review of Algorithmics and Complexity," lays the groundwork by presenting precise definitions and essential concepts. This chapter is designed to help students understand the fundamental principles underlying the analysis and design of algorithms, as well as various aspects of algorithmic complexity. The second chapter, "Sorting Algorithms," delves deeply into different sorting techniques. These algorithms are critical tools for any computer scientist, enabling efficient data manipulation by organizing data into specific orders. The chapter covers classical algorithms such as insertion sort, selection sort, bubble sort, as well as more advanced approaches like quicksort and mergesort. The third chapter focuses on trees and tree structures. Trees are fundamental data structures in computer science used to efficiently organize and hierarchically structure data. This chapter explores different types of trees, their properties, and their use in applications such as advanced data structures and search and traversal algorithms. In the fourth chapter, we delve into the field of graphs. This chapter introduces essential methods for graph representation, such as adjacency lists and adjacency matrices, as well as fundamental algorithms for solving complex graph problems. Special attention is given to shortest path algorithms, a crucial issue in practical applications such as transportation networks and social networks. |
Exemplaires (1)
Code-barres | Cote | Support | Localisation | Section | Disponibilité |
---|---|---|---|---|---|
POLYSC000054 | POLY00054 | Livre | Fonds propre-bibliotheque centrale | matématique/ رياضيات | Consultation sur place Exclu du prêt |
Documents numériques (1)
POLYSC000054 Adobe Acrobat PDF |