[理工] [資結]演算法及資料結構配合題

[copnew (newcop)]

請跟選項配對

1. The maze problem that needs to keep track of the path visited.

2. The database query optimizer that needs to the index of the location
   of words in memories.

3. The dictionary look-up function that needs the index of words.

4. The process scheduler of operating systems that needs to dispatch
   process in the order of arrival time.

5. A network routing protocol in which the routing algorithm must select a
   shortest path from source nodes to destination nodes.

6. A calculator that must deal with the operator precedence and parenthesis

7. The database system that is used in a hospital in which the data of
   patients accessed will be accessed again frequently.

以下是選項:
a.)Stack; b.)Queue; c.)Splay Tree; d.)Lexicographic search tree
e.)AVL-Tree; f.)B-Tree; g.) Red-Black Tree; h.) Kruskal's algorithm
i.)Dijkstra's algorithm ; i.) Topological sorting

請版上的高手幫忙，謝謝


--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 124.8.17.18
推 polomoss:1.stack
→ polomoss:4.queue
→ polomoss:5.dijkstra
→ polomoss:6.stack
推 nickboy0211:3.Lexicographic search tree
推 FRAXIS:2應該是f b-tree
→ FRAXIS:7應該是splay tree
推 polomoss:2 3 7我都不會耶~可以解釋WHY嗎
→ copnew:多謝!