Capgemini Pseudo-Code MCQs: 2026 Section Guide

Capgemini’s pseudo-code section tests whether you can trace a short algorithm and predict its output. No knowledge of Python, Java, or any other programming language is required.

The practical problem is that most preparation resources treat this as a coding test. It isn’t. You’re following a fixed notation and tracking variable states through a sequence of instructions, closer to following a set of rules than to writing software. That distinction matters for how you prepare.

What the Pseudo-Code Section Measures

Three specific abilities are being tested:

• Variable state tracking: following the exact value of each declared variable as the algorithm steps forward. The output depends entirely on what the variables hold at the PRINT statement, not on what they held ten lines earlier.
• Control-flow reading: knowing precisely when a loop exits, which branch of an IF/ELSE executes, and in what order nested constructs resolve.
• Output prediction: translating those tracked values and resolved branches into the final printed result.

None of these require memorising syntax, writing code, or debugging. The notation is standardised: DECLARE, IF/THEN/ELSE, WHILE, FOR, MOD, PRINT. You can absorb the full vocabulary in two or three hours of focused reading. Two or three.

There is a secondary benefit most students miss. Algorithm-tracing ability transfers directly to technical interviews, where you are often asked to explain what a given code snippet does (not write new code from scratch). The preparation is the same.

One specific note on the notation: DECLARE announces the variable’s type at the start. If you see DECLARE count AS INTEGER, count starts at whatever value is explicitly assigned in the next line, not at zero by default unless the code says so. This is where one common error category lives.

Section Structure in the 2026 Capgemini Test

The pseudo-code section is one of five components in Capgemini’s online assessment for freshers:

Section	Format	Approximate Time
Pseudo-Code	10-20 MCQs	20 minutes
Quantitative Aptitude	MCQs	25 minutes
Game-Based Aptitude	Interactive puzzles	25 minutes
English Communication	MCQs + short essay	20 minutes
Technical	MCQs	20 minutes

Capgemini does not publish an official per-section breakdown. The figures above come from student-reported timings across recent drives; treat them as planning estimates.

Both the Analyst-track and Senior Analyst-track hiring rounds include the pseudo-code section. The Analyst track is the standard fresher entry point; the Senior Analyst track applies higher cutoffs across all five sections. The CTC bands for each track are listed in the table below.

Track	CTC Band
Analyst	Rs.4.0-4.5 LPA
Senior Analyst	Rs.6.5-7.5 LPA

The implication for preparation: there is no single section to sacrifice. Consistent performance across all five sections matters more than a perfect score on any one.

For the game-based aptitude section and the overall test pattern, the Capgemini logical reasoning and game-based aptitude guide covers the format in detail.

Worked MCQ Examples

Each example below represents one of the main archetypes in the question bank. Trace each algorithm line by line before reading the answer. Speed comes from doing this trace on paper; reading passively does not build the skill.

Example 1: Accumulator Loop

DECLARE i, sum AS INTEGER
sum = 0
i = 1
WHILE i <= 5
  sum = sum + i * i
  i = i + 1
END WHILE
PRINT sum

• Options: A) 15 B) 25 C) 55 D) 225
• Step 1: i=1, sum = 0 + 1 = 1, then i=2
• Step 2: i=2, sum = 1 + 4 = 5, then i=3
• Step 3: i=3, sum = 5 + 9 = 14, then i=4
• Step 4: i=4, sum = 14 + 16 = 30, then i=5
• Step 5: i=5, sum = 30 + 25 = 55, then i=6
• Exit: condition i <= 5 is false when i=6; loop ends
• Answer: C) 55

The trap in this question type is accidentally including i=6 in the loop, which would add 36 and give 91. Count iterations by checking when the exit condition first fails, not when it “almost fails.”

Example 2: Nested Conditionals

DECLARE x AS INTEGER
x = 12
IF x MOD 2 = 0 THEN
  IF x MOD 3 = 0 THEN
    PRINT "DivisibleByBoth"
  ELSE
    PRINT "OnlyEven"
  END IF
ELSE
  PRINT "Odd"
END IF

• Options: A) OnlyEven B) DivisibleByBoth C) Odd D) 0
• Step 1: Evaluate outer condition: 12 MOD 2 = 0; 0 = 0 is true, enter outer IF
• Step 2: Evaluate inner condition: 12 MOD 3 = 0; 0 = 0 is true, enter inner IF
• Step 3: PRINT “DivisibleByBoth”
• Answer: B) DivisibleByBoth

