Skip to content
Educora
EN
AzərbaycancaEnglishРусскийTürkçe
My learningEducora StudioSettings

Computer Science

Computers, algorithms, data and the internet

In this course you will learn how information is measured, how a computer is built and how binary numbers and logic work inside it. You will be able to write algorithms and flowcharts, compare searching and sorting algorithms, explain how the internet works and protect yourself online. University modules then take you deep into algorithms, data structures and computer systems.

59 lessons12 modules≈ 22.5 hGrades 5–11BeginnerIntermediateAdvancedUniversity
Progress0%

0 of 59 lessons completed

Start course

Information, its kinds and information processes

Course content

All tests · 18Formulas & shortcuts
1

The computer: information, hardware and software

Beginner

Information and its kinds, how a computer is built, input and output devices, software, files and file systems.

5 lessons
  1. 1Information, its kinds and information processesLearn what information is, its kinds by the way we perceive it, its forms of representation and properties, the information processes and the source–channel–receiver scheme.
  2. 2Inside the computer: processor, memory and motherboardThe functional scheme of a computer and von Neumann’s principles, the central processor and its characteristics, internal (cache, RAM, ROM) and external (HDD, SSD, flash, CD/DVD, floppy) memory, the motherboard and buses, capacity and address calculations.
  3. 3Input and output devicesInput and output devices, DİM’s key groups (function, service, cursor control), scanners, monitors, printers and plotters; calculations of pixel counts, screen diagonals and printing time.
  4. 4Software, operating systems and filesLearn the kinds of software, what an operating system does, and how files and folders are organized.
  5. 5File systems and space on diskWhat a file system does, how FAT16, FAT32, NTFS and exFAT differ, sectors and clusters, how to calculate the space a file takes on disk, DİM-style cluster tasks, fragmentation, defragmentation and formatting.
2

Word processors and spreadsheets

Beginner

Editing and formatting text; addresses, formulas, functions and charts in spreadsheets — with DİM-style tasks.

4 lessons
  1. 6Word processors: editing, formatting and keyboard operationsText editors and word processors, the objects of a text, Delete, Backspace and Insert, the clipboard, character and paragraph formatting, find and replace — with step-by-step solutions of DİM’s keystroke, clipboard and formatting tasks.
  2. 7Spreadsheets: addresses, ranges and formulasCells, rows, columns and worksheets; counting the cells of a range; order of operations and error values; relative, absolute and mixed addresses and how they change when a formula is copied — with DİM’s “D2 → E3” tasks.
  3. 8Spreadsheet functionsThe eleven functions of the DİM programme — SUM, AVERAGE, MAX, MIN, COUNT, DATE, TIME, TODAY, PI, RADIANS, RAND: what they return, how they treat empty and text cells, how they nest; computing their values on a fragment.
  4. 9Charts in spreadsheets and their elementsColumn, bar, line and pie charts; chart area, plot area, title, axes, legend, data series and labels; a sector’s share p = x / S · 100% — with solutions of DİM’s “pie chart on formula cells” and “revenue chart” tasks.
3

Encoding and measuring information

Intermediate

Bits and bytes, the power of an alphabet, encoding text, graphics, sound and video, and calculating their sizes.

4 lessons
  1. 10Measuring information: bits, bytes and unitsWhat a bit is, how the formulas N = 2ⁱ and I = K · i work, how to convert KB, MB and GB with powers of two, and how to find the size of a document and the transfer time — with many solved entrance-exam-style problems.
  2. 11Encoding textHow a computer turns letters into numbers: the ASCII and UNICODE code tables, the DİM conventions (ASCII — 1 byte, UNICODE — 2 bytes, spaces count), the size of a text and a document, the power of an alphabet and sending text over a channel — with solved exam-style problems.
  3. 12Computer graphics: encoding raster and vector imagesRaster and vector graphics, pixels, resolution, color depth and palette (N = 2ⁱ), High Color and True Color, the image size V = W · H · i, ratio problems, and the RGB and CMYK models — with solved DİM-style tasks.
  4. 13Encoding sound and videoHow sound becomes a digital code: sampling rate, bit depth, mono and stereo, the size of a sound file V = f · i · t · k; video as a sequence of frames; lossy and lossless compression, sound and video formats — with solved problems.
4

Number systems and logic

Intermediate

Learn how a computer writes numbers and how logic gates “think”.

5 lessons
  1. 14Number systems: positional systems and binaryTell non-positional (Roman) and positional systems apart, write a number in expanded form, convert from any base to decimal and between decimal and binary, and count the 0s and 1s of a binary number.
  2. 15Octal and hexadecimal number systemsConvert octal and hexadecimal numbers to decimal and back, rewrite binary numbers in one step with triads and tetrads, convert between any two bases and link the numbers of digits.
  3. 16Arithmetic in different number systemsAdd, subtract, multiply and divide in columns in binary, octal, hexadecimal and any base, check results in decimal, evaluate mixed-base expressions and understand overflow in an n-bit cell.
  4. 17Number systems: problems with an unknown baseTurn equalities with an unknown base into equations, find the base from the last digit or the number of digits, solve problems with consecutive digits and letter digits, and count 0s and 1s in binary quickly — in the style of DİM tasks.
  5. 18Boolean logic and logic gatesLearn about true and false statements, the AND, OR and NOT operations, truth tables and how a computer adds numbers with logic gates.
