- Computer Science Engineering (CSE)
- Data Structures (DS)
- The length of the path is the number of_...

Q. |
## The length of the path is the number of_____________ on the path. |

A. | nodes. |

B. | fields. |

C. | data. |

D. | edges. |

Answer» D. edges. |

View all MCQs in:
Data Structures (DS)

- A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
- What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
- The average number of key comparisons done in a successful sequential search in a list of length n is___________.
- The average number of key comparisons done in a successful sequential search in a list of length n is ____________.
- In a full binary tree if number of internal nodes is I, then number of leaves L are?
- In a full binary tree if number of internal nodes is I, then number of nodes N are?
- ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
- Which of the following should be used to sort a huge database on a fixed-length key field?
- Length of linear array can be found by using the formula_________
- In variable length storage two dollar signs are used to signal the __________.

Login to Continue

It will take less than 2 minutes

Report MCQ