- Computer Science Engineering (CSE)
- Data Structure (DS)
- Data structre is divided into _____ part...

Q. |
## Data structre is divided into _____ parts. |

A. | 4 |

B. | 3 |

C. | 2 |

D. | 1 |

Answer» C. 2 |

View all MCQs in:
Data Structure (DS)

- Which data structure allows deleting data elements from and inserting at rear?
- Which of the following data structure can’t store the non-homogeneous data elements?
- A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
- Which of the following data structure is not linear data structure?
- Which data structure allows deleting data elements from front and inserting at rear?
- Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.
- In ___ Data Structure data can be processed one by one sequentially
- Which of the following data structure can’t store the non-homogeneous data elements?
- A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
- Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

Login to Continue

It will take less than 2 minutes

Report MCQ