5

Modelling

Intermediate

Models and modelling; table, tree and graph information models — with DİM's logic-table and graph tasks.

4 lessons
  1. 19Models and modellingWhat a model is, how models are classified (material and information models; verbal, table, graphic, mathematical; static and dynamic), what formalisation means and which stages computer modelling goes through.
  2. 20Table information models: solving logic puzzles with tables“Object–property” and “object–object” tables; solving logic puzzles with a “+ / –” table, count conditions, ordering puzzles, distance tables and timetables — 10 solved puzzles in the style of the Azerbaijani entrance exam.
  3. 21Tree information modelsA tree is a graphic model of a hierarchy: root, node, leaf, level; family, classification and file-system trees, the full name of a file; a tree as a graph without cycles (edges = nodes − 1), counting leaves and paths, writing a tree as a nested list.
  4. 22Graph information models: adjacency matrices and counting pathsVertices and edges, directed and weighted graphs, the degree of a vertex; moving between an adjacency matrix and a drawing (number of 1s = 2 × edges); counting paths in a one-way road scheme (through D and avoiding X); the shortest route from a weighted table — 12 tasks in the style of the Azerbaijani entrance exam.
6

Algorithms

Intermediate

Build algorithms, draw flowcharts and compare ways of searching and sorting.

6 lessons
  1. 23Algorithms, their properties and how to describe themAlgorithm and executor, the five properties of an algorithm, four ways to describe it, flowchart shapes, and running a linear algorithm with a trace table — in the language of DİM tasks.
  2. 24Branching algorithmsFull and incomplete branching, nested and compound conditions (and, or, not), their flowcharts and pseudocode; tracing DİM flowcharts with several diamonds and finding the initial value from the result.
  3. 25Loop algorithms and trace tablesCounter loops, loops with the condition first and last, trace tables, typical sum, product, count, maximum and digit tasks, nested and infinite loops; DİM loop tasks: the number of iterations, two consecutive loops, the input from the output.
  4. 26Building flowcharts: the written tasksHow to build DİM’s written flowchart task: reading N numbers, a counter loop, collectors, a flag, alternating signs, a piecewise function and a “not found” output; six model flowcharts and checking them with a trace table.
  5. 27Searching algorithmsLearn how linear and binary search work, compare their speed and see why binary search needs a sorted list.
  6. 28Sorting algorithmsLearn how bubble sort, selection sort and insertion sort work and compare how fast they are.
7

Programming in Python (school course)

Intermediate

Input and output, conditions and loops, number algorithms, strings, lists, functions and DİM's written programming tasks.

9 lessons
  1. 29Programming languages and Python: variables, input and outputWhat a program and a programming language are and how translators (interpreters and compilers) work; Python variables, input with `int(input())`, output with `print()` and the `//` and `%` operators — with exam-style “what does the program print?” tasks.
  2. 30The conditional statement: if, elif, else and compound conditionsComparisons, the full and incomplete `if`, `elif` chains, nested conditions, `and`, `or`, `not` and conditions built on remainders — with exam-style tracing, “how many times `Yes`?” and written-program tasks.
  3. 31Loops: for, while, step, break, continue and nested loops`for` and `range(a, b, d)`, the number of iterations, counters and accumulators, the pre-condition `while` loop, trace tables, recurrences such as Fibonacci, `break`, `continue` and nested loops — with solved exam-style tasks.
  4. 32Working with numbers: digits, divisors and primesSplit a number into digits with `n % 10` and `n // 10`; find the sum, product, count and reverse of the digits; count divisors; test primes and perfect squares; compute the GCD with Euclid's algorithm. Ready templates for the DİM tasks.
  5. 33Analysing programs: from the output back to the inputUse a trace table to find what a program prints, get the number of loop iterations from the printed value, and turn the loop condition into inequalities to find the smallest and the largest input and how many inputs give the same output — as in DİM's closed and coded tasks.
  6. 34Strings and string operationsIndexes (negative ones too), slices and `[::-1]`; `len`, `+`, `*`, `in`, `count`, `find`, `replace`, `upper`, `isdigit`, `split`, `join`; loops over characters, digits through `str(n)` and the string patterns of the DİM written tasks.
  7. 35Lists and list operationsCreating lists, reading n numbers into an empty list, indexes and neighbouring elements, list methods and DİM-style tracing tasks.
  8. 36Functions: def, parameters and returnDefining and calling functions, formal and actual parameters, local variables, one function calling another and helper functions over lists — with DİM-style tracing.
  9. 37Writing programs: the written tasksInformatics written tasks 89 and 90: how they are marked, how to read the *Giriş / Çıxış* table, 10 model solutions for the 2025–2026 task families and the mistakes that cost points.
8

Databases

Advanced

Databases and DBMS, tables, fields and records, relationships, queries and sorting.

