This course offers a solid introduction to algorithm design and data structures, essential components of computer science. It combines theoretical foundations with practical skills to solve computational problems efficiently. Students learn algorithmic thinking through recursion, iteration, and divide-and-conquer strategies. They also study algorithm complexity using Big O notation. The course covers both basic (arrays, stacks, queues, linked lists) and advanced data structures (trees, heaps, hash tables, graphs), along with classical algorithms such as sorting, searching, and graph algorithms. Concepts like dynamic programming and greedy algorithms are also explored. Students apply their knowledge through programming in Python, Java, or C++. This course prepares them for advanced fields like software engineering and artificial intelligence.
- Enseignant: fmerabet Fatima zohra Merabet