a) Sorting b) Radix sort c) Bucket sort d) Bubble sort

 a) Non-linear sort b) List c) Bucket sort d) Set

 a) Simple algorithm which require the order of n2  comparisons to sort n items. b) Sophisticated algorithm that require the O(n log 2n) comparisons to sort items c) Both of the above d) None of the above

a) Heap sort b) Bubble sort c) Linear sort d) Radix-sort

a) Heap b) Stack c) Queue d) Buffer area

a) O(n) b) O(n2) c) O(n log n) d) O(log n)

a) Processor and memory b) Complexity and capacity c) Time and space d) Data and space

a) Divide and conquer  b) Partition  c) Marking  d) None

a) 11 b) 14  c) 13  d) 12

a) binary trees  b) binary search trees  c) heaps  d) binary heaps

a) Bubble sort  b) Insertion sort  c) Quick sort  d) None of the above

a) There must be mechanism to delete and/or insert elements in list  b) the list must be sorted  c) there should be the direct access to the middle element in any sublist  d) none of the above 

a) Item is somewhere in the middle of the array b) Item is not in the array at all  c) Item is the last element in the array  d) Item is the last element in the array or is not there …
Read more →

a) Quadratic time  b) Constant time  c) Logarithmic time  d) Linear time

 a) pre-order. b) in-order. c) post order.  d) not possible.

a) Order of the elements of the list.  b) Length of the list.  c) Maximum value in list.  d) Type of elements of the list.