Data Sturctures

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.

 a) Bubble Sort  b) Insertion Sort  c) Selection Sort d) Quick Sort 

 a) 6  b) 7  c) 5  d) 8

a) Diffusion  b) Replication  c) Collision  d) None of these

a) 66  b) 15 c) 39  d) 33

a) insertion sort.  b) selection sort.  c) heap sort.  d) quick sort.

a) Binary Search b) Linear Search  c) Tree Search  d) Hashing 

a) heap and selection sort  b) insertion sort & merge sort c) merge sort and heap sort  d) None of these

 a) Merkle tree b) T -tree c) Hash table d) Bx-tree

a) Dynamic Programming  b) Backtracking  c) Greedy method  d) Divide and Conquer

a) in digital currency b) in sorting of large data c) for indexing in databases d) in encryption of data