Advanced Algorithms
This course is a first-year of Master degree (SIGL / IA). Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Subjects to be covered include basices of algorithms, analysing algorithms which include how to calculate complexity and classification of problems, data structures, recursions methods, and other advanceds algorithms such as sorting, graphs, hashage, text...etc.
Contents
Ch 01 Introduction of algorithms: This chapter contains some definitions and basics of algorithms in computer science
- This chapter will take between 2 and 4 sessions.
Ch 02 Algorithms analysis: This chapter contains some definitions and basics of algorithms analysis, it also talk about algorithm complexity, and different class of problems... ext.
- This chapter will take between 2 and 4 sessions.
Ch 03 Review of algorithmic techniques and data structures: This chapter will recall some techniques such as recursion, and we will talk about basic & advanced data structures such as pointers, tables, lists, linked-list, stacks, queues, trees ...ext.
- This chapter will take between 2 and 4 sessions.
Ch 04 Advanced techniques in algorithms: This chapter will focus on the advanced techniques of some well known algorithms in different areas such sorting, hashage, text, graphs
- This chapter will take between 2 and 4 sessions.
Resources
Chapter 01: Introduction of Algorithms
Textbook (PDF)
Youtube (01)
Assignments (TD 01 & TP 01 Solution)
Exam's of last years
2017-2018 (exam, correction)
2018-2019 (exam, correction)
2019-2020 (exam, correction)
2020-2021 (exam, correction)