0% found this document useful (0 votes)
3 views6 pages

More Mcqs Data Structure and Algorithms [Set 3]

The document contains a series of multiple-choice questions related to Data Structures and Algorithms (DSA), covering topics such as arrays, graphs, sorting algorithms, hashing methods, and their complexities. Each question is followed by four answer options, with the correct answer indicated. The content serves as a study guide or quiz for individuals learning about DSA concepts.

Uploaded by

mmaimsalim95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views6 pages

More Mcqs Data Structure and Algorithms [Set 3]

The document contains a series of multiple-choice questions related to Data Structures and Algorithms (DSA), covering topics such as arrays, graphs, sorting algorithms, hashing methods, and their complexities. Each question is followed by four answer options, with the correct answer indicated. The content serves as a study guide or quiz for individuals learning about DSA concepts.

Uploaded by

mmaimsalim95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Data Structure and Algorithms (DSA)

3 of 14 sets

101. how many vlue can held by an array A(-1…m,1…m)?


A. m
B. m^2
C. m(m+1)
D. m(m+2)
Answer:D

102. let x be the adjacency matrix of a graph .G with no self loop.The entries along
the principle diagonal of x are
A. all "0"
o m
B. all "1"
. c
C. both 0&1
te
D. different
a
Answer:A
q M
c
M
103. _______ refers to the operation of finding the location of a given item in a
collection of items.
A. sorting
B. searching
C. function
D. complexity
Answer:B

104. _______ is a field whose values uniquely determine the records in the file.
A. pointer
B. primary key
C. secondary key
D. function
Answer:B

105. By using which of the following methods sorting is not possible?


A. insertion
B. exchange
C. selection
D. deletion
Answer:D

106. Which is the simplest file structure?


A. sequential
B. indexed
C. random
D. bubble
Answer:A

107. A ______ is a data structure use foe a storage of a records.


A. tree
B. hash table
C. stack
D. graph
Answer:B

108. _________ is a search for data that uses an index to locate the item.
A. binary search
B. sequential search
C. indexed search
D. jump search
Answer:C

109. If the input array is unsorted, then only a linear ______ can be used.
A. binary search
B. sequential search
C. indexed search
D. jump search
Answer:B

110. _______ is a attribute of a sort, indicating that data with equal keys maintain
their relative input order in the output.

View all MCQ's at McqMate.com


A. sort order
B. sort stability
C. sort efficiency
D. collision
Answer:B

111. In ______ method of hashing, selected digit are extracted from the key and
used as the address.
A. subtraction
B. digit extraction
C. rotation
D. folding
Answer:B

112. ________ hashing method is used in combination with other methods.


A. subtraction
B. digit extraction
C. rotation
D. division
Answer:C

113. If two different keys yield the same hash address, it is called _______ .
A. binary search
B. sequential search
C. collision
D. rotation
Answer:C

114. The ______ sort algorithm is called diminishing increment sort.


A. merge
B. radix
C. shell
D. selection
Answer:C

View all MCQ's at McqMate.com


115. A ______ merge sort uses a constant number of input merge files and the same
number of output merge files.
A. k-way
B. balanced
C. polyphase
D. radix
Answer:B

116. ________ method of collision resolution involves maintaining two tables in


memory.
A. linear probing
B. chaining
C. quadratic probing
D. double hashing
Answer:B

117. _______ is a merge sort that sorts a data stream using repeated merges.
A. balanced
B. polyphase
C. radix
D. k-way
Answer:D

118. One of the statement is false


A. tree is an abstract data type
B. array is a linear data structure
C. typedef is derived data type
D. float is built in data type
Answer:C

119. Examples of sorting algorithms are


A. bubble sort
B. selection sort
C. insertion sort
D. (a),(b),and ©

View all MCQ's at McqMate.com


Answer:D

120. Give timing complexities of three sorting algorithms bubble sort,selection


sort,insertion sort respectively.
A. 0(log n), 0(log n), o(log n)
B. o(n2), o(n2), o(n2)
C. o(n2), o(n log n), o(n log n)
D. o(n log n), o(n2), o(n log n)
Answer:B

121. _____passes are required to sort n data using bubble sort.


A. n
B. n-1
C. n+2
D. n-2
Answer:B

122. Best and the worst case timing complexities of insertion sort are_________.
A. o(n2), o(n2)
B. o(n log n), o(n2)
C. o(n), o(n2)
D. o(n), o(n3)
Answer:C

123. Which sorting algorithm can exploit the partially sorted data in a list?
A. bubble sort
B. selection sort
C. insertion sort
D. all of them
Answer:C

124. Sorting is useful for_________


A. report genration
B. minimizing the storage needed
C. making searching easier and efficient
D. responding to queries easily

View all MCQ's at McqMate.com


Answer:C

125. The getch() library function returns___


A. a character when any key is pressed
B. a character when enter is pressed
C. displays a character on the screen when any key is pressed
D. none of these
Answer:A

View all MCQ's at McqMate.com

You might also like