I (20 poEnts) Fill in the Blank Questious. All answes are integers a. (4 pts) yertices must have Adjacency Matrix. A 2D array

I (20 poEnts) Fill in the Blank Questious. All answes are integers a. (4 pts) yertices must have Adjacency Matrix. A 2D array representing ia directed weiplted grnph of 40 cells Given a binary min hcap of 66 elenents, inserting a vluc that is snaller thnn swap operatious b. (4 pts) the value of the current root will reqaires C. (4 pts) If the heieht of a tree is defined as the largest number of edgen between its root and a leaf, the largest height of an AVL tree after 17 insertions is A dynamic array that hns an initial capacity of 2 and doubles its size every times after d. (4 pts) time when the array is full will expand its capacity 921 insertions a hash function f(z) = (r +5)%10. After inserting 3, 23, 14 to this table, then 13 is inserted. The address of 13 is Given an open-addressing hash table of size 10 with quadratic probing and (4 pts) e.



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *