Hashing Techniques MCQ (Multiple Choice Questions) PDF - 22

MCQ 106: The hashing technique which allows increase or decrease in number of buckets without a need of directory is classified as

1. global depth hashing
2. linear hashing
3. relative hashing
4. local depth hashing

MCQ 107: According to enhanced-entity relationships, the association between super class and subclass is as

1. super class is subset of subclass
2. subclass is subset of super class
3. subclass is partial joint of super class
4. super class is partial joint of subclass

MCQ 108: In linear hashing, the formula used to calculate number of records if the blocking factor, loading factor and file buckets are known is as

1. r =l + bfr + N
2. r =l - bfr - N
3. r =l + bfr - N
4. r =l * bfr * N

MCQ 109: In the data model schemas, the constraints that are can not be expressed directly are classified as

1. application based constraints
2. semantic constraints
3. business rules
4. all of above

MCQ 110: The form of dependency in which the set of attributes that are neither a subset of any of the keys nor the candidate key is classified as

1. transitive dependency
2. full functional dependency
3. partial dependency
4. prime functional dependency