With nested conditionals, evaluate the outer condition first and decide which branch you are in before looking at the inner logic. Students who skip to the inner condition sometimes lose track of which ELSE pairs with which IF.

Example 3: String Traversal

DECLARE str AS STRING
DECLARE count, i AS INTEGER
str = "banana"
count = 0
FOR i = 0 TO LENGTH(str) - 1
  IF str[i] = 'a' THEN
    count = count + 1
  END IF
END FOR
PRINT count

• Options: A) 2 B) 3 C) 4 D) 6
• Setup: LENGTH(“banana”) = 6, so the loop runs from i=0 to i=5
• i=0: str[0]=‘b’, no match
• i=1: str[1]=‘a’, count = 1
• i=2: str[2]=‘n’, no match
• i=3: str[3]=‘a’, count = 2
• i=4: str[4]=‘n’, no match
• i=5: str[5]=‘a’, count = 3
• Answer: B) 3

The typical errors here are choosing D) 6 (the string length) or A) 2 (miscounting the character at index 5). Write out the characters with their indices before starting the trace.

Example 4: Euclidean GCD

DECLARE a, b, temp AS INTEGER
a = 36
b = 24
WHILE b != 0
  temp = b
  b = a MOD b
  a = temp
END WHILE
PRINT a

• Options: A) 4 B) 6 C) 12 D) 24
• Iteration 1: temp=24, b = 36 MOD 24 = 12, a = 24
• Iteration 2: temp=12, b = 24 MOD 12 = 0, a = 12
• Exit: b != 0 is false when b=0; loop ends
• PRINT 12
• Answer: C) 12

Verification: GCD(36, 24) = 12, since 36 = 1 x 24 + 12 and 24 = 2 x 12 + 0. The Euclidean algorithm terminates in as few as 2-3 iterations for the input sizes Capgemini typically uses.

Common Question Patterns and Preparation

The question bank consistently draws from five pattern families:

1. Accumulator loops — running totals (sum, product, sum of squares) over a bounded integer range. Focus on the exact exit condition: i <= n vs. i < n changes the iteration count by one.
2. Modulo conditionals — nested IF/ELSE blocks testing divisibility, even/odd, or digit properties. Evaluate conditions independently and in order; resist the urge to combine them mentally.
3. String traversal — character-by-character iteration using LENGTH and array indexing. Common errors: treating LENGTH as the last valid index instead of length minus one, and confusing the character’s value with its position.
4. Number-theory routines — GCD by Euclidean algorithm, digit sum, digit count, and number-to-binary conversion. All rely on repeated MOD and integer division. The iteration count is small (2-4 steps for typical inputs), so a full trace is always feasible.
5. Array swap and partial sort — the code performs k iterations of a bubble or selection sort, or reverses a segment. You are given the initial array state and asked to identify the state after exactly k iterations, not after the full sort completes.

For each pattern, the method is the same: write out the algorithm on paper with a concrete input, step through it, and verify the final state. There is no category where pattern-memorisation beats direct tracing. Speed comes from repeated practice.

The pseudo-code section does not exist in isolation. Capgemini’s quantitative section runs concurrently, and time pressure on one section affects how much buffer you have on another. The aptitude test preparation guide covers quantitative and verbal strategies alongside broader time-management approaches for multi-section online tests. For students using CoCubes-based practice sets, note that the pseudocode question format is similar enough that cross-platform drilling is worth the time.

Algorithmic Thinking and the AI Hiring Shift

According to a report in the Economic Times, Capgemini India planned to hire up to 45,000 in 2025 with explicit focus on building an AI-ready workforce. In the same period, TechGig reported that the company reduced its headcount by 10,000 through selective hiring concentrated on AI-related roles including generative AI architects. Capgemini also partnered with the Nasscom Foundation to train 700+ youths in AI technical and soft skills.

The practical implication: each Analyst-track offer is now more deliberate than it was three years ago. The pseudo-code section is partly a proxy for the kind of systematic thinking AI-era engineering roles require: reading a deterministic process, predicting its state, and verifying the output.

That trace-and-verify habit extends beyond the Capgemini test. Reading a model’s output and checking whether it did what the prompt specified requires the same structured reasoning as tracing a WHILE loop. You hold a mental model of the intended behaviour and compare it against the actual result. If you want to extend pseudo-code preparation into building with LLMs, TinkerLLM’s Rs.299 entry tier is a self-paced playground for practising that with real API calls. For the full progression from algorithmic thinking to AI application engineering, the 2026 AI roadmap for Indian engineering students maps where pseudo-code prep fits in a 12-month curriculum.