Summary of "🔥Cognizant Game Based Aptitude One Shot Video | Game Based Aptitude🔥"

Overview

The video explains the types of problems in the Cognizant (and CAPJ‑style) game‑based aptitude test and shows how to solve representative questions.
The game section is adaptive (starts easy and gets harder). There is also a separate traditional aptitude section. Both parts are timed (speaker mentions ~30 minutes for aptitude and ~36 minutes total for game sections; subtitles vary).
Main problem types covered:
- Deductive logical (grid) puzzles
- Inductive logical (pattern recognition / classification)
- Digit/arithmetic challenges
- Motion‑based (obstacle/ball) puzzles
- Figure/shape non‑fit selection
- Order/arrangement (permutation) puzzles
Emphasis: practice is essential; many problems are simple once you know the rule.

Typical format: 4×4 or 5×5 grids containing a fixed set of symbols (square, triangle, plus, circle, star, etc.).
Core rule: every row and every column must contain all required symbols once — no repeats in the same row or column.
Solving method:
- Scan rows and columns to find missing symbol(s) by elimination.
- Use the “no repeat” rule both row‑wise and column‑wise to place forced symbols.
- Work stepwise: fill definite positions first; fewer possibilities remain for others.
UI notes: no penalty for multiple attempts; the correct choice gives a green tick and advances.
Example tip: if a row already has square, triangle and plus, the remaining cell must be the circle.

Problem goal: detect recurring patterns or frequencies and mark tiles/items accordingly.
Example patterns:
- Find the character that occurs exactly five times and color those tiles.
- Distinguish tiles containing only numbers vs. tiles with number + alphabet.
- Identify sequences where the count of symbols changes across positions (e.g., decreases left to right) and spot the outlier.
Solving method:
- Count occurrences or observe structural rules (numbers only vs. number+letter).
- Look for ordering rules (counts increasing/decreasing) and pick the object that violates the rule.

Task: create an expression using the given digits and operations to reach a target number.
Important constraints and rules:
- Use only the given digits (digits typically cannot be repeated).
- Follow order of operations (BODMAS: parentheses, division, multiplication, addition, subtraction).
Solving method:
- Try combinations of multiplication and addition to reach the target (e.g., to get 20: 5×3 + 5 or 6×3 + 2).
- If division is involved, consider fractional intermediates (e.g., 9 ÷ 6 = 1.5, then ×4 = 6).
- Multiple solutions are often possible — any valid solution counts.
Examples shown in the video: produce 20, 30 and 135 using allowed digits and operations.

Goal: move the ball into a hole by rearranging movable obstacles while respecting fixed obstacles; minimize number of moves.
Elements:
- Some obstacles are fixed (cannot be moved).
- Others are movable and should be slid to clear a path for the ball.
Solving method:
- Identify fixed barriers first to determine feasible routes.
- Move movable pieces out of the intended path in the fewest moves.
- Plan a sequence to create an uninterrupted path to the hole; avoid unnecessary moves that add complexity.
UI notes: the interface typically counts the number of moves/attempts.
Tip: visualize the path and clear it by sliding the fewest obstacles; watch a short playthrough to learn movement patterns.

Presentation: rows of objects where exactly one does not follow the rule.
Typical rules:
- Geometric property (e.g., all are rhombi except one square).
- Positional property (e.g., components are separated vs. one is nested inside another).
- Numerical sequence in symbol counts (e.g., counts go 9, 8, 7 … and one item breaks the sequence).
Solving method:
- Identify the governing rule (shape type, separation, count sequence) then choose the item that violates it.

Task: identify the rearrangement operation that maps one configuration to another (which original position moved to which new position).
Solving method:
- Track where each element moves. For example: original 3 → new 1, original 2 → new 2, original 4 → new 3, original 1 → new 4 → select permutation 3‑2‑4‑1.
- If the problem shows multiple steps, compare successive transformations to deduce the mapping.

Use elimination heavily — the “no repeats” rule simplifies many placements.
Fill forced positions first, then handle ambiguous slots.
Because the game section is adaptive, practice a variety of examples so you are ready when difficulty increases.
Clicking a wrong option only indicates it’s wrong; selecting the correct one advances — no heavy penalty for trying.
For motion puzzles, watch short example playthroughs to understand permitted moves and movement patterns.
The presenter will upload PDFs and notes to a Telegram group for viewers who join.

Online Study For You (YouTube channel / course material; PDFs to be posted on Telegram).
Example exam reference: a Cognizant question from 16th September referenced in the video.