Quiz Space

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

Computational Thinking (CT) End Term 31 Aug 2025 — Question 5

Question 5

+5 marksOne correct option
Figure from the original question paper
  1. A

    Number of students from the cities with the average total marks of the citygreater than the average total marks of the dataset.

  2. B

    Number of students from the cities with the average total marks of the cityless than the average total marks of the dataset.

  3. C

    Number of cities with the average total marks less than the average totalmarks of the dataset.

  4. D

    Number of cities with the average total marks more than the average totalmarks of the dataset

Show answer

Correct answer

  • B

    Number of students from the cities with the average total marks of the cityless than the average total marks of the dataset.

Question 5 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 : COMPUTATIONAL THINKING (COMPUTER BASED EXAM)" ARE YOU SURE Y…
  2. Q2Figure question
  3. Q3Figure question
  4. Q4Figure question
  5. Q6Figure question
  6. Q7Figure question
  7. Q8Figure question
  8. Q9Figure question
  9. Q10Figure question
  10. Q11Figure question
  11. Q12Figure question
  12. Q13Figure question
  13. Q14Figure question
  14. Q15Figure question
  15. Q16Figure question
  16. Q17Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being …
  17. Q18Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being …
  18. 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. …
  19. Q20Let 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…