Question 1
The DFS (Depth First Search) tree of a graph starting with vertex A is shown below. Choose the option which might be the original graph.
Question 1: The DFS (Depth First Search) tree of a graph starting wit…
Show answer
Correct answer
Question 1 of 24 in the IIT Madras BS Mathematics for Data Science I (Maths 1) End Term paper sat on 28 Apr 2024, in the January 2024 term (IIT M FOUNDATION DIPLOMA AN EXAM QDF3 28 Apr 2024). It carries 4 marks.
More questions from this paper
- Which of the following are valid topological orderings of the given DAG ?
- Suppose A = {a, b, c, d} and B = {p, q, r, s} are two sets. Consider the following relations on A \times B. R_1 = {(a, …
- Figure question
- What is the minimum number of colours required to colour the graph given below?
- Figure question
- Find the angle between the stairs and the wall (in degrees).
- A person is climbing stairs and he stops at a point P on the stairs after reaching two third of the total distance of s…
- Based on the above data, answer the given subquestions.
- Note:Enter your answer correctly to two decimal places.
- Determine the minimum number of edges the graph G can have.
- Determine the maximum number of edges the graph G can have.
- Based on the above data, answer the given subquestions.
- Based on the above data, answer the given subquestions.
- Based on the above data, answer the given subquestions.
- Based on the above data, answer the given subquestions.
- Answer the given sub-questions.
- Answer the given sub-questions.
- Answer the given sub-questions.
- Answer the given sub-questions.
- Based on the above data, answer the given subquestions.
- Based on the above data, answer the given subquestions.
- Consider the following adjacency matrix \begin{array}{cc} & \begin{array}{ccccc} A & B & C & D & E \end{array} \ \begin…
- Consider the following adjacency matrix \begin{array}{cc} & \begin{array}{ccccc} A & B & C & D & E \end{array} \ \begin…