data structures & algorithms set 2 Detailed Explanation And More Example

Question : 1

The complexity of the average case of an algorithm 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 of the above

Question : 2

The complexity of Bubble sort algorithm is

a) O(n)

b) O (n ₂ )

c) O(n log n)

d) None of the above

Question : 3

The Worst case occur in linear search algorithm when

a) Item is not in the array at all

b) Item is the last element in the array

c) Item is the last element in the array or is not there at all

d) None of above

Question : 4

The term “push” and “pop” is related to the

a) Array

b) Lists

c) stacks

d) all of above

Question : 5

Arrays are best data structures for

a) relatively permanent collections of data

b) the size of the structure and the data in the structure are constantly changing

c) both of above situation

d) none of above situation

Question : 6

Which of the following data structures are indexed structures

a) linear arrays

b) linked lists

c) both of above

d) none of above