Home / Tests / Data Structure Test 2 Online MCQs

Data Structure Test 2 Online MCQs

Test Name Data Structure Test 2
Subject Computer
Test Type MCQs
Total Question 15
Total Marks 30
Total Time 15 Mints
Test Help For
  • Basic Knowledge about IT
  • IT General Knowledge Quiz
  • Computer History
  • IT & Computer Tests
  • General Ability
  • Competitive Exams.

Data Structure Test 2 Online MCQs

Computer

1. Which of the following is not a limitation of binary search algorithm?

Question 1 of 15

2. In a graph if e=[u, v], Then u and v are called

Question 2 of 15

3. Which of the following data structures are indexed structures?

Question 3 of 15

4. Which of the following is two way list?

Question 4 of 15

5. In a Heap tree

Question 5 of 15

6. An algorithm that calls itself directly or indirectly is known as

Question 6 of 15

7. Which of the following statement is false?

Question 7 of 15

8. Which of the following sorting algorithm is of divide-and-conquer type?

Question 8 of 15

9. Two dimensional arrays are also called

Question 9 of 15

10. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called

Question 10 of 15

11. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

Question 11 of 15

12. Which of the following data structure store the homogeneous data elements?

Question 12 of 15

13. In a graph if e=(u, v) means

Question 13 of 15

14. The inorder traversal o9f tree will yield a sorted listing of elements of tree in

Question 14 of 15

15. Which of the following data structure can’t store the non-homogeneous data elements?

Question 15 of 15


 

Test By Subject
Test By Topics
Have any Problem or Error please mention in below comments section.

Leave a Reply

Your email address will not be published. Required fields are marked *