Which of the following statement is NOT correct about find operation:

It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same answer if and only if they are in the same set.

B. One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set. C.

Initially each set contains one element.

D. Initially each set contains one element and it does not make sense to make a tree of one node only.

Similar Questions

1. A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.

True

False

2. Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure?

Linked List

Stack

Queue

D. Tree

For compiler a postfix expression is easier to evaluate than infix expression?

True

False

Consider the following pseudo code declare a stack of characters

 while ( there are more characters in the word to read ) {
 read a character push the character on the stack 
} while ( the stack is not empty ) {
 pop a character off the stack write the character to the screen
 }

What is written to the screen for the input "apples"?

selpa

B. selppa C.

apples

aaappppplleess

6 Consider the following function:

void test_a(int n) 
{ 
        cout << n << " "; 
        if (n>0) test_a(n-2);
         }

What is printed by the call test_a(4)?

A. 4 2 B.

0 2 4

0 2

2 4

If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

N -1

N+N

N+2

If there are N internal nodes in a binary tree then what will be the no. of external nodes in this binary tree?

A. N -1 B.

N +1

N +2

If we have 1000 sets each containing a single different person. Which of the following relation will be true on each set:

Reflexive

Symmetric

Transitive

Associative

Which one of the following is NOT the property of equivalence relation:

Reflexive

Symmetric

qransitive

Associative

10.

If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______ .

C. Nlog2N D.

log2N

DATA STRUCTURES TOPICS