##### 1) Elements can be retrieved by index in …………….?

- linked lists
- linear arrays
- both of above
- none of above

Answer: B

##### 2) Efficiency of an algorithm is measured by

- Time and Capacity complexity
- Time and Space complexity
- Speed and Space complexity
- Speed and Capacity complexity

Answer: B

##### 3) Which sorting algorithm is the slowest algorithm for large number of data?

- Quick sort
- Heap sort
- Bubble sort
- Shell sort

Answer:C

Explanation:Quick sort, Heap sort and Shell sort all have best case time complexity as O(nlogn) and Bubble sort has time complexity of O(n2).

So, Bubble sort is slowest.

Explanation:Quick sort, Heap sort and Shell sort all have best case time complexity as O(nlogn) and Bubble sort has time complexity of O(n2).

So, Bubble sort is slowest.

##### 4) Retrieval operation is fastest in which data structure

- Heap
- Stack
- Linked list
- None

Answer:A

##### 5) State True or False about array and linked list

I. Retrieval of element will be faster in array than link list?

II. Search operation in both array and link list are leaner.

- True, False
- False, True
- False, False
- True, True

Answer:D

Pages: 1 2