Data structures & Algorithms MCQ Set 2
a. Counting
the maximum memory needed by the algorithm
b. Counting
the minimum memory needed by the algorithm
c.
Counting the average memory needed by the
algorithm
d. Counting
the maximum disk space needed by the algorithm
2. The
complexity of Bubble sort algorithm is
a. O(n)
b. O(log
n)
c.
O(n2)
d. O(n
log n)
3. Linked
lists are best suited
a. for
relatively permanent collections of data
b. for
the size of the structure and the data in the structure are constantly changing
c.
for both of above situation
d. for
none of above situation
4. If
the values of a variable in one module is indirectly changed by another module,
this situation is called
a. internal
change
b. inter-module
change
c.
side effect
d. side-module
update
5. In
linear search algorithm the Worst case occurs when
a. The
item is somewhere in the middle of the array
b. The
item is not in the array at all
c.
The item is the last element in the array
d. The
item is the last element in the array or is not there at all
6. For
an algorithm the complexity of the average case is
a. Much
more complicated to analyze than that of worst case
b. Much
more simpler to analyze than that of worst case
c.
Sometimes more complicated and some other times
simpler than that of worst case
d. None
or above
7. The
complexity of merge sort algorithm is
a. O(n)
b. O(log
n)
c.
O(n2)
d. O(n
log n)
8. The
complexity of linear search algorithm is
a. O(n)
b. O(log
n)
c.
O(n2)
d. O(n
log n
9. When
determining the efficiency of algorithm the time factor is measured by
a. Counting
microseconds
b. Counting
the number of key operations
c.
Counting the number of statements
d. Counting
the kilobytes of algorithm
10. Which
of the following data structure is linear data structure?
a. Trees
b. Graphs
c.
Arrays
d. None
of above
Answers
1.a
2.b
3.b
4.c
5.d
6.a
7.d
8.a
9.b
10.c
0 comments:
Post a Comment