Quiz Space

Computational Thinking · End Term · 31 Aug 2025 · May 2025 term · Set 2

Question 20: Let M be an adjacency matrix of a graph G given below, w…

Question 20

+5 marksOne correct option

Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. ListV represents the list of vertices of the graph G.

Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. ListV represents the list of vertices of the graph G.

Based on the above data, answer the given subquestions.

Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. L
Figure from the original question paper
  1. A

    3

  2. B

    5

  3. C

    6

  4. D

    9

Show answer

Correct answer

  • C

    6

See the whole paperTake it as a mock test

Question 20 of 25 in the IIT Madras BS Computational Thinking (Computational Thinking (CT)) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M IMPROVEMENT AN EXAM QIB4 31 Aug). It carries 5 marks.

More questions from this paper

  1. Q1THIS IS QUESTION PAPER FOR THE SUBJECT "FOUNDATION LEVEL : SEMESTER I: COMPUTATIONAL THINKING (COMPUTER BASED EXAM)" AR…
  2. Q2Figure question
  3. Q3Figure question
  4. Q4Figure question
  5. Q5Figure question
  6. Q6Figure question
  7. Q7Figure question
  8. Q8Figure question
  9. Q9Figure question
  10. Q10Figure question
  11. Q11Figure question
  12. Q12Figure question
  13. Q13Figure question
  14. Q14Figure question
  15. Q15Figure question
  16. Q16Figure question
  17. Q17Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being …
  18. Q18Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being …
  19. Q19Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. …
  20. Q21Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integ…
  21. Q22Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integ…
  22. Q23Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being …
  23. Q24Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. …
  24. Q25Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integ…