- Computer Science Engineering (CSE)
- Data Structures (DS)
- Data structure which is capable of expre...

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

A. | linear data structure. |

B. | linked list. |

C. | non linear data Structure |

D. | data structure. |

Answer» C. non linear data Structure |

View all MCQs in:
Data Structures (DS)

- 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 linear data structure?
- To represent hierarchical relationship between elements, which data structure is suitable?
- A tree is a data structure which represents hierarchical relationship between individual _________.
- Which data structure allows deleting data elements from front and inserting at rear?
- New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
- Which data structure is needed to convert infix notation to postfix notation?
- Which data structure is used for implementing recursion?
- A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
- Which of the following is the most widely used external memory data structure?

Login to Continue

It will take less than 2 minutes

Report MCQ