104年 - 104 淡江大學轉學考資料結構#52975

科目：研究所、轉學考(插大)-資料結構 | 年份：104年 | 選擇題數：0 | 申論題數：14

試卷資訊

所屬科目：研究所、轉學考(插大)-資料結構

選擇題 (0)

申論題 (14)

a. Counting word frequencies

b. Checking the matching of tags in HTML

c. Querying the set of keys which are smaller than a given key

d. Shortest job first CPU scheduling.

a. What is a stable sorting algorithm?

b. Radix sort is the fastest sorting algorithm with O(n) time complexity. Why is it not often used?

c. A hashtable is the fastest data structure with 0(1) access time. When is it not applicable?

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?

a. What are the conditions for testing if the list has exactly 1 and 2 data nodes respectively?

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.)

21，15,36, 44, 10,4,9，13,29, 25. a. What is the content of the array for the min-heap?

b. If a removal-of-minimum operation is performed, what is the new content of the array?

a. What is the height of the binary search tree?

b. What is the output key sequence when doing a postorder traversal of the binary search tree? (Hint: The height of a tree is the number of nodes on the longest path from the root to a leaf.)