GATEverse Practice, past papers & mock tests
GATE 2025 · CS1 - Forenoon
Engineering MathematicsCombinatoricsmediumNAT1 mark
Let S be the set of all ternary strings defined over the alphabet {a,b,c}. Consider all strings in S that contain at least one occurrence of two consecutive symbols, that is, "aa", "bb" or "cc". The number of such strings of length 5 that are possible is _______. (Answer in integer)
Save your progress

Related Engineering Mathematics PYQs