Data structure which is capable of expressing more complex relationship than that of physical adjacency is called______________.

Related MCQs

• A list which displays the relationship of adjacency between elements is said to be
• What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
• Which of the following data structure is not linear data structure?
• Which of the following data structure is linear data structure?
• Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
• To represent hierarchical relationship between elements, Which data structure is suitable?
• To represent hierarchical relationship between elements, which data structure is suitable?
• A tree is a data structure which represents hierarchical relationship between individual _________.
• To represent hierarchical relationship between elements, which data structure is suitable?
• Which of following data structure is more appropriate for implementing quick sort iteratively?