Hardware | Software | Internet | OS | Communication | Software Development | Safety and Protection | IT Industry | Computer Technology |

Computer Knowledge Home -> Computer Technology-> database technology >> Jiji Ji! ! ! Find data structure answers to all the points I gave up!

Jiji Ji! ! ! Find data structure answers to all the points I gave up!

Users questions: Kaoshiyangti one choice: (10) 1 single linked list is a linear form ________ storage structure. A. Random Access Sequential Access B. C. indexed access (2) stack and queue in common is ________. A. is B. are FIFO LIFO are only allowed C. Xu at the endpoints without inserting and removing elements in common 3 D. Let s = 'HEISAWORKER', t = 'WORKER'. The index (s, t, 5) the return value is ________. A.4B.5C.6D.9E.104. String is a special Linear form, its specificity is reflected in the ________. A. You can order the data storage element is a character B. C. D. can link data elements can be stored more than 5 characters. Tree best suited for that _________. A. B. disorderly orderly data elements data elements C. Element The relationship between the branch-level data D. The data elements not associated between 6.4 vertex complete graph with undirected edges __________. A.6B.12C.16D.207. Hash table loading factor is larger, the potential for conflict on the _________. A . The greater the smaller the B. 8 C. uncertainty in the length n of binary search a sorted list of elements in the average search length is ______. AO (n2) BO (nlogn) CO (n) DO (logn) 9. ,________ The following method is stable row Sequencing method. A. B. Hill Sort Heap Sort Quick Sort D. C. binary insertion sort 10. ________ Obtain a binary search tree ordered sequence of keywords. B. A. in preorder traversal traversal traversal D. C. after traversing two sequences, to determine: (10 points) 1. Linear form along Sequence storage structure is better than chain store structure. () 2. Empty string and the string is the same space. () 3. Graph structure, each node of the precursor and follow-up can have any number. () 4. Quick sort algorithm to sort the data in order to be the most detrimental to its strengths. () 5. Network connectivity, minimum spanning tree is Only. () 6. FIFO stack is a linear form. () 7. By the binary tree inorder and postorder tree traversal sequence is not uniquely determined binary tree. () 8. If you never start to graph a vertex can be visited for breadth-first traversal of all vertices to the graph, the graph must be a connected graph. () 9. Fold Binary Search method requires keyword lookup table must be ordered table, but there is no limit on the storage structure. () 10. In a non-empty binary tree in order traversal sequence, only the right side of the root node of the tree all of its right child nodes. () Third, fill in the blank: (10 points) 1. A binary tree of the first i (i 1 ) Layer up to ________ nodes; one has n (n> 0) nodes of a total of ________ a full binary tree leaf nodes. 2. For with n vertices, e edges undirected connected graph, minimum spanning tree using Prim's algorithm constructs the time complexity _______ _______, Construct the minimum spanning tree using Kruskal's algorithm time complexity is ______________. 3. Degree at least k complete binary tree nodes ________, ________ nodes at most. 4. Five important characteristics of the algorithm is : The finite nature of ,________, feasibility, input and ________. 5. String s = 'IAMASTUDENT', then the string length is ________. 6. In a directed graph, all vertices into the vertex degrees and all degrees and out of ________ Times. Fourth, the short answer: (30 points) 1 will be shown below the forest into a binary tree and marked on the sequence in all of its clues. (6 points) 2. Known as shown on the right of the directed graph, write the map (1) adjacency matrix (2) adjacent to Table 3) ordered sequence of all possible topologies. (10 points) 3. Based hash function Number of H (key) = keyMOD7, conflict resolution method with a chain address. The sequence of keywords} {13,28,72,5,16,8,7,9,11,29 0-8 in the address space for the area to build the hash hash table, draw the table, and find other Find the probability of successful cases, the average check Find the length. (10 points) 4. The following sequence is to determine whether the heap, if not, adjust it to the heap (which requires the least number of record exchange), to write the adjusted series. (4 points) 1) {5,26,20,60,80,35,53,70} 2) {26,33,35,29,1 9,12,22} five, set to take the lead node of the single list of data elements increasing order. Design algorithm will insert into the list at the appropriate x position, and still keep the table ordered. (10) Sixth, write a recursive algorithm to calculate the binary list stored in the number of binary tree nodes. (10) seven, graph-based strategies to write a depth-first traversal algorithm to determine the adjacency list is stored in an undirected graph the number of connected components. (10)
Experts answer:1.A2.A3.C4.C5.C9.B10.B
  • This information provided by the users.Thanks!
Trade Company Database Computer Question United States Company Directorys MotorbikesTip
Computer Knowledge Copyright 2005-2015 All Rights Reserved.