[理工] 幾題資結請教
是非
(1) If an undirected connected graph G has no bridge edge then G is a strongly
c
請問在無向圖中 只要連通應該都是scc吧
沒有bridge代表 任意一邊刪去後還是有連通吧? 但看不懂題目意思...
(2) A B-tree of order 2 is an A VL tree ..
我知道B tree能變成RB tree,但B tree的order是2的話可以稱之為AVL嗎?沒聽過這種說
法
(3) For static hashing with linear open addressing to be efficient, the loadin
g factor α > 1.0 must hold.
請問這題的α是指loading density嗎
翻筆記發現我只抄半頁而已
也有點看不懂linear open addressing是什麼(猜測是linear probling?)
(4) Which traversal operation is used in tree sort?
(A) Level-order (B) In-order (C) Pre-order (D) Post-order (E) BFS (F) DFS
我是選inorder 想法是在bst裡頭應該
inorder的輸出才是排序資料
不過其他的選項感覺好像能選?
最後想問一題排序
http://i.imgur.com/nccczMz.jpg
我只有選quick sort 其他不知道該不該選
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 223.137.200.66
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1485354623.A.391.html
推
01/25 22:48, , 1F
01/25 22:48, 1F
→
01/25 22:48, , 2F
01/25 22:48, 2F
這樣有滿足AVL吧?(有平衡)
※ 編輯: newpuma (223.137.200.66), 01/25/2017 23:26:07
推
01/25 23:29, , 3F
01/25 23:29, 3F
→
01/25 23:30, , 4F
01/25 23:30, 4F
→
01/25 23:30, , 5F
01/25 23:30, 5F
推
01/25 23:33, , 6F
01/25 23:33, 6F
→
01/25 23:33, , 7F
01/25 23:33, 7F
手機app一直吃字== 補上了 感謝!!
※ 編輯: newpuma (223.137.200.66), 01/25/2017 23:58:16
→
01/26 07:02, , 8F
01/26 07:02, 8F
→
01/26 07:05, , 9F
01/26 07:05, 9F
→
01/26 07:05, , 10F
01/26 07:05, 10F
→
01/26 07:06, , 11F
01/26 07:06, 11F
→
01/26 07:06, , 12F
01/26 07:06, 12F
推
01/26 10:42, , 13F
01/26 10:42, 13F
→
01/26 10:42, , 14F
01/26 10:42, 14F
→
01/26 10:42, , 15F
01/26 10:42, 15F
→
01/26 10:43, , 16F
01/26 10:43, 16F
→
01/26 10:43, , 17F
01/26 10:43, 17F
→
01/26 10:44, , 18F
01/26 10:44, 18F
→
01/26 10:44, , 19F
01/26 10:44, 19F
推
01/26 10:46, , 20F
01/26 10:46, 20F
→
01/26 10:46, , 21F
01/26 10:46, 21F
→
01/26 10:47, , 22F
01/26 10:47, 22F
→
01/26 10:47, , 23F
01/26 10:47, 23F
→
01/26 10:47, , 24F
01/26 10:47, 24F
→
01/26 10:47, , 25F
01/26 10:47, 25F
推
01/26 10:50, , 26F
01/26 10:50, 26F
→
01/26 10:50, , 27F
01/26 10:50, 27F