阿摩線上測驗
登入
首頁
>
研究所、轉學考(插大)-資料結構
>
104年 - 104 淡江大學 轉學考 資料結構#52975
>
題組內容
1.Among the data structures below, heaps, hashmaps, hashtables, stacks, queues, deques, and binary search trees, what is the most appropriate data structure for the following application? Give your explanations.
d. Shortest job first CPU scheduling.
其他申論題
四、名詞解釋:共25分(每小題5分)5,向前整合策略(Forward Integration Strategy )
#192393
a. Counting word frequencies
#192394
b. Checking the matching of tags in HTML
#192395
c. Querying the set of keys which are smaller than a given key
#192396
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
c. A hashtable is the fastest data structure with 0(1) access time. When is it not applicable?
#192400
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