2 lessons
  1. 38Databases: models, DBMS and related tablesDatabases and DBMS, hierarchical, network and relational models, fields, records and key fields, 1:1, 1:N and M:N relationships — and the DİM task type: finding a count or a sum from 2–3 related tables.
  2. 39Database queries, searching and sortingSimple and compound conditions (=, <>, <, >, <=, >=, AND, OR, NOT), the masks * and ?, evaluating a query step by step with sets, counting records and finding where a record moves after sorting — in DİM notation.
9

Networks, the internet and information security

Advanced

Understand how the internet works and stay safe in the digital world.

4 lessons
  1. 40Computer networks and how the internet worksLearn the types of networks and how IP addresses, DNS and the HTTP/HTTPS protocols work — and what happens when you open a website.
  2. 41Searching the internet: search engines and queriesLearn how a search engine works with its index, how to build queries with AND, OR and NOT, and how to count the pages found for a query with Euler–Venn diagrams.
  3. 42Cybersecurity: passwords, phishing and privacyLearn to create strong passwords, spot phishing messages, protect your personal data and stay safe online.
  4. 43Protecting information and cryptographyThe goals and methods of protecting information, the basic terms of cryptography, encryption and decryption with the Caesar cipher, DİM’s cipher tasks, symmetric and asymmetric encryption, the digital signature and the kinds of cybercrime.
10

Web programming

Advanced

The stages of building a site, HTML tags, lists, tables, colours, images and links.

2 lessons
  1. 44Web programming: building a site, HTML tags and listsWebsites and templates, the stages of building a site, HTML and CSS, paired and single tags, attributes, text formatting (b, strong, i, em, u, tt, sub, sup, font), wrongly nested tags, bulleted, numbered and definition lists.
  2. 45HTML tables, colour schemes, images and linkstable, tr, th, td, caption and border; finding the element where a row and a column meet and counting bold cells; colspan and rowspan; the body attributes bgcolor, text, link, vlink, alink and #RRGGBB colours; the img (src, alt, width, height, align, border) and a (href, #, mailto, target) tags.
11

Algorithms and data structures

University

Complexity analysis, arrays, lists, hash tables, trees, graphs, recursion, dynamic programming and efficient sorting.

7 lessons
  1. 46Complexity and Big O notationLearn to count operations, use O, Ω and Θ notation, recognise the common complexity classes and solve recurrences with the master theorem.
  2. 47Arrays, linked lists, stacks and queuesLearn how arrays sit in memory, why a dynamic array appends in amortised O(1), how linked lists work, and what stacks and queues are used for.
  3. 48Hash tablesLearn how hash functions turn keys into indexes, how collisions are resolved by chaining and open addressing, and how the load factor keeps operations O(1) on average.
  4. 49Trees and heapsLearn binary trees and their traversals, search, insertion and deletion in a binary search tree, the idea of balanced trees, heaps, priority queues and heap sort.
  5. 50Graphs and graph algorithmsLearn how graphs are represented, breadth-first (BFS) and depth-first (DFS) search, Dijkstra's algorithm, topological sorting and minimum spanning trees (Kruskal), step by step.
  6. 51Recursion and dynamic programmingLearn how recursion works, how memoisation turns exponential recursion into linear time, and the classic dynamic programming problems — Fibonacci, knapsack, longest common subsequence and coin change.
  7. 52Efficient sorting algorithmsLearn merge sort and quicksort step by step, prove the Ω(n log n) lower bound for comparison sorting, and meet counting sort, which beats that bound.
12

Computer systems and theory

University

Computer architecture, operating systems, networks, databases, theory of computation, software engineering and cryptography.

7 lessons
  1. 53Computer architectureLearn the von Neumann architecture, the CPU's instruction cycle and registers, the cache hierarchy, binary arithmetic in two's complement and the basics of IEEE 754 floating point.
  2. 54Operating systemsLearn processes and threads, CPU scheduling, virtual memory and paging, file systems and deadlock, with worked calculations.
  3. 55Computer networks in depthLearn the OSI and TCP/IP models, IP addressing and subnetting (with worked calculations), TCP and UDP, DNS, HTTP/HTTPS and the basics of TLS.
  4. 56Database theoryLearn the relational model, keys, functional dependencies, normalisation from 1NF to 3NF with a step-by-step example, transactions and ACID, indexes, and SQL versus NoSQL.
  5. 57Theory of computationLearn finite automata, regular expressions and their limits, Turing machines, the undecidable halting problem and the difference between P and NP.
  6. 58Software engineeringLearn the software development life cycle, agile methods and Scrum, version control with Git, testing levels, the SOLID principles and code review.
  7. 59Cryptography and securityLearn symmetric and asymmetric encryption, hash functions, digital signatures, RSA and Diffie–Hellman with small numbers, and common attacks and their defences.

School subjects

Primary MathsGrades 1–4: counting, adding and subtracting, times tables, shapesLife KnowledgeGrades 1–4: nature, health, safety, family and societyMathematicsFrom numbers to functions — learn to think logicallyPhysicsMotion, energy, light and the laws of the Universe