Computer Data Structure Test 2 Online MCQs With Answers
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. mark reviewWhich of the following sorting algorithm is of divide-and-conquer type?

Question 1 of 15

2. mark reviewA binary tree can easily be converted into a 2-tree

Question 2 of 15

3. mark reviewWhich of the following statement is false?

Question 3 of 15

4. mark reviewWhen converting binary tree into extended binary tree, all the original nodes in binary tree are

Question 4 of 15

5. mark reviewA variable P is called pointer if

Question 5 of 15

6. mark reviewIf every node u in G is adjacent to every other node v in G, A graph is said to be

Question 6 of 15

7. mark reviewWhich of the following is not the required condition for binary search algorithm?

Question 7 of 15

8. mark reviewWhich of the following is two way list?

Question 8 of 15

9. mark reviewThe inorder traversal o9f tree will yield a sorted listing of elements of tree in

Question 9 of 15

10. mark reviewThe term “push” and “pop” is related to the

Question 10 of 15

11. mark reviewWhen new data are to be inserted into a data structure, but there is usually called

Question 11 of 15

12. mark reviewBinary search algorithm cannot be applied to

Question 12 of 15

13. mark reviewIn a Heap tree

Question 13 of 15

14. mark reviewThe difference between linear array and a record is

Question 14 of 15

15. mark reviewWhich of the following name does not relate to stacks?

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 *