Question
a.
Linear data structure
b.
Non-primitive data structure
c.
Primitive data structure
d.
None of these
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. If elements of the data structure forms a sequence of list then it is called as ____________.
Similar Questions
Discover Related MCQs
Q. Data Structure in which one predecessor may have one or more successor , that data structure is called as __________.
View solution
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
View solution
Q. Which of the following abstract data types can be used to represent a many to many relation?
View solution
Q. When divisions of decimals are involved in a program, these numbers are stored in
View solution
Q. In line '300 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, "***" is classified as
View solution
Q. In line '200 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, NAME$ is classified as
View solution
Q. When there are range of numbers involved in a program, it can be stored as
View solution
Q. When data is input in numeric form, data type in program is classified as
View solution
Q. In command "110 DIM num(10)" in BASIC language, '110' declares
View solution
Q. If element in array has two subscripts, then array is
View solution
Q. In line '400 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, AVERAGE is considered as
View solution
Q. In line '500 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, Total Mark and N are considered as
View solution
Q. Rate at which cost of algorithm grows as size of its input grows is called its
View solution
Q. Critical resource for a program is most often its
View solution
Q. A growth rate of n, is referred to as
View solution
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
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
