阿摩線上測驗
登入
首頁
>
研究所、轉學考(插大)-資料結構
>
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.
a. Counting word frequencies
其他申論題
四、名詞解釋:共25分(每小題5分)2,平衡計分卡(BalancedScorecard) .
#192390
四、名詞解釋:共25分(每小題5分)3.職權接受論(AcceptanceTheory of Authority)
#192391
四、名詞解釋:共25分(每小題5分)4.組織公民行為(Organizational Citizenship Behavior,OCB )
#192392
四、名詞解釋:共25分(每小題5分)5,向前整合策略(Forward Integration Strategy )
#192393
b. Checking the matching of tags in HTML
#192395
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
c. A hashtable is the fastest data structure with 0(1) access time. When is it not applicable?
#192400