阿摩線上測驗
登入
首頁
>
研究所、轉學考(插大)-資料結構
>
104年 - 104 淡江大學 轉學考 資料結構#52975
>
題組內容
2.(20%) Answer the following questions:
c. A hashtable is the fastest data structure with 0(1) access time. When is it not applicable?
其他申論題
c. Querying the set of keys which are smaller than a given key
#192396
d. Shortest job first CPU scheduling.
#192397
a. What is a stable sorting algorithm?
#192398
b. Radix sort is the fastest sorting algorithm with O(n) time complexity. Why is it not often used?
#192399
d. Consider a stack based on a singly linked list with each node pointing to its next node. For this stack, why must the data enter and exit the list from the head instead of the tail?
#192401
a. What are the conditions for testing if the list has exactly 1 and 2 data nodes respectively?
#192402
b. What are the steps in sequence for adding a node new_node to the head of the list? (Hint: The condition for an empty list is header . next == trailer or trailer .prev == header.)
#192403
21，15,36, 44, 10,4,9，13,29, 25. a. What is the content of the array for the min-heap?
#192404
b. If a removal-of-minimum operation is performed, what is the new content of the array?
#192405
a. What is the height of the binary search tree?
#192406
阿摩線上測驗
登入
阿摩線上測驗
登入