The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Also checkout these categories
Machine Input MCQ Phylum - Mollusca MCQ Machine Input Mi-set 2 MCQ Problems on Trains MCQ Genetics MCQ Plants Physiology MCQ Cause & Effect MCQ Workshop Technology MCQ Machine Input MI - set 1 MCQ Electric Current MCQ Sexual dysfunctions MCQ Skin Anatomy and Physiology MCQ
- _____ is not the component of data structure.
- Linked lists are best suited
- Which of the following name does not relate to stacks?
- The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
- Linked list are not suitable data structure of which one of the following problems ?
- Which of the following is not the required condition for binary search algorithm?
- Which of the following data structure is non linear type?
- Merge sort uses ?
- Which of the following data structure store the homogeneous data elements?
- The complexity of linear search algorithm is
- Which of the following is non-liner data structure?
- Which if the following is/are the levels of implementation of data structure
- The term push and pop is related to the
- Herder node is used as sentinel in ____
- Which of the following statement is false?
- Finding the location of the element with a given value is:
- ______ is very useful in situation when data have to stored and then retrieved in reverse order.
- ……………. Is a pile in which items are added at one end and removed from…
- Which of the following is not the part of ADT description?
- Which of the following statement is true ?
- Binary search algorithm can not be applied to
- For an algorithm the complexity of the average case is
- Which of the following data structure is not linear data structure?
- When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
- The memory address of the first element of an array is called
- Which of the following is not a limitation of binary search algorithm?
- Which of the following data structure cant store the non-homogeneous data elements?
- The operation of processing each element in the list is known as
- Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
- Each array declaration need not give, implicitly or explicitly, the information about