Skip to main content
← Syllabus

Informatics

Source: Silabus OSN Bidang Informatika — IA TOKI · OSN 2026

The official wording is in Indonesian. Translations here are unofficial, so check the source if in doubt.

58 topics · 1 material · 1 editorial

Theory

Programming Fundamentals5 topics
  1. Basic syntax and semantics of the language permitted in the relevant OSN

    Coming soon
  2. Variables, data types, expressions, and assignment

    Coming soon
  3. Basic input and output

    Coming soon
  4. Branching and loops

    Coming soon
  5. Functions and parameters

    Coming soon
Logic and Bitwise Operations3 topics
  1. Basic logical operators (conjunction, disjunction, implication, biconditional, exclusive or)

    Coming soon
  2. Truth tables

    Coming soon
  3. Modus ponens and modus tollens

    Coming soon
Arithmetic8 topics
  1. Integers, operations (including exponentiation), comparison

    Coming soon
  2. Integer properties (sign, parity, divisibility)

    Coming soon
  3. Basic modular operations (addition, subtraction, multiplication)

    Coming soon
  4. Modular exponentiation

    Coming soon
  5. Prime numbers

    Coming soon
  6. Fractions and percentages

    Coming soon
  7. Number theory

    Coming soon
  8. Set theory

    Coming soon
Counting Rules8 topics
  1. Sum and product rules

    Coming soon
  2. Arithmetic and geometric sequences

    Coming soon
  3. Fibonacci numbers

    Coming soon
  4. Permutations and combinations

    Coming soon
  5. Probability

    Coming soon
  6. Pigeonhole principle

    Coming soon
  7. Inclusion–exclusion principle

    Coming soon
  8. Pascal’s triangle, binomial theorem

    Coming soon
Recursion5 topics
  1. The concept of recursion

    Coming soon
  2. Recursive mathematical functions

    Coming soon
  3. Simple recursive procedures

    Coming soon
  4. Divide and conquer

    Coming soon
  5. Backtracking

    Coming soon
Searching and Sorting4 topics
  1. Bubble sort, insertion sort

    Coming soon
  2. Quicksort, merge sort, heapsort

    Coming soon
Problem-Solving Strategies4 topics
  1. Greedy algorithms

    Coming soon
  2. Divide and conquer

    Coming soon
  3. Dynamic programming

    Coming soon
Data Structures7 topics
  1. Primitive data types (boolean, integer, character, floating-point numbers)

    Coming soon
  2. Arrays (including multidimensional)

    Coming soon
  3. Strings and their operations

    Coming soon
  4. Stacks and queues

    Coming soon
  5. Binary heap

    Coming soon
  6. Disjoint set

    Coming soon
  7. Point update, range query (e.g. with a Fenwick tree or segment tree)

    Coming soon
Graphs and Trees8 topics
  1. Basic trees (including rooted trees)

    Coming soon
  2. Directed and undirected graphs

    Coming soon
  3. Weighted and unweighted graphs

    Coming soon
  4. Graph representation (adjacency list, adjacency matrix, edge list)

    Coming soon
  5. Graph traversal (BFS, DFS, connectivity)

    Coming soon
  6. Shortest paths (Dijkstra, Bellman–Ford, Floyd–Warshall)

    Coming soon
  7. Minimum spanning trees (Prim, Kruskal)

    Coming soon
  8. Lowest common ancestor (LCA)

    Coming soon
Basic Geometry6 topics
  1. Lines, line segments, angles

    Coming soon
  2. Triangles, squares, rectangles, circles

    Coming soon
  3. Points and coordinates on the 2D Cartesian plane

    Coming soon
  4. Euclidean distance

    Coming soon
  5. Pythagorean theorem

    Coming soon
  6. Definition of the convex hull

    Coming soon