adplus-dvertising
frame-decoration

Question

Non Primitive data Structures are those which define set of _________.

a.

Static Elements

b.

Primitive Elements

c.

Derived Elements

d.

None of these

Answer: (c).Derived Elements

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Non Primitive data Structures are those which define set of _________.

Similar Questions

Discover Related MCQs

Q. If elements of the data structure forms a sequence of list then it is called as ____________.

Q. Data Structure in which one predecessor may have one or more successor , that data structure is called as __________.

Q. An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that model

Q. Which of the following abstract data types can be used to represent a many to many relation?

Q. When divisions of decimals are involved in a program, these numbers are stored in

Q. In line '300 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, "***" is classified as

Q. In line '200 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, NAME$ is classified as

Q. When there are range of numbers involved in a program, it can be stored as

Q. When data is input in numeric form, data type in program is classified as

Q. In command "110 DIM num(10)" in BASIC language, '110' declares

Q. If element in array has two subscripts, then array is

Q. In line '400 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, AVERAGE is considered as

Q. In line '500 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, Total Mark and N are considered as

Q. Rate at which cost of algorithm grows as size of its input grows is called its

Q. Critical resource for a program is most often its

Q. A growth rate of n, is referred to as

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

Q. Efficiency of an algorithm is measured by

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

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