McqMate

Q. |
## How many of the following statements are correct? |

A. | All cyclic graphs are complete graphs. |

B. | All complete graphs are cyclic graphs. |

C. | All paths are bipartite. |

D. | All cyclic graphs are bipartite. |

Answer» B. All complete graphs are cyclic graphs. |

893

0

Do you find this helpful?

9

View all MCQs in

Data Structures (DS)No comments yet

- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
- Which of the following statements for a simple graph is correct?
- Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
- For the given graph(G), which of the following statements is true?
- 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?
- Which of the following option is not correct?
- Which of the following is a correct way to declare a multidimensional array in Java?
- How many common operations are performed in a binary tree?
- How many types of insertion are performed in a binary tree?
- How many bits would a succinct binary tree occupy?