DATA STRUCTURES

1. 1. Assertion (A) : Application of stack is to reverse a word.

Reason (R) : The ordering principle is LIFO.

• a. A is true and R is correct explanation

• b. A is true and R is not correct explanation

• c. A is false and R is true

• d. A is false and R is also false

2. 2. Assertion(A) : A tree is non - linear data structure.

3. Reason (R) : In non - linear data structure data items are connected to many other data items.

• a. A is true R is false

• b. A is true R is correct explanation

• c. A is false R is correct

• d. Bothe A and R is false

3. 3. (A) : Queue is an ordered collection of items

   (B) : Queue is an example for non - linear data structure

• a. Both A and B are true

• b. A is false and B is true

• c. A is true and B is false

• d. Both A and B are false

4. 4. Assertion (A) : A queue is a FIFO data structure.

5. Reason (R) : Addition and deletion of items takes place at same end.

• a. A is true and R is correct explanation

• b. A is true and R is incorrect explanation

• c. A is true and R is true

• d. A is false and R is false

5. 5. (A) Non primitive data structures are more complex data structures.

6. (R) Non primitive data structures are derived from the user defined data structure

• a. Both A and B are false

• b. A is false and B is treu

• c. A is true and B is false

• d. Both A and B are true

6. 6. (A) : Items of stack are inserted at top end.

7. (B) : Items of queue are inserted from front end.

• a. Both A and B are true

• b. Only A is true

• c. Only B is true

• d. Both A and B are false

7. 7. In one dimensional array if LB = 0 and UB = 10 then the array size is.............

• 12
• -1

• 9
• 11

8. 8. (A) : Array is collection of homogenous elements.

9. (B) : Array is an example for non linear data structure.

• a. Both A and B are true

• b. A is false and B is true

• c. A is true and B is false

• d. Both A and B are false

9. 9. Assertion(A) : A stack is a LIFO data structure

10. Reason (R) : Addition and deletion of items takes place at same end

• a. A is true and R is correct explanation

• b. A is false and R is correct explanation

• c. A is true and R is false

• d. A is false and R is also false

_________ is a prerequisite for the binary search.

• The data must be unsorted
• The data must be in a linked list
• The data must be in ascending order only
• The data must be sorted