Information Engineering

General objectives: The aim of the course is to introduce fundamental principles and techniques for data representation, algorithm design, and analysis of their performance. The application of these principles and techniques is demonstrated through the study of classic algorithms and data structures, which are of significant theoretical and practical importance. Linear and non-linear connected structures (lists, stacks, queues, trees, graphs, hash tables) are covered, along with their respective sorting, searching, and selection problems, analyzing the performance of the corresponding algorithms. Specific objectives: Knowledge and understanding: By the end of the course, students are expected to be familiar with classic data structures and algorithms for solving fundamental problems, as well as the main techniques for performance analysis. Applied knowledge and understanding: Through the application of acquired knowledge, students learn to compare different solutions based on their computational characteristics (time taken, memory usage) and are able to provide a concrete implementation of the studied data structures and algorithms in a programming language. Judgment autonomy: Targeted exercises enable students to develop the ability to design and implement algorithmic solutions and evaluate their performance. Communication skills: Classroom lectures provide students with the technical language necessary for effective idea exchange; this language is used by students during interactive exercises to propose and analyze their own solution to the chosen problem. Learning ability: The course introduces basic notions, principles, and techniques necessary for the study of algorithms and data structures in general. Although the application of these elements is demonstrated on a selection of fundamental problems, the course equips students with the ability to generalize this application and thus tackle the study of more advanced approaches not covered in the program.