資訊推薦

• 31.自 1947 年起，印 巴兩國都脫離英國的控制而獨立，這意味兩個國家自此開始具備哪種國家組成要素？(A)人民 (B)政府 (C)主權 (D)領土。
• 【題組】2.How many times kkk will be called in the function body of kkk(A,0,4)? (A) 1； (B) 2； (C)3； (D)
• 【題組】3.What is the time complexity of this function? (A) O(n)； (B) O(log2n)； (C)O(n2)； (D) O(n3).
• 【題組】4.Let A=[20,80,30,40,10,70,50. After executing kkk(A,0,7), which of the following are true? (A)A
• 【題組】5.Let A=[15,25,35,45,55,65,75,85J. After executing kkk(A,0,8), which of the following are true?
• Question set IlSuppose we have a stack for storing integers. Initially, the stack is empty. We perfo
• 【題組】7.We use the array A as defined above to implement the stack. We want to store the first integer
• 【題組】8.We use the linked-based implementation for the stack. Let the latest input be stored at the lo
• 【題組】9.We use the array A as defined above to implement the stack. After executing the 10 operations
• 【題組】10. We use the linked-based implementation as defined above for the stack. After executing the 1
• Question set IIISuppose we have an array A containing 9 integers (with the first index being 0):   
• 【題組】12. We use Bubble Sort to sort the array in ascending order. What is A[7] after the second pass?
• 【題組】13. We use Quick Sort to sort the array in ascending order. For each partition, let the rightmos
• 【題組】14. We use Quick sort to sort the aray in ascending order. Which of the following are false afte
• 【題組】15. We use Heap Sort to sort the array in ascending order. But first, we have to convert the arr
• Question set IV Let the height of a tree be the number of nodes along the longest path from the root
• 【題組】17. We create binary trees for these integers. What is the maximum height of all the possible tr
• 【題組】18. We create an AVL tree by considering the integers one by one, starting with the first one, 3
• 【題組】19. We create a binary search tree by considering the integers one by one, starting with the fir
• 【題組】20. Based on the binary search tree obtained in Question 19, we delete 99 from the tree. Which o
• Question set V Suppose we have an undirected graph G=(V,E), where V=(a,b,c,d,e,fg,ij and E=([(a,i),
• 【題組】22. We find a spanning tree for the graph using the breadth-first search algorithm, starting wit
• 【題組】23. We find a spanning tree for the graph using the Prim's algorithm, starting with vertex
• 【題組】24. Which of the following are true for the resulting tree obtained in Question 21? (A) The node
• 【題組】25. Which of the following are true for the resulting tree obtained in Question 23? (A) The edge