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

Data Structure Test 3 Online MCQs

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

Computer

1. mark reviewA cyclic graph has:

Question 1 of 15

2. mark reviewIn a selection sort of n elements, how many times is the swap function called in the complete execution of the algorithm?

Question 2 of 15

3. mark reviewThe property of hash function is that

Question 3 of 15

4. mark reviewWhat is the worst-case time for heap sort to sort an array of n elements?

Question 4 of 15

5. mark reviewWhat is the worst-case time for quick sort to sort an array of n elements?

Question 5 of 15

6. mark reviewMerge sort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?

Question 6 of 15

7. mark reviewWhat is the worst-cast time for merge sort to sort an array of n elements?

Question 7 of 15

8. mark reviewSelection sort and quick sort both fall into the same category of sorting algorithms. What is this category?

Question 8 of 15

9. mark reviewBinary search tree is a

Question 9 of 15

10. mark reviewWhen is insertion sort a good choice for sorting an array?

Question 10 of 15

11. mark reviewSuppose we are sorting an array of eight integers using a some quadratic sorting algorithm. After four iterations of the algorithm’s main loop, the array elements are ordered as shown here:
2 4 5 7 8 1 3 6
Which statement is correct? (Note: Our selection sort picks largest items first.)

Question 11 of 15

12. mark reviewA(n) ________ graph is a graph in which each vertex has a connection to every other vertex.

Question 12 of 15

13. mark reviewSuppose we are sorting an array of eight integers using quick sort, and we have just finished the3 first partitioning with the array looking like this:
2 5 1 7 9 12 11 10
Which statement is correct?

Question 13 of 15

14. mark reviewA(n) ________ is a graph in which each connection has two directions.

Question 14 of 15

15. mark reviewSuppose we are sorting an array of ten integers using a some quadratic sorting algorithm. After four iterations of the algorithm’s main loop, the array elements are ordered as shown here: 1 2 3 4 5 0 6 7 8 9
Which statement is correct? (Note: Our selection sort picks largest items first.)

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 *