Discussion forum for Computational Thinking

Hi, Both have explained correctly. You can refer their explanations. Regards, Deepak IITM Online

The first while loop calculates the value of B using the procedure AddWord. Sum of letter count of

Hi Ram, Whatever Yogendra has explained is correct. You can go through his explanation. If you still

Thank you for the clarification. On Wed, Nov 18, 2020 at 3:28 PM Computational Thinking Support 2

Hi, Whatever Aniruddan has explained is correct. I want to add something in that. In flowchart, Found

Hi, Number of comparisons can be done by computer in one sec = 10^8 Number of pairwise comparisons

Hi, Yes, the answer should be No because the given block of representation is not a pseudocode it is

Hi, Number of comparisons can be done by computer per second = 10^8 Number of pairwise comparisons of

Hi, I think it is pretty straight like Sachivi has done. You need to just divide 190 by 10. You will

Hi, Continuation of previous mail. For getting return vale as True, M and N should be same. Regards,

understood. thank you On Friday, 13 November 2020 at 11:29:01 UTC+5:30 ct-su...@onlinedegree.iitm.ac.

Pardon Sir. Thank you for the clarification. On Thu, Nov 12, 2020 at 7:34 PM Computational Thinking

what is the difference between iteration and nested loop On Thursday, 12 November 2020 at 04:33:57

Hello Team, Yes I understood. Thank you Team On Thursday, November 12, 2020 at 5:26:59 PM UTC+5:30 ct

Can you please help me to solve question number 3 and 4 in assignment 3 activity 3.

Continuation of previous post. So the two nested iterations (while 1 and while 2) are enough to find

Hi, Conceptually you are correct but in the question it is asked to make the least number of

Thank you for the clarification. On Wed, 11 Nov 2020, 17:15 Computational Thinking Support 2, <ct-

Thanks a lot. On Wed, 11 Nov 2020, 11:28 am Computational Thinking Support 2 <ct-support2@

Hi Nandni, Can you try to solve the above question while using the attached procedure which is taken

Hi Deepak, Total no. of comparisons = 10^6*(10^6-1)/2 ~ 0.5*10^12 Time needed ~ (0.5*10^12)/10^8 ~

Thank you for your response. On Tue, 10 Nov 2020 at 15:41, Computational Thinking Support 2 <ct-

Hi, In Q3. you are asked to find the percentage of the high frequency words confirm the hypothesis

Hi, Whatever Anand explained is correct but before that you need to think like that for which case of

but sir it is mentioned that we need least number of comparisons which could be 0 ie, we can have 20

Thanks On Tuesday, 10 November 2020 at 11:04:28 UTC+5:30 anandd...@gmail.com wrote: Suppose 100, 90,

Here in this question our main aim to find whether the output from these two code-blocks are same or

Hi, You should think like this, when will the procedure Mystery return True? It will return True when

Hi, Whatever the explanation given by Anand is correct. Good job Anand! Mudit, if you still have

Thank you, I will do that. On Mon, 9 Nov 2020, 15:09 Computational Thinking Support 2, <ct-