adplus-dvertising
frame-decoration

Question

Which of the following data structure can’t store the non-homogeneous data elements?

a.

Arrays

b.

Records

c.

Pointers

d.

Stacks

Answer: (a).Arrays

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following data structure can’t store the non-homogeneous data elements?

Similar Questions

Discover Related MCQs

Q. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….

Q. Arrays are best data structures

Q. Which of the following statement is false?

Q. A …………………… does not keep track of address of every element in the list.

Q. Each array declaration need not give, implicitly or explicitly, the information about

Q. The elements of an array are stored successively in memory cells because

Q. The memory address of the first element of an array is called

Q. The memory address of fifth element of an array can be calculated by the formula

Q. Two dimensional arrays are also called

Q. A variable P is called pointer if

Q. What is right way to Initialize array?

Q. An array elements are always stored in ________ memory locations.

Q. Size of the array need not be specified, when

Q. What does the following declaration mean?

int (*ptr)[10];

Q. Array passed as an argument to a function is interpreted as

Q. Which of the following correctly accesses the seventh element stored in arr, an array with 100 elements?

Q. The smallest element of an array’s index is called its

Q. If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 bytes then the array has been stored in _________ order.

Q. An adjacency matrix representation of a graph cannot contain information of :

Q. The extra key inserted at the end of the array is called a,