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.

## Computer

1. Selection sort and quick sort both fall into the same category of sorting algorithms. What is this category?

Question 1 of 15

2. When is insertion sort a good choice for sorting an array?

Question 2 of 15

3. Suppose 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 3 of 15

4. A cyclic graph has:

Question 4 of 15

5. Which one of the followings is a probabilistic data structure?

Question 5 of 15

6. What is the complexity of Ford-Fulkerson algorithm?

Question 6 of 15

7. Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are now guaranteed to be in their final spot (never to be moved again)?

Question 7 of 15

8. What is the worst-case time for quick sort to sort an array of n elements?

Question 8 of 15

9. A data structure where elements can be added or removed at either end but not in the middle

Question 9 of 15

10. Binary search is applicable to multidimensional arrays.

Question 10 of 15

11. The technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents, especially in purely functional programming languages is known as

Question 11 of 15

12. Which one of the followings is not an abstract type?

Question 12 of 15

13. For a nonempty tree T, if n0 is the number of leaf nodes and n2 the number of nodes of degree 2 then

Question 13 of 15

14. Suppose you have an array of N elements, containing only 2 distinct keys, true and false. Given an O(N) algorithm to sort the array.

Question 14 of 15

15. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

Question 15 of 15

 Test By Subject Computer Science Test By Topics Computer General