MCQ
Single Best Answer
Moderate
Q
[Data Structure]
__________ is called a Self-Referential Data Structure.
__________ is called a Self-Referential Data Structure.
ID: #24953
Competency focused Practice Questions ISC Class XII Computer Science
4 views
Question Info
#24953Q ID
ModerateDifficulty
Competency focused Practice Questions ISC Class XII Computer ScienceTopic
Your Answer
Choose the Best Option
Click any option to instantly check if you're correct.
Correct Answer: Option C
Explanation
[Data Structure]
__________ is called a Self-Referential Data Structure.
__________ is called a Self-Referential Data Structure.
Correct Answer: (c) Linked List
Explanation:
A Self-Referential Data Structure is a structure in which one part of the structure contains a reference or pointer to another object of the same type.
Linked List as Self-Referential Structure:
In a Linked List, each node contains:
- Data part
- Address (reference) of the next node
class Node
{
int data;
Node next;
}
Here:
- data stores the value
- next stores the reference of another Node object
Since the structure refers to another object of the same type
(Node), it is called:
Self-Referential Data Structure
Visual Representation:
[10 | • ] → [20 | • ] → [30 | NULL]
Each node points to another node of the same structure.
Why Other Options are Incorrect?
| Option | Reason |
|---|---|
| Stack | Stack is a linear data structure based on LIFO principle, not specifically self-referential. |
| Circular queue | Circular queue follows circular arrangement, but not based on self-referential nodes. |
| Deque | Double ended queue allows insertion/deletion from both ends, but is not itself a self-referential structure. |
Important Concept:
Linked List → Self-Referential Data Structure
Conclusion:
Since each node in a linked list stores the reference of another node of the same type, the correct answer is:
(c) Linked List
Continue Practice
Share
Share This Question
Challenge a friend or share with your study group.
More from This Topic