McqMate

Q. |
## For the given graph(G), which of the following statements is true? |

A. | G is a complete graph |

B. | G is not a connected graph |

C. | The vertex connectivity of the graph is 2 |

D. | none |

Answer» C. The vertex connectivity of the graph is 2 |

1.7k

0

Do you find this helpful?

11

View all MCQs in

Data Structures (DS)No comments yet

- 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?
- 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?
- Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
- Which of the given statement is true?
- Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
- 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?
- How many of the following statements are correct?
- Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
- Which of the following is true?