Computer Data Structure Test 1 Online MCQs With Answers
Home / Tests / Data Structure Test 1 Online MCQs

Data Structure Test 1 Online MCQs

Test Name Data Structure Test 1
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 1 Online MCQs


1. mark reviewThe complexity of Bubble sort algorithm is

Question 1 of 15

2. mark reviewTwo main measures for the efficiency of an algorithm are

Question 2 of 15

3. mark reviewThe complexity of linear search algorithm is

Question 3 of 15

4. mark reviewWhich data structure allows deleting data elements from front and inserting at rear?

Question 4 of 15

5. mark reviewIdentify the data structure which allows deletions at both ends of the list but insertion at only one end.

Question 5 of 15

6. mark reviewThe operation of processing each element in the list is known as

Question 6 of 15

7. mark reviewWhich of the following data structure is not linear data structure?

Question 7 of 15

8. mark reviewFinding the location of the element with a given value is:

Question 8 of 15

9. mark reviewWhich of the following data structure is non-linear type?

Question 9 of 15

10. mark reviewWhich of the following sorting algorithms has average-case and worst-case running time of O (n log n)?

Question 10 of 15

11. mark reviewA binary tree whose every node has either zero or two children is called

Question 11 of 15

12. mark reviewWhich of the following case does not exist in complexity theory?

Question 12 of 15

13. mark reviewThe space factor when determining the efficiency of algorithm is measured by

Question 13 of 15

14. mark reviewThe indirect change of the values of a variable in one module by another module is called

Question 14 of 15

15. mark reviewArrays are best data structures

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 *