Question

THESE ARE TRUE/FALSE

1. The best-time complexity for insertion sort is O(nlogn).

2. The worst-time complexity for bubble sort is O(nlogn).

3. A linked structure consists of nodes. Each node is dynamically created to hold an element. All the nodes are linked together to form a list.

4. The time complexity for searching an element in a binary search tree is O(logn)

5. The time complexity for inserting an element into a binary search tree is O(logn).

6. In an AVL tree, the element just inserted is always at the leaf.

7. Every object has the hashCode() method.

8. If two strings are equal, the two strings have the same hashCodes.

9. 1 << 2 is 4.

10. The separate chaining scheme places all entries with the same hash index into the same location, rather than finding new locations.

Answer 1

1. False, Insertion sort sort one element at a time. Best time complexity measures when the list is already sorted. Best time complexity of insertion sort is O(n)

2. False, Bubble sort swaps adjacent elements to get sorted order. Best time complexity of bubble sort is O(n)

3. True, linked list is a data structure which connects nodes to form a sequence.

4. False, Binary search tree is a binary tree in which left child is less than parent and right child is greater than parent.To search element in binary search tree, we need to traverse the whole tree. Therefore, time complexity is O(h); h is the height of tree.

5. True, AVL Tree is a self balancing tree which has balancing factor of 1, 0, -1. New nodes are inserted at leaf node.

6.True, HashCode function returns hash value of the object in integer value. If two strings are equal , same hash value will be returned.

7.True, Separate chaining is a collision resolution technique which uses linked list. In separate chaining two elements can have same hash value.