Question

True or False?

1. Duplicate hash codes create collisions.

2. In open addressing with linear probing, a successful search for an entry that corresponds to a given search key could potentially follow a different probe sequence used to add the entry to the hash table.

3. Completely balance binary trees are not necessarily full.

4. A preorder traversal of a binary tree is an example of a depth-first traversal.

Answer 1

Question 1
Duplicate hash codes create collisions.
Ans: True

We can say that whenever two different records or maybe objects share the same hash code, then it will create a collision. In the same way Duplicate hash code which are nothing but 2 objects when having the same hash code creates a collision.

Question 2:
In open addressing with linear probing, a successful search for an entry that corresponds to a given search key could potentially follow a different probe sequence used to add the entry to the hash table.
Ans: False

It is not true that in open addressing with linear probing, whenever a successful search for an entry that corresponds to a given search key could potentially follow a different probe sequence, it may not even follow the probe sequence.

Question 3:
Completely balance binary trees are not necessarily full.
Ans: False

Complete binary trees are the binary trees in which all these levels need to be filled completely excluding the last level. whereas completely balanced binary trees are binary trees in which it follows the following property that a number of nodes in the left subtree must be almost equal to the right subtree. Therefore completely balanced binary trees are necessarily fulled

Question 4:
The preorder traversal of a binary tree is an example of a depth-first traversal.
Ans: True

In the Depth-first traversal, you will visit all the nodes from the root node and moving as far as possible from the root, without first visiting the siblings node. We can see this case in preorder traversal, Thus we can say that preorder traversal of a binary tree is an example of a depth-first traversal.

(Feel free to drop me a comment, If you need any help)

Hope this Helps!!!
Please upvote as well, If you got the answer?
If not please comment, I will Help you with that...