MEDIUM
Earn 100
The lenear time complexity is named as linear because its time complexity is of the order of .
50% studentsanswered this correctly
Important Questions on Data Structure
EASY
The big-O value of O(1) is also called ______.
HARD
An algorithm is made up of two independent time complexities and . Then the complexities of the algorithm is in the order of _____.
HARD
What are the two main measures of the efficiency of an algorithm?
HARD
When the efficiency of algorithm determine, then the space factor is measured by _____.
HARD
The Worst case occur in linear search algorithm when _____.
HARD
Which of the following case does not exist in complexity theory?
HARD
The complexity of the average case of an algorithm is _____.
HARD
Which of the following statements is true?
I. As the number of entries in the hash table increases, the number of collisions increases.
II. Recursive programs are efficient.
III The worst time complexity of quick sort is
IV. Binary search using a linked list is efficient.
EASY
The complexity of the average case of an algorithm is _____.
HARD
int i=0;
while(i<5){ //runs 5 times
i++;
}
time complexity of the loop is
MEDIUM
The _________ of the algorithm is the function defined by the average number of steps taken on any instance of size n.
MEDIUM
The general step wise procedure for Big-O runtime analysis :
- Eliminate all excluding the highest order terms.
- Express the maximum number of operations, the algorithm performs in terms of n.
- Figure out what the input is and what n represents.
- Remove all the constant factors.
Correct the Sequence
MEDIUM
If for an algorithm time complexity is given by O(n) then complexityof it is:
MEDIUM
To measure Time complexity of an algorithm Big O notation is used which:
MEDIUM
The complexity of Binary search algorithm is
MEDIUM
To calculate the running time find the maximum number of nested loops that go through a significant portion of the Output.
