I have a timed questions that need answers for the following topics.
1) Binary, Binary Search, and AVL Trees – definitions, properties, and operations (simulations, implementations, and big-O complexities) of Trees, BST and AVL Trees, Tree traversals (simulations).
2) Heaps – Definitions, properties, and operations (simulations, implementations (build(), add(), remove()) and big-O complexities) of the heap.
3) Hashtables and Maps – Properties and operations (simulations, implementations, and big-O complexities) of Map ADT.
4) Graphs– Definitions, graph representations, graph traversal algorithms, Dijkstra’s algorithm (simulations, implementations, and big-O complexities)
The Types of questions: Multiple choice question answers, tree/array drawing, shortcode writing, fill in the blanks with correct data structures, short question answers.
Questions will be sent in bulk, please send after each question is completed. You do not have to work on the questions in order.
0 comments