Computational Thinking in the IITM BS Qualifier: How to Approach It

Computational Thinking (CT) in the IITM BS qualifier does not need any programming language. The official course page says it teaches programming ideas through examples that are solved almost entirely by hand. So the skill you need is simple to describe: read a short procedure or flowchart, then trace, step by step, what it does to a small set of data. Practise that by hand every day.

What CT covers in weeks 1 to 4

From the official BSCS1001 course page:

Lists, dictionaries, graphs and recursion come after the qualifier, from week 5.

The one skill to build: tracing by hand

Take a pen and make a small table with one column for each variable. Update it after every step. Do not do it in your head.

Here is a small example of our own. The data has five students and their marks: Asha 62, Ravi 45, Meena 78, John 78, Sara 51.

Max = 0
Name = "none"
for each row X in the table:
    if X.Marks > Max:
        Max = X.Marks
        Name = X.Name

The trace:

The answer is Meena. Now change > to >= and trace again. The answer becomes John, because a tie now replaces the old name. Small changes like this are exactly what you should test yourself on.

AND versus OR (weeks 2 and 3)

Four students, with Maths and English marks: Asha 72 and 55, Ravi 48 and 81, Meena 90 and 67, John 35 and 40.

• Count students with Maths above 60 AND English above 60: only Meena. Count = 1.
• Count students with Maths above 60 OR English above 60: Asha, Ravi and Meena. Count = 3.

AND makes a filter stricter. OR makes it looser. If your count looks too large, check which one you used.

Nested iterations (week 4)

Nested iteration means a loop inside a loop. You need it when you compare items in pairs, for example to check if any two people share a birth month. The birthday paradox, also in week 4, is about whether any two people in a group share a birthday, so it needs this kind of pair check.

Four people are born in March, July, March and December. There are 6 different pairs (4 times 3, divided by 2). Only one pair matches: person 1 and person 3.

A common mistake is to run the inner loop over everyone. Then each person is compared with themselves, and each pair is counted twice. The count comes out as 6 instead of 1. Start the inner loop from the person after the current one.

Binning (week 4)

Binning means sorting values into ranges and counting each range. With the marks 62, 45, 78, 78 and 51 and the bins "below 50", "50 to 69" and "70 and above", the counts are 1, 2 and 2. Always check that the bins do not overlap and that every value falls into one bin.

Common mistakes in CT

• Wrong starting value. Starting Max at 0 fails if the values can be negative. Starting from the first row is safer.
• Forgetting to reset a counter inside a nested loop.
• Mixing up > and >=, which changes how ties are handled.
• Not checking the data first. "Sanity of data" is a week 1 topic for a reason. Look for missing or odd values before you trust a result.
• Side effects. In week 3, a procedure can change a variable outside itself. When tracing, write down every variable a procedure changes, not just what it returns.

How to practise with the official material

• Pause each lecture example before the answer and trace it yourself first.
• Redo the practice assignment on paper a second time, two days later.
• Make your own 6 to 8 row table and write three filters on it: one with AND, one with OR, one finding a maximum.
• Change one line of a procedure and predict the new output before tracing.

Do not look for leaked graded assignment answers. They teach you nothing for the in-person exam and can break academic integrity rules.

For more, see our Computational Thinking course page, CT after the qualifier (weeks 5 to 12), the 4-week qualifier study plan and the qualifier syllabus.

Common questions

Do I need to know Python for the CT part of the qualifier?

No. The course page says the examples are solved almost entirely by hand. Python is a separate foundation course, Programming in Python, which is not one of the four qualifier courses.

Why do so many CT topics work on a collection of data?

Filtering, finding a maximum and binning all go through a collection of items one by one. Practising on a small table of your own lets you see each step clearly, which is the point of solving examples by hand.

How long should one trace take?

For a 5 row table, a careful trace takes a few minutes. Speed comes from practice, not from skipping steps. In the 4-hour exam, a written trace is still faster than guessing and rechecking.

Is CT harder than Maths in the qualifier?

It depends on the person, and there is no official data on this. Your week 1 and week 2 assignment scores will show you quickly which course needs more of your time.