GATE CS 2014 Set 3 — Question 13

Multiple choice 1 mark Question 13 2014

Question 13

MCQ 1 marks · −0.33 Discrete Mathematics

If \(G\) is a forest with \(n\) vertices and \(k\) connected components, how many edges does \(G\) have?

A \(\lfloor n/k \rfloor\) B \(\lceil n/k \rceil\) C \(n-k\) D \(n-k+1\)

Answers and explanations are free — they just need an account.

GATE CS — Computer Science & IT 2014 Discrete Mathematics

Source: GATE 2014 Computer Science and Information Technology, Set 3 (question number approximate)