[理工] [資結]-是非題
(T) 1.When quadratic probing is used, and the hash table size is a prime,
a new element can always be inserted if the hash table is at least half empty
(F) 2.Hashing techniques can be applied to cases where input keys are string
type.
(T) 3.The adjacency list representation is suitable for dense graph.
(F) 4.There exists topological ordering for cyclic graphs.
(F) 5.Any imbalance caused by an insertion into an AVL tree can always be fixed
by either a single or double rotation.
這幾題沒什麼把握，請問我的答案正確嗎？
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.170.126.179
→
02/23 20:21, , 1F
02/23 20:21, 1F
→
02/23 20:27, , 2F
02/23 20:27, 2F
→
02/23 20:38, , 3F
02/23 20:38, 3F
→
02/23 20:42, , 4F
02/23 20:42, 4F
推
02/23 20:56, , 5F
02/23 20:56, 5F
→
02/23 22:16, , 6F
02/23 22:16, 6F
推
02/23 22:32, , 7F
02/23 22:32, 7F