9 Organization of records in files means? a) logical arrangement c) Both A & b) physical arrangement d) None of the above 6 The basic operations that can be performed on a) create c retrieve tie b) update dAll of the above 61 in Relative file organization where each record occuples 20 bytes and the base address of the ile is 100 then, then the address of the Sth record can be given as a) 100 c 200 b) 105 di none 6 A file can be organized as a) sequential e index sequential b) relative 63 11) In a hash table, an element with key k is stored at index a) k b) log k 64 The process of examining memory locations in a hash table is called a) Hashing b) Collisiorn 65 which searching can be done in constant time a) linear search b) binary search c) hashing 66 what is a Hash Table a) Data structure b) searching algorithm b) A function c) sorting algorithm 67 | A Hash function produces b) unique set of strings a) unique set of integers cl binary bits 68 Collision occurs when the hash function maps a) two same keys to same location c) two different keys to different location b) two different keys to same location dj two same keys to ditferent location 69 One of the most popular method of resolving colision is a) Quick sorting search b) Collision resolution by open addressing dl None 70 Collision Open addressing technique can be implemented using a binary search c double hashing b) Inear probing d) both b and c 71 In which sorting, consecutive adjacent pairs of clements in the array are compared with each other? b) Selection sort d) None a) Bubble sot 72 In the worst case, a binary search tree will take how much time to search an element? ajo(n) b) Ojlog n)