This course introduces fundamental concepts of data structures and algorithms using the C++ programming language. Students will learn about pointers, recursion, algorithmic complexity, various sorting methods, linked lists, stacks, queues, and binary trees. By the end of the course, students should be able to: • Understand and implement various data structures and algorithms in C++. • Analyze algorithmic complexity and make informed decisions about algorithm selection. • Write C++ programs that utilize pointers, recursion, and different data structures. • Apply sorting techniques and understand their trade-offs. • Implement and manipulate linked lists, stacks, queues, binary trees, and binary search trees.

Temps présentiel : 30 heures

Charge de travail étudiant : 100 heures

Méthode(s) d'évaluation : Examen écrit

Référence :
"Data Structures and Algorithm Analysis in C++", by Mark A. Weiss "Introduction to Algorithms", by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Steinby D.S. Malik