Dashboard · పరీక్షలు · ZIO
ZIO
Zonal Informatics Olympiad
IARCS Stage-1 informatics olympiad. Pen-and-paper paper on algorithmic problem-solving — no programming language knowledge required. 4 problems in 3 hours.
Updated 3 Sept 2026 ·Vacancy counts change every cycle — always confirm the exact number in the latest official notification before applying.
Sourced
Source: official exam authority notification · refreshed weekly. How this works →
Free ZIO preparation on Shishya
Take expert-curated mocks, practise previous year papers, and Ask Shishya when you're stuck — verified by students who cleared the same path. All free, no credit card. Sign in with Google to begin.
✦ Try a ZIO question — free, no signup
Measuring Algorithm EfficiencyA nested loop structure has the outer loop running n times and the inner loop running m times. What is the time complexity?
Tap an option to check your answer.
డయగ్నోస్టిక్తో ప్రారంభించండి
మీరు ఎక్కడ ఉన్నారో చూడటానికి syllabus అంతటా 10 ప్రశ్నలు.
అధికారిక ఫలితం వచ్చినప్పుడు ఒక ఈమెయిల్, ఇంకేమీ కాదు.
🧩 Build your own mock — pick exact topics → · every mock readable in हिंदी + 12 languages inside the test
ZIO — Frequently asked questions
Is Shishya free for ZIO preparation?
How many ZIO practice questions does Shishya have?
How long is the ZIO exam?
గత సంవత్సరాల పేపర్లు
0 అన్ని సంవత్సరాల్లో ప్రశ్నలుఅధికారిక నోటిఫికేషన్ PDFల నుండి PYQలు సేకరిస్తున్నాం. త్వరలో వస్తుంది.
Mock tests
నా అన్ని ప్రయత్నాలు →Take any mock in your preferred language — use the language picker inside the mock to switch (Hindi, Telugu, Tamil, Bengali, and 15 more).
ZIO — Quick Practice
FULL20 ప్రశ్నలు · 180 నిమి
మాక్ ప్రారంభించండి →ZIO — Full-Length Mock (Real Pattern: 4Q · 180 min)
FULL4 ప్రశ్నలు · 180 నిమి
మాక్ ప్రారంభించండి →
Practice by subject & topic
Full-length subject tests below — 25 questions each, real exam format, instant scoring. Want to drill a single topic? Every topic has its own 10-question test in the syllabus.
Algorithmic Problem Solving
20 Qs
🎯 Build my own mock
Tell Shishya exactly what to test you on — topics, size, difficulty — and get a fresh mock in seconds. Leave the box blank and we'll target your weakest topics.
మీ ర్యాంక్
ఈ పరీక్ష తీసుకున్న అందరితో పోల్చితేలీడర్బోర్డ్లో మీరు ఎక్కడ ఉన్నారో చూడటానికి మాక్ తీసుకోండి.
Students
2
Mocks taken
9
Average score
58%
Top score
100%
What can I get from ZIO?
Mock-score → expected rank → likely outcome. Use the mocks below to find your current band, then plan how many marks you need to climb.
National medal contender
92–100% · Post-based exam (no numeric rank)
- •Expected top performer in ZIO zone
- •Very high chance of IOITC camp selection
- •Strong contender for International Olympiad in Informatics (IOI) team (4 members)
- •Likely gold/silver medal range at INOI
- •Previous IOI team members typically score in this range at ZIO
- •Consider advanced preparation for IOI (past IOI problems, Codeforces Div 1)
IOITC camp probable
82–92% · Post-based exam (no numeric rank)
- •Near-certain INOI qualification with distinction
- •Strong probability of selection to Indian Olympiad in Informatics Training Camp (IOITC)
- •Camp typically selects ~30-35 students nationally from INOI
- •Potential for IOI team selection (top 4 from camp)
- •Practice IOI-style problems and participate in international online contests
INOI strong contender
70–82% · Post-based exam (no numeric rank)
INOI qualification likely
55–70% · Post-based exam (no numeric rank)
Near cut-off zone
35–55% · Post-based exam (no numeric rank)
Below cut-off range
0–35% · Post-based exam (no numeric rank)
AI-curated from historic cut-off patterns. Always verify with the latest official notification before making decisions.
News & timeline
See older updates →తాజా వార్తలు
India wins medals at IOI-2026 in Uzbekistan
25 d క్రితంIndia participated at IOI-2026 held in Uzbekistan from August 9-16, 2026. The Indian team, selected through the ICO pathway (ZIO → INOI → IOITC), won two medals at the prestigious international competition.
IARCS has announced that registrations for ICO-2027 (including ZIO-2027) will open in October 2026. Details will be announced in the second half of September 2026.
At the Asia-Pacific Informatics Olympiad 2026 held online by Taiwan in May 2026, India won five medals. Samik Goyal won a gold medal, while Naman Singh, Mohammad Farhat, Arjun Tyagi and Avighna Chhatrapati won bronze medals.
ముఖ్యమైన తేదీలు
🏅ZIO-2026 exam (completed)
గడిచిపోయిందిSat, 15 Nov, 2025
Exam held from 2 pm to 5 pm (3 hours)
ZIO-2026 result announced
గడిచిపోయిందిThu, 18 Dec, 2025
Results announced in December 2025 as per schedule
🏅INOI-2026 exam (completed)
గడిచిపోయిందిSat, 14 Feb, 2026
Second round for ZIO/ZCO qualifiers; C++ only
ICO-2027 notification (expected)
9 రోజులు మిగిలాయిSun, 20 Sept, 2026
Details will be announced in second half of September 2026
ZIO-2027 registration opens (expected)
20 రోజులు మిగిలాయిThu, 1 Oct, 2026
Registrations for ICO-2027 will open in October 2026
ZIO-2027 registration deadline (expected)
49 రోజులు మిగిలాయిFri, 30 Oct, 2026
Based on previous cycle pattern; typically late October
🏅ZIO-2027 exam (expected)
64 రోజులు మిగిలాయిSat, 14 Nov, 2026
Typically mid-November; ZIO-2026 was November 15, 2025
🏅INOI-2027 exam (expected)
155 రోజులు మిగిలాయిSat, 13 Feb, 2027
Typically mid-February; for ZIO-2027/ZCO-2027 qualifiers
Syllabus
ఏదైనా టాపిక్పై ట్యాప్ చేయండి — నోట్స్ + 10 ప్రశ్నల టాపిక్ టెస్ట్
Algorithmic Problem Solving
Introduction to Algorithms
What an algorithm is, step-wise problem decomposition, pseudocode reading.
Measuring Algorithm Efficiency
Time and space complexity intuition, big-picture growth rates without formal Big-O.
Searching
Linear search, binary search and variants over sorted/unsorted data.
Sorting
Selection, insertion, merge and quick sort intuition; stability and order properties.
Recursion
Recursive thinking, base/recursive cases, recursion tree, divide-and-conquer.
Dynamic Programming Intuition
Overlapping subproblems, memoisation, tabulation on small input sizes.
Greedy Algorithms
Local optimal choices, interval scheduling, coin-change-style ad-hoc greedy.
Basic Graph Concepts
Vertices, edges, directed/undirected graphs, paths, cycles, connectivity.
Graph Traversal
Breadth-first and depth-first traversal as conceptual exploration strategies.
Shortest Paths
Shortest-path intuition on grids and small graphs without formal algorithms.
Trees
Rooted trees, binary trees, parent/child traversal, tree counting puzzles.
Basic Data Structures
Arrays, lists, stacks, queues — used as tools for problem modelling.
Simulation
Mentally or on paper simulating a process or rule on small concrete inputs.
Invariants and Monovariants
Quantities preserved or strictly changing across steps — proving outcomes.
Case Analysis
Splitting a problem into exhaustive cases and resolving each.
Combinatorics and Discrete Mathematics
Counting Principles
Sum and product rules, permutations, combinations applied to small enumerations.
Pigeonhole Principle
Existence arguments via pigeons/holes — colourings, residues, pairs.
Parity and Modular Reasoning
Even/odd reasoning, basic modular arithmetic for invariants.
Elementary Number Theory
Divisibility, gcd/lcm reasoning, prime factorisation puzzles.
Combinatorial Games
Winning/losing positions, Nim-like games, strategy stealing.
Sets and Logic
Inclusion-exclusion, propositional logic, truth tables in puzzles.
Ad-Hoc Problem Patterns
Constructive Problems
Building an explicit example/configuration that satisfies given rules.
Optimisation Puzzles
Finding minimum/maximum of a quantity under given constraints.
Scheduling and Ordering
Sequencing tasks, jobs or moves to satisfy precedence/deadline rules.
Grid and Geometry Puzzles
Reasoning on 2D grids — paths, colourings, tilings, distance puzzles.
Three Concrete Inputs Format
ZIO-style problems — solve three increasingly large concrete inputs by spotting an efficient method.