Data structures & Algorithms MCQ Set 1
1. The
elements of an array are stored successively in memory cells because
a. by
this way computer can keep track only the address of the first element and the
addresses of other elements can be calculated
b. the
architecture of computer memory does not allow arrays to store other than
serially
c.
both of above
d. none
of above
2. Which
of the following data structure is not linear data structure?
a. Arrays
b. Linked
lists
c.
Both of above
d. None
of above
3. The
Average case occur in linear search algorithm
a. When
Item is somewhere in the middle of the array
b. When
Item is not in the array at all
c.
When Item is the last element in the array
d. When
Item is the last element in the array or is not there at all
4. Two
main measures for the efficiency of an algorithm are
a. Processor
and memory
b. Complexity
and capacity
c.
Time and space
d. Data
and space
5. Finding
the location of the element with a given value is:
a. Traversal
b. Search
c.
Sort
d. None
of above
6. Which
of the following case does not exist in complexity theory
a. Best
case
b. Worst
case
c.
Average case
d. Null
case
7. The
operation of processing each element in the list is known as
a. Sorting
b. Merging
c.
Inserting
d. Traversal
8. Arrays
are best data structures
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
9. Each
array declaration need not give, implicitly or explicitly, the information
about
a. the
name of array
b. the
data type of array
c.
the first data from the set to be stored
d. the
index set of the array
10. The
complexity of Binary search algorithm is
a. O(n)
b. O(log
)
c.
O(n2)
d. O(n
log n)
Answers
1.a
2.d
3.a
4.c
5.b
6.d
7.d
8.a
9.c
10.b
0 comments:
Post a Comment