The average time required to perform a successful sequential search for an element in an array A(1 : n) is given by
A. | (n + 1)/2 |
B. | log_{2}n |
C. | n(n + 1)/2 |
D. | n^{2} |
Option: A Explanation : |
Using the standard algorithm, what is the time required to determine that a number n is prime ?
A. | Linear time |
B. | Logarithmic time |
C. | Constant time |
D. | Quadratic time |
Option: A Explanation : |
The average time required to perform a successful sequential search for an element in an array A (1 : n) is given by
A. | (n+1)/2 |
B. | n (n + 1)/2 |
C. | log(n/2) |
D. | n^{2} |
Option: A Explanation : |
Which of the following is false ?
A. | A serial search begins with the first array element |
B. | A serial search continues searching, element by element, either until a match is found or until the end of the array is encountered |
C. | A serial search is useful when the amount of data that must be search is small |
D. | For a serial search to work, the data in the array must be arranged in either alphabetical or numerical order |
Option: D Explanation : |
Syllabus covered in this section is-
This Section covers Data Structures Questions Answers using C language .
Who can benefit -
Various Search Terms used for this section are