[理工] [DS] Sort 和 Hashing 的考古題問題
1.In the _______ collision resolution method, both the prime area and the
overflow area are store area.(A)open addressing (B)linked list
(C)bucket hashing (D)A and A
2.In the _______ hashing method, select digits are extracted from the key and
used as address (A)direct (B)division remainder (C)modulo division (D)digit
extraction
3.For _____ SORT,n-1 passes are needed to sort the data (A)selection (B)bubble
(C)insertion (D)quick
4.For _____ SORT,two loops are needed (A)selection (B)bubble (C)insertion
(D)quick
我是寫BDBA........有強者會嗎 Orz
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 125.227.161.15
推
02/11 16:19, , 1F
02/11 16:19, 1F
→
02/11 16:22, , 2F
02/11 16:22, 2F
→
02/11 16:23, , 3F
02/11 16:23, 3F
→
02/11 16:24, , 4F
02/11 16:24, 4F
※ 編輯: ezpeer 來自: 125.227.161.15 (02/11 17:58)