Week 1: What is Computational Thinking?

BSCS1001 — IIT Madras BS Degree Prerequisite: None (this is your first topic!) Cross-links: BSCS1002-Python (Week 1), BSCS2002-PDSA (Week 1)

1. Motivation: Why Computational Thinking?

• Find the highest score
• Calculate the class average
• Count how many students scored above 80 You could do this manually, but it would take hours and you might make mistakes. Now imagine you could describe the steps so precisely that a computer (which has no common sense) could do it for you in milliseconds. Computational Thinking is exactly this — the art of taking a real-world problem and breaking it down into such precise, step-by-step instructions that a machine can execute them.

Real-World Analogy: A Cooking Recipe

Key Insight: Computational thinking is not about computers — it is about thinking in a structured, methodical way. Computers just happen to be very good at executing such structured thinking.

2. What is Computational Thinking?

Formal Definition

Note for absolute beginners: Don't worry if these four pillars seem abstract. By Week 4, every one of them will feel natural. This course focuses mainly on Algorithm Design (the last pillar).

Course Context

1. Procedural approach — describing solutions as sequences of steps
2. Pattern identification — recognizing that many problems share the same solution structure
3. Data representation — choosing the right way to store information
4. Algorithm analysis — understanding which solutions are faster

3. Patterns in Problem Solving

Example: The "Find the Best" Pattern

Example: The "Count Things" Pattern

💡 Takeaway: Once you learn one pattern, you can reuse it everywhere. This is the superpower of computational thinking.

4. Datasets: The Raw Material

Dataset Examples from the Course

How We Visualize Datasets

• Pile 1: Cards we haven't looked at yet (the "unseen" pile)
• Pile 2: Cards we have already processed (the "seen" pile) We pick cards one by one from Pile 1, process them, and move them to Pile 2.

pseudo
Pile 1 (Unseen)     →  Pick a card  →  Process it  →  Pile 2 (Seen)
   [Card A]
   [Card B]          ──►  Pick Card B  ──►  Read data  ──►  [Card B]
   [Card C]

Why this analogy? Computers don't have "piles" — they have memory. But the pile analogy perfectly captures the idea of sequential processing: one item at a time, in order.

5. Iteration: The Most Powerful Pattern

The Iterator Pattern

The Four Steps of Every Iterator

Worked Example 1: Counting Cards

🔍 Notice: Every time we go through the loop, Count increases by exactly 1. The process stops when Pile 1 is empty.

Worked Example 2: Sum of Marks

6. Variables: Keeping Track

Key Properties of Variables

The Assignment Statement

pseudo
Sum = 0          ← "Store the value 0 in the variable named Sum"
Sum = Sum + 85   ← "Take the current value of Sum, add 85, store the result back in Sum"

⚠️ Common Pitfall: Beginners often confuse assignment with equality. In pseudocode, = always means assignment. To check equality, we use == (two equals signs).

Common Variable Roles

7. Filtering: Selecting What Matters

The Filtering Pattern

sql
Initialize variables
while (Pile 1 has more cards) {
    Pick a card X from Pile 1
    Move X to Pile 2
    if (condition is true) {
        Update variables with X's data
    }
}

Worked Example: Sum of Boys' Maths Marks Only

Types of Filtering Conditions

8. Flowcharts: Visualizing Algorithms

Standard Flowchart Symbols

Flowchart for Counting Cards

Flowchart for Sum with Filtering (Boys' Marks)

Advantages and Disadvantages of Flowcharts

Why flowcharts first? Before we write pseudocode (Week 2), flowcharts help you see the logic. Once you understand the picture, translating to text is much easier.

9. Putting It All Together

Complete Example: Finding the Maximum Mark

The Big Picture: How Week 1 Concepts Fit Together

10. Practice Questions

Basic Questions

pseudo
Count = 0
Count = Count + 1
Count = Count + 2
Count = Count + 3

Show Answer

Answer: 6 Q2. Trace the following algorithm for dataset [10, 20, 30, 40]:

sql
Sum = 0
while (Pile 1 has more cards) {
    Pick a card X from Pile 1
    Move X to Pile 2
    if (X > 25) {
        Sum = Sum + X
    }
}

Show Answer

Answer: 70 Q3. Identify the four steps of every iterator pattern. Show Answer

1. Initialization — set starting values
2. Continue or Exit — check if there's more data
3. Repeat Step — pick and process one item
4. Go Back — return to step 2 Q4. What is the difference between = in mathematics and = in computational thinking? Show Answer

In mathematics, = states equality (a truth). In computational thinking, = means assignment (an instruction). x = x + 1 is impossible in math but normal in CT — it means "increase x by 1."

Intermediate Questions

Show Answer

Diagram

(Diagram) Q6. Trace the counting algorithm for 6 cards. Show the state of Count and both piles at each step. Show Answer

Show Answer

sql
Sum = 0
while (Pile 1 has more cards) {
    Pick a card X from Pile 1
    Move X to Pile 2
    if (X is even) {
        Sum = Sum + X
    }
}
Return Sum

Where "X is even" means X % 2 == 0 (X divided by 2 leaves remainder 0).

Advanced Questions

Show Answer

If Max = 0 and all marks are negative (e.g., [-5, -10, -3]), the algorithm would incorrectly return 0 instead of the actual maximum (-3).

Better initialization: Set Max to the first card's value. Or set it to -INFINITY (a very large negative number) so any real value will be larger.

Alternatively, we can initialize Max = -1 and MaxCard = -1 (invalid card ID), and only update when we see a valid card. Q9. Compare and contrast: constant filtering condition vs. variable filtering condition. Give an example of each. Show Answer

Show Answer

The pile analogy is used because it's intuitive — you can visualize physically picking up cards one by one. It represents sequential access memory where data items are processed one after another in order. This is how computers typically read data from storage or iterate through collections.

The two-pile system (Pile 1 = unseen, Pile 2 = seen) ensures we process each item exactly once, which is the foundation of all iterative algorithms.

📚 Cross-References

Next Topic: 02 — Data Types & Representation

Quiz Tip: Practice tracing iteration by hand — it's the most common question type in Quiz 1! Join Discord NextData Types & Representation