Fill in the table by selecting all that apply a An element c

Fill in the table by selecting all that apply. a) An element can only be inserted at a special place called the top. b) An element can only be inserted at a special place called the rear. c) An element can be inserted at any specified position. d) An element can only be deleted at the front. e) An element can only be deleted at the top. f) An element can be deleted at any specified position. g) The structure is a LIFO structure. h) The structure is a FIFO structure. i) The structure is supports random access. What is the smallest value of n such that an algorithm whose running time is 100n^2 runs faster than an algorithm whose running time is 2^n on the same machine? Given functions A and B, fill in the table with \"true\" or \"false\" in each table cell. Assume that k > = 1 and c > 1 are constants.

Solution

Stack ;   (a) , (e) , (g)
Queue ; (b) , (d), (h)
List      : (c), (f) , (i)



Using the above points I can infer that (a) , (e) , (g) belongs to Stack , (b) , (d), (h) belongs to Queue and
(c), (f) , (i) belongs to List



Thanks, let me know if there is any concern.