Quiz Space

Mathematics for Data Science I · End Term · 21 Dec 2025 · September 2025 term

Question 2: Suppose we obtain the following BFS tree rooted at node A…

Question 2

+3 marksOne correct option

Suppose we obtain the following BFS tree rooted at node A for an undirected graph with vertices .

Which of the following cannot be an edge in the original graph?

Suppose we obtain the following BFS tree rooted at node A for an undirected graph with vertices  .
  1. A

    (A,D)

  2. B

    (E,C)

  3. C

    (D,G)

  4. D

    (B,F)

Show answer

Correct answer

  • A

    (A,D)

Question 2 of 16 in the IIT Madras BS Mathematics for Data Science I (Maths 1) End Term paper sat on 21 Dec 2025, in the September 2025 term (Maths1 18 Dec 25). It carries 3 marks.

More questions from this paper

  1. Q1Figure question
  2. Q3Which of the following statements is/are true about the function ?
  3. Q4Consider the functions and . Which of the following options is/are true?
  4. Q5Figure question
  5. Q6Consider the adjacency matrix of a graph G: Which of the following option(s) is/are true?
  6. Q7Consider the following directed graph: Which of the following orderings can be a valid topological sort of the graph?
  7. Q8Figure question
  8. Q9If is the domain for the function , then find the value of a + b.
  9. Q10Find for the sequence such that
  10. Q11If the function is continuous for all , then find the value of .
  11. Q12Consider the function on the interval . Approximate the value of using the right hand Riemann sum by taking 3 sub-inter…
  12. Q13Two families have decided to enter into an alliance by marriage. The first family has 4 sons ( and the second family ha…
  13. Q14Use the given information and answer the subquestions : Seven computers { } are linked by a network, and each link has …
  14. Q15Use the given information and answer the subquestions : Seven computers { } are linked by a network, and each link has …
  15. Q16Use the given information and answer the subquestions : Seven computers { } are linked by a network, and each link has …