General description
This course exposes different data structure and algorithms. Topics include:
Concept of an algorithm, abstract data structure, arrays, lists, stacks, queues,
trees, hash tables, graphs, and its algorithms.
This course prepares students to apply the main concepts of data structure
and algorithms (I) in solving informatic problem in the most appropriate way,
and measuring the complexity in terms of execution time, number of executed
operations and the memory allocation size. The ultimate goal of this course is
to enable students to design and analyze algorithms as optimal as possible in
different engineering domains.