Data Structures and Algorithms
ISABEL SEGURA BEDMAR
Theorethical hours: 28 hours
Lab hours: 28 hours
Total learning time: 118 hours
In this course, students will study the main data structures (lists, trees and graphs) and their manipulation algorithms. Students will acquire the skills to design and develop the most selected data structures to solve real-life problems and develop quality software. They will also learn to analyze the algorithms from the point of view of temporal and space complexity, to be analyzed to propose the most efficient algorithms. The algorithmic strategies of recursion and divide and conquer will also be studied.
Students will work in aspects of the following competences:
For the theoretical part of the course, slides of studied topics are included as well as recommended readings.
For the exercises part of the course, a number of exercises and the corresponding solutions are included.
For the practical part, the lab assignments are including with the corresponding possible solutions.
PRACTICAL ASSIGMENTS AND ASSESSMENT ACTIVITIES