- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Consider the array {1,1,1,1,1}. Select t...

Q. |
## Consider the array {1,1,1,1,1}. Select the wrong option? |

A. | iterative linear search can be used to search for the elements in the given array |

B. | recursive linear search can be used to search for the elements in the given array |

C. | recursive binary search can be used to search for the elements in the given array |

D. | no method is defined to search for an element in the given array |

Answer» D. no method is defined to search for an element in the given array | |

Explanation: iterative linear search, recursive linear search and recursive binary search can be applied to search for an element in the above given array. |

View all MCQs in:
Design and Analysis of Algorithms

- For a given array, there can be multiple ways to reach the end of the array using minimum number of jumps.
- For any array, given that at most one element is non-zero, it is ALWAYS possible to reach the end of the array using minimum jumps.
- Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?
- Which of the following option is wrong?
- Which of the following takes O(n) time in worst case in array implementation of stack?
- Which of the following methods can be used to find the largest and smallest element in an array?
- What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?
- Which of the following techniques can be used to search an element in an unsorted array?
- How many sub arrays does the quick sort algorithm divide the entire array into?
- What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?

Login to Continue

It will take less than 2 minutes

Report MCQ