Computer

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

Interchange sorts

O(n log n) sorts

Average time is quadratic

Divide-and-conquer sorts

Question 1 of 15

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

Each component of the array requires a large amount of memory.

Each component of the array requires a small amount of memory.

The processor speed is fast.

The array has only a few items out of place.

Question 2 of 15

3. mark review 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.)

The algorithm might be selection sort, but could not be insertion sort.

The algorithm is neither selection sort nor insertion sort.

The algorithm might be insertion sort, but could not be selection sort.

The algorithm might be either selection sort or insertion sort.

Question 3 of 15

4. mark review A cyclic graph has:

A graph that cycles from vertices to edges

A cycle of two or more nodes

A shape like a unicycle

A cycle of three or more nodes

Question 4 of 15

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

Hash Tree

Bloom filter

Hash Table

Finger Tree

Question 5 of 15

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

None of these

O(E+f) where E is the number of edges in the graph and f is the maximum flow in the graph

O(Ef) where E is the number of edges in the graph and f is the maximum flow in the graph

O(E/f) where E is the number of edges in the graph and f is the maximum flow in the graph

Question 6 of 15

7. mark review 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. mark review What is the worst-case time for quick sort to sort an array of n elements?

O(log n)

O(n)

O(n log n)

O(n^2)

Question 8 of 15

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

Deque

Queues

Linked lists

Stacks

Question 9 of 15

10. mark review Binary search is applicable to multidimensional arrays.

None of these

False

2K-1

True

Question 10 of 15

11. mark review 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

Jump List

None of these

V list

Zipper

Question 11 of 15

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

List

Record

Deque

Container

Question 12 of 15

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

n0 = 2n + 1

n0 = n2 + 1

n0 = 2n2 + 1

None of these

Question 13 of 15

14. mark review 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.

Merge sort

Both A and B

Bucket sort with 2 buckets.

None of these

Question 14 of 15

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

EAFKHDCBG

FEAKDCHBG

FAEKCDBHG

FAEKCDHGB

Question 15 of 15

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.

Test By Subject	Computer Science
Test By Topics	Computer General

Test Advisor

Data Structure Test 3 Online MCQs

Data Structure Test 3 Online MCQs

Computer

Leave a Reply Cancel reply