When the amount of storage data is big, and we need the searching and insertion must be very fast, which kind of data structure we should consider? a. hash table b. binary tree c. array d. linked lists

b. Binary tree

Explanation:

The time complexity of a binary tree is O(log n). As it scales up in size (n), the time taken is only log n. This is because it makes use of divide and conquer to split up the data which makes searching and inserting very simple. However, this only holds if the data is already sorted.

answer: a, c

divide any of the y values by x values and you will always get 3 is the most simple way i can put it for you.

solution:

the right option is a

to adding   a new row to a table we   have to do process last table cell and pressing tab.

this is the process to add new row in the cell:

* to add a row below the cell, click insert below in the rows and columns group.

thus this is the required right answer.