Questionnaires on Complexity and Data Structures are presented, without internet connection and exercises on the subject are proposed for the student to develop them as additional practice.
The latest version includes a module, which allows the student
Write the reasons why you chose an answer to any question.
Once you have finished answering the questionnaire, the system allows you to see if the answers you chose were correct.
In the questionnaires you will find questions on the following topic:
Temporal equation of an algorithm,
Types of algorithms,
Lists and binary trees,
AVL trees, Rojinegros,
Trees B,
Trees B +
Graphic Schema Theory
(Dijkstra, Prim, Kruskal,
Isomorphism, Traces of graphs,
Floyd, Bipartite graphs, Eccentricity,
Priority Queues, Chromatic Numbers).
Indexes recorded in external memory
Note: If the reader is interested in entering and removing keys, one by one, in the Tree structure (AVL, Rojinegros, Binaries) and then drawing it to study how it changes, they can do so in the recently published Binary Trees application.
The latest version includes a module, which allows the student
Write the reasons why you chose an answer to any question.
Once you have finished answering the questionnaire, the system allows you to see if the answers you chose were correct.
In the questionnaires you will find questions on the following topic:
Temporal equation of an algorithm,
Types of algorithms,
Lists and binary trees,
AVL trees, Rojinegros,
Trees B,
Trees B +
Graphic Schema Theory
(Dijkstra, Prim, Kruskal,
Isomorphism, Traces of graphs,
Floyd, Bipartite graphs, Eccentricity,
Priority Queues, Chromatic Numbers).
Indexes recorded in external memory
Note: If the reader is interested in entering and removing keys, one by one, in the Tree structure (AVL, Rojinegros, Binaries) and then drawing it to study how it changes, they can do so in the recently published Binary Trees application.
Show More
