Answer Happy

Application: You are writing a new programming language compiler and need to store symbols (e.g., method and variable names) with associated information and retrieve them as quickly as possible. You never need to process a list of them. Assume n symbols. Make exactly two selections: the computational model you choose, and the time complexity for the main operations specified: A. Model: Array implementation of Heap for partial order B. Model: Dynamic Set ADT using Hashtable with chaining C. Model: Dynamic Set ADT with Binary Search Tree D. Model: Dynamic Set ADT with Red-Black Tree or Skip List E. Model: Flow network using Edmunds-Karp F. Model: Sorted List maintained with Randomized Quicksort G. Model: Union-Find ADT using forest with rank and path heuristics H. Model: Weighted Graph; Dijkstra's algorithm for shortest paths 1. Time: 0(1 + n/m) where m is an additional parameter you choose J. Time: O(E lg V) since it's connected K. Time: O(V E?) L. Time: O(a(V)), which is for practical purposes O(1) M. Time: O(lg n) for most operations; O(n) for listing contents N. Time: O(n Ig n) expected ООООООО O. Time: O(n) P. Time: O(n) to build it, O(lg n) to extract items