- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures - List
- Elements in an array are accessed

Q. |
## Elements in an array are accessed |

A. | randomly |

B. | sequentially |

C. | exponentially |

D. | logarithmically |

Answer» A. randomly |

View all MCQs in:
Data Structures (DS)

- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
- In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly?
- Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
- Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
- An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
- What is the worst-case time for heap sort to sort an array of n elements?
- The elements of an array are allocated in spaces________.
- Accessing and processing each array elements is called __________.
- An m*n array has _________number of elements.

Login to Continue

It will take less than 2 minutes

Report MCQ