data structure and algorithms

true

false

The complete graph with n vertices has n2 edges. A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 55? 5 3 6 4 A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 45? 3 5 6 4 a What is the size of the full binary tree of height 3? 5 9 14 15 17