CS 301 Quiz # 2

1) Which of the following possible operations are performed on Table ADT

1. Only Insert and Find
2. Insert. Find, Remove
3. Only Insert and Remove
4. Only Find and Remove

2) A binary relation R over S is called an equivalence relation if it has following property(s)

1. Reflexivity
2. Symmetry
3. Transitivity
4. All of the given options

3) Binary Search can be categorized into which of the following>

1. Divide and conquer
2. Dynamic programming
3. Greedy algorithm
4. Brute Force technique

4) In which of the following tree, parent nodes have key greater than or equal to its both children>

1. Max heap
2. Binary search tree
3. Threaded Binary tree
4. Complete Binary tree

5) In Complete binary tree the bottom level is filled from _______.

1. Left to right
2. Right to left
3. Not filled at all
4. None of the given options

6) If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a _________

1. Complete Binary tree
2. Threaded Binary tree
3. Expression tree
4. Perfectly compete Binary tree

7) In a threaded binary tree, which nodes have NULL child pointer,

1. Nodes other then leaf nodes
2. Root Node
3. None of the nodes
4. All leaf nodes

8) Suppose a hash function returns 6 for the given value. At which index of array the value will be saved

1. 5
2. 7
3. 0
4. 6

9) In 1990, Bill Pugh purposed an enhancement on linked lists and the new data structure was termed as

1. Skip list
2. Fixed list
3. Tree list
4. Enhanced linked list

10) Suppose there are 100 elements in an equivalence class, so initially there will be 100 trees. The collection of these trees is called __________.

1. Forest
2. Class
3. Cluster
4. Bunch