
The aim of this module is to build a solid foundation in algorithms and data structures by combining theoretical lectures with laboratory practice. The module covers arrays, pointers, linked lists, stacks, queues, trees, recursion, sorting, and algorithmic complexity, ensuring that students can apply both iterative and recursive approaches to solve classical algorithmic problems.
- Teacher: Nouha Khyari
- Teacher: Ameny Rjiba








