Which of the following is a collection of different data type elements?

Related MCQs

• A linear collection of data elements where the linear node is given by means of pointer is called?
• Which of the following data structure store the homogeneous data elements?
• The following data structure allows deleting data elements from front and inserting at rear
• The following data structure can’t store the non-homogeneous data elements
• The following data structure store the ho- mogeneous data elements
• Which data structure allows deleting data elements from front and inserting at rear?
• _______ arrays are where the elements in the different arrays with the same subscript belongs to the same record.
• To represent hierarchical relationship be- tween elements, the following data structure is not suitable
• consider the function f defined here: struct item { int data; struct item * next; }; int f (struct item *p) { return((p==NULL) ||((p->next==NULL)||(p->data<=p->next->data) && (p->next))); } For a given linked list p, the function f returns 1 if and only if
• The data type created by the data abstraction process is called