List are___ they can grow on shrink required by the application. (As both static and dynamic e algorithms

(a) Both static and dynamic

(b) Static

(c) Algorithms

(d), dynamic

Push and pop are not associated with____ data structure

(a) Tree

(b) Queue

(c) Graph

(d) Stack

The following list represents an- ordered list of number of lines of codes in functions of a program,

{13, 16, 17,110,118, 167, 18D, 187, 199}

If Linear Search is used when searching for 118 which value in the list visited before 118 is found?

(a) 13, 199, 17, 16,

(b) 13, 16, 17,199

(c) 13, 16, 17,110

(d) 167, 16, 17,110