1/23/2024 0 Comments Estructura de dato![]() 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
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |