- Computer Science Engineering (CSE)
- Data Structures (DS)
- An edge E is called _________ if it has ...

Q. |
## An edge E is called _________ if it has identical endpoints. |

A. | multiple edges. |

B. | loops. |

C. | finite. |

D. | digraph. |

Answer» B. loops. |

View all MCQs in:
Data Structures (DS)

- In a directed tree any node which has out degree 0 is called a terminal node or__________.
- If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
- What is the best case height of a B-tree of order n and which has k keys?
- For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
- ____________ has certain attributes or properties which may be assigned values.
- An m*n array has _________number of elements.
- The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
- A list that has no nodes is called________.
- A linear collection of data elements where the linear node is given by means of pointer is called?
- Process of inserting an element in stack is called

Login to Continue

It will take less than 2 minutes

Report MCQ