To be aware of the limits of computation: to understand the definitions of the P and NP classes, the concept of Polynomial-Time reduction, the notion of NP-Completeness, and to know some classic NP-complete problemsĭescribe what is a database and a database management systemĮffectively use the standard Structured Query Language (SQL) to query relational databasesĮxplain the relational data model, including its data structures, the relational algebra and integrity constraints To know, understand, explain, analyse and compare some algorithm design techniques: greedy, divide and conquer, and dynamic programming To know, explain, design, analyse, compare and implement the main data structures and algorithms that can be used to represent graphs and solve classic graph problems such as traversals, topological ordering and shortest paths To know, explain, design, analyse, compare and implement the main data structures and algorithms that can be used to implement dictionaries To know, explain, design, analyse, compare and implement the main data structures and algorithms that can be used to implement priority queues To review some simple data structures: stacks, queues, lists, and trees To analyse the cost of iterative and recursive algorithms CE2 - Aplicar los fundamentos de la gestión y procesamiento de datos en un problema de ciencia de datos.CE1 - Desarrollar algoritmos eficientes basados en el conocimiento y comprensión de la teoría de la complejidad computacional y las principales estructuras de datos dentro del ámbito de ciencia de datos. ![]() CG1 - Identificar y aplicar los métodos y procesos de gestión de datos más adecuados para gestionar el ciclo de vida de los datos, incluyendo datos estructurados y no estructurados.CB9 - Que los estudiantes posean las habilidades de aprendizaje que les permitan continuar estudiando de un modo que habrá de ser en gran medida autodirigido o autónomo.Ĭompetencias Técnicas Genéricas Genéricas.CB6 - Que los estudiantes sepan aplicar los conocimientos adquiridos y su capacidad de resolución de problemas en entornos nuevos o poco conocidos dentro de contextos más amplios (o multidisciplinares) relacionados con su área de estudio.CT5 - Conocer una tercera lengua, preferentemente el inglés, con un nivel adecuado oral y escrito y en consonancia con las necesidades que tendrán los titulados y tituladas.CT4 - Gestionar la adquisicion, la estructuracion, el analisis y la visualizacion de datos e informacion en el ambito de la especialidad y valorar de forma critica los resultados de esta gestion.By completing this module, you will be able to implement both these data structures efficiently from scratch.7.11 Competencias Competencias Transversales Uso solvente de los recursos de información We will see again how simple and natural ideas lead to an implementation that is both easy to code and very efficient. We will then switch to disjoint sets data structure that is used, for example, in dynamic graph connectivity and image processing. We will see that these implementations are based on a beautiful idea of storing a complete binary tree in an array that allows to implement all priority queue methods in just few lines of code. For this reason, priority queues have built-in implementations in many programming languages, including C++, Java, and Python. We start this module by considering priority queues which are used to efficiently schedule jobs, either in the context of a computer operating system or in real life, to sort huge files, which is the most important building block for any Big Data processing algorithm, and to efficiently compute shortest paths in graphs, which is a topic we will cover in our next course. You will also learn how services like Dropbox manage to upload some large files instantly and to save a lot of storage space! What are good strategies to keep a binary tree balanced? ![]() How to implement a hash table so that the amortized running time of all operations is O(1) on average?Ĥ. ![]() How priority queues are implemented in C++, Java, and Python?ģ. What is a good strategy of resizing a dynamic array?Ģ. ![]() You will also learn typical use cases for these data structures.Ī few examples of questions that we are going to cover in this class are the following:ġ. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. In this online course, we consider the common data structures that are used in various computational problems. A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |