McqMate

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

A. | nodes. |

B. | fields. |

C. | data. |

D. | edges. |

Answer» D. edges. |

2.1k

0

Do you find this helpful?

1

View all MCQs in

Data Structures (DS)No comments yet

- 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?
- A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
- Any node is the path from the root to the node is called
- ____________ 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?