Attempt HistoryAttemptTimeScoreLATESTAttempt 147 minutes30 out of 30!Correct answers will be available on Oct 15 at 12:01am.Score for this quiz: 30 out of 30Submitted Oct 12 at 8:01pmThis attempt took 47 minutes.Question 12 ptsWhat is a hash table?A structure that maps values to keysA structure that maps keys to valuesA structure used for storageA structure used to implement stack and queue Question 22 ptsIf several elements are competing for the same bucket in the hashtable, what is it called?DiffusionReplicationCollisionDuplicationQuestion 32 ptsWhat is direct addressing?ODistinct array position for every possible keyFewer array positions than keysFewer keys than array positionsSame array position for all keys Question 42 ptsWhat is the search complexity in direct addressing?O(n)O(logn)O(nlogn)OO(1Question 52 ptsIn simple chaining, what data structure is appropriate?Singly linked listDoubly linked listCircular linked listBinary trees Question 62 ptsWhat is simple uniform hashing?CEvery element has equal probability of hashing into anyof the slotsA weighted probabilistic method is used to hashelements into the slotsElements has Random probability of hashing into arrayslotsElements are hashed based on priorityQuestion 72 ptsWhat is the load factor?Average array sizeAverage key sizeAverage chain lengthAverage hash table length Question 82 ptsWhat is the hash function used in the division method?h(k) = k/mh(k) = k mod mh(k) = m/kh(k) = m mod kQuestion 92 ptsWhat is the hash function used in multiplication method?h(k)=floor(m(kA mod 1))h(k)=ceil( m(kA mod 1))h(k) = 1 floor(kA mod m)h(k) = ceil( kAmod m) Question 102 ptsUsing division method, in a given hash table of size 157, the key ofvalue 172 be placed at position19721517Question 112 ptsWhat is the table size when the value of p is 7 in multiplicationmethod of creating hash functions?1412849127 Question 122 ptsThe task of generating alternative indices for a node is called?Collision handlingCollision detectionCollision recoveryClosed hashingQuestion 132 ptsWhich of the following is not a collision resolution technique?Separate chainingLinear probingQuadratic probingHashing Question 142 ptsWhat should be the load factor for separate chaining hashing?0.511.52Question 152 ptsWhat is the worst case search time of a hashing using separatechaining algorithm?O(N log N)O(N)O(N2)O(N3)