More Mcqs Data Structure and Algorithms [Set 3]
More Mcqs Data Structure and Algorithms [Set 3]
3 of 14 sets
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
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.
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
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
117. _______ is a merge sort that sorts a data stream using repeated merges.
A. balanced
B. polyphase
C. radix
D. k-way
Answer:D
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