Home / Engineering / Data Structure (DS) MCQs / Page 30

Data Structure (DS) MCQs | Page - 30

Dear candidates you will find MCQ questions of Data Structure (DS) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.17K Points
Coach

Q. 291) The topological sorting of any DAG can be done in time.

(A) cubic
(B) quadratic
(C) linear
(D) logarithmic
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 292) If there are more than 1 topological sorting of a DAG is possible, which of the following is true.

(A) Many Hamiltonian paths are possible
(B) No Hamiltonian path is possible
(C) Exactly 1 Hamiltonian path is possible
(D) Given information is insufficient to comment anything
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 293) Which of the given statement is true?

(A) All the Cyclic Directed Graphs have topological sortings
(B) All the Acyclic Directed Graphs have topological sortings
(C) All Directed Graphs have topological sortings
(D) All the cyclic directed graphs have non topological sortings
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 294) In the following scenarios, when will you use selection sort?

(A) The input is already sorted
(B) A large file has to be sorted
(C) Large values need to be sorted with small keys
(D) Small values need to be sorted with large keys
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 295) What is the worst case complexity of selection sort?

(A) O(nlogn)
(B) O(logn)
(C) O(n)
(D) O(n2)
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 296) What is the advantage of selection sort over other sorting techniques?

(A) It requires no additional storage space
(B) It is scalable
(C) It works best for inputs which are already sorted
(D) It is faster than any other sorting technique
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 297) What is the average case complexity of selection sort?

(A) O(nlogn)
(B) O(logn)
(C) O(n)
(D) O(n2)
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 298) What is the disadvantage of selection sort?

(A) It requires auxiliary memory
(B) It is not scalable
(C) It can be used for small keys8
(D) It takes linear time to sort the elements
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 299) The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,

(A) 5 and 4
(B) 4 and 5
(C) 2 and 4
(D) 2 and 5
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 300) The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,

(A) 5 and 4
(B) 1 and 4
(C) 0 and 4
(D) 4 and 1
View Answer Discuss Share

Explore Sets

Data Structure (DS) MCQs Set 1

Data Structure (DS) MCQs Set 2

Data Structure (DS) MCQs Set 3

Data Structure (DS) MCQs Set 4

Data Structure (DS) MCQs Set 5

Data Structure (DS) MCQs Set 6

Data Structure (DS) MCQs Set 7

Data Structure (DS) MCQs Set 8

Data Structure (DS) MCQs Set 9

Data Structure (DS) MCQs Set 10

Data Structure (DS) MCQs Set 11

Data Structure (DS) MCQs Set 12

Data Structure (DS) MCQs Set 13

Data Structure (DS) MCQs Set 14

Data Structure (DS) MCQs Set 15

Data Structure (DS) MCQs Set 16

Data Structure (DS) MCQs Set 17

Data Structure (DS) MCQs Set 18

Data Structure (DS) MCQs Set 19

Data Structure (DS) MCQs Set 20

Data Structure (DS) MCQs Set 21

Data Structure (DS) MCQs Set 22

Data Structure (DS) MCQs Set 23

Data Structure (DS) MCQs Set 24

Data Structure (DS) MCQs Set 25

Data Structure (DS) MCQs Set 26

Data Structure (DS) MCQs Set 27

Data Structure (DS) MCQs Set 28

Data Structure (DS) MCQs Set 29

Data Structure (DS) MCQs Set 30

Data Structure (DS) MCQs Set 31

Data Structure (DS) MCQs Set 32

Data Structure (DS) MCQs Set 33

Data Structure (DS) MCQs Set 34

Data Structure (DS) MCQs Set 35

Data Structure (DS) MCQs Set 36

Data Structure (DS) MCQs Set 37

Data Structure (DS) MCQs Set 38

Data Structure (DS) MCQs Set 39

Data Structure (DS) MCQs Set 40

Data Structure (DS) MCQs Set 41

Data Structure (DS) MCQs Set 42

Data Structure (DS) MCQs Set 43

Data Structure (DS) MCQs Set 44

Data Structure (DS) MCQs Set 45

Data Structure (DS) MCQs Set 46

Data Structure (DS) MCQs Set 47

Data Structure (DS) MCQs Set 48

Data Structure (DS) MCQs Set 49

Data Structure (DS) MCQs Set 50

Data Structure (DS) MCQs Set 51

Data Structure (DS) MCQs Set 52

Data Structure (DS) MCQs Set 53

Data Structure (DS) MCQs Set 54