Q. Algorithm that begins with First position in array and looks at each value in turn until it is found is known to be

View solution

Q. Efficiency of an algorithm is measured by

View solution

Q. An algorithm with running-time of a highest-order term containing a factor of n^2 is said to have a

View solution

Q. An analysis that estimates resource consumption of an algorithm is known to be

View solution

Q. Implementation of operations associated with an ADT is done by a

View solution

Q. Data types are of form

View solution

Q. A data structure requires a certain amount of space for each

View solution

Q. ADT stands for

View solution

Q. Defining a data type in terms of an ADT is of form

View solution

Q. An ADT and data related to its implementation together make up a

View solution

Q. A collection of values are known as

View solution

Q. Data types formation can be of

View solution

Q. An ADT doesn't specify implementation of

View solution

Q. For selecting a data structure, approach to be followed is known as

View solution

Q. Implementing a data type as a data structure is of form

View solution

Q. A simple type whose values contain no subparts, is called

View solution

Q. Records can be accessed by unique numbers, that are known to be

View solution

Q. Interface of ADT can be defined in terms of

View solution

Q. Term that makes realization of a data type as a software component is called

View solution

Q. A record is modifiable only when medication does not affect its

View solution