U24AD4201_PDS_Assignment 2

What is a collision in hashing?

• When two keys map to the same hash value

• When a key is not found

• When data is corrupted

• None of the above

What is the primary disadvantage of chaining for collision resolution?

• Increased memory usage

• Slow retrieval times

• Complexity

• None of the above

What is the purpose of a hash function?

• To encrypt data

• To create a unique index for a given key

• To sort data

• None of the above

What is the main use of a hash table in data structures?

• To sort data

• To store elements in a hierarchical order

• To store key-value pairs for fast retrieval

• To compress data

What is an AVL tree?

• A tree which is balanced and is a height balanced tree

• A tree which is unbalanced and is a height balanced tree

• A tree with three children

• A tree with at most 3 children

Why do we need a binary tree which is height balanced?

• To avoid formation of skew trees

• To save memory

• To attain faster memory access

• To simplify storing

The following given tree is an example for?

• Binary tree

• Binary search tree

• Fibonacci tree

• none

To obtain a prefix expression, which of the tree traversals is used?

• Level-order traversal

• Pre-order traversal

• Post-order traversal

• In-order traversal

Which of the following is NOT a characteristic of a good hash function?

• Uniform distribution

• Fast computation

• Easy to invert

• Minimizes collisions

Which data structure supports efficient prefix matching operations (like searching words starting with a given prefix)?

• Heap

• Stack

• Trie

• AVL Tree