# Computer science: algorithms and data structures – 10th Grade

> Written with AI · Grade 10 · 2026-11-01 · https://lessoons.com/en/computer-science-algorithms

A data structure is not storage, it is a decision about which operations should be cheap and which you are willing to make expensive. The opening year of the five unit computer science stream. How a program holds many values at once and what that choice costs, methods that call themselves and still finish, and the habit of asking what a solution costs before running it.

## Lessons in this topic (in learning order)

1. [What is Choosing the container before writing the code?](https://lessoons.com/en/computer-science-algorithms#lesson-1) (Grade 10) — A data structure is not storage, it is a decision about which operations should be cheap and which you are willing to make expensive. Every structure in the course is that same trade made differently.
2. [What is A list you reach by position and a list you must walk?](https://lessoons.com/en/computer-science-algorithms#lesson-2) (Grade 10) — An array knows where every item sits and can jump straight to it, but making room in the middle means moving everything after it. A linked list has the opposite manners entirely.
3. [What is Stack and queue: two ways to decide who is served next?](https://lessoons.com/en/computer-science-algorithms#lesson-3) (Grade 10) — Both hold items waiting to be handled and both are tiny to describe. The only difference is which item comes out first, and that single difference decides which problems each one solves.
4. [What is A method that calls itself and still comes to an end?](https://lessoons.com/en/computer-science-algorithms#lesson-4) (Grade 10) — Recursion works when every call hands on a smaller problem and there is a smallest case that answers without calling anyone. Take away either half and the program runs until it runs out of room.
5. [What is Reading a recursive method by trusting the smaller case?](https://lessoons.com/en/computer-science-algorithms#lesson-5) (Grade 10) — Following every call down and back up is exhausting and usually wrong. The working method is to assume the smaller call already returns the right answer and check only what this call adds to it.
6. [What is Sorting by comparison, and the price of every swap?](https://lessoons.com/en/computer-science-algorithms#lesson-6) (Grade 10) — Several sorting methods reach the same sorted list by very different routes. Counting the comparisons and the swaps each one makes shows why some stay usable when the list gets long and some do not.
7. [What is Branching data: the tree and the search it makes possible?](https://lessoons.com/en/computer-science-algorithms#lesson-7) (Grade 10) — A tree keeps items in an order that lets every comparison throw away half of what is left. That is the same idea as looking for a word in a dictionary, written down as a structure.
8. [What is What happens to the running time when the input doubles?](https://lessoons.com/en/computer-science-algorithms#lesson-8) (Grade 10) — Complexity is not a stopwatch reading, it is the shape of the growth. Two solutions can look equally fast on a class list and be separated by hours on a national one.

## Frequently Asked Questions

### What is Choosing the container before writing the code?

A data structure is not storage, it is a decision about which operations should be cheap and which you are willing to make expensive. Every structure in the course is that same trade made differently.

### What is A list you reach by position and a list you must walk?

An array knows where every item sits and can jump straight to it, but making room in the middle means moving everything after it. A linked list has the opposite manners entirely.

### What is Stack and queue: two ways to decide who is served next?

Both hold items waiting to be handled and both are tiny to describe. The only difference is which item comes out first, and that single difference decides which problems each one solves.

### What is A method that calls itself and still comes to an end?

Recursion works when every call hands on a smaller problem and there is a smallest case that answers without calling anyone. Take away either half and the program runs until it runs out of room.

### What does Computer science: algorithms and data structures for 10th Grade cover?

The opening year of the five unit computer science stream. How a program holds many values at once and what that choice costs, methods that call themselves and still finish, and the habit of asking what a solution costs before running it. The unit includes 8 ordered lessons covering Choosing the container before writing the code, A list you reach by position and a list you must walk, Stack and queue: two ways to decide who is served next, A method that calls itself and still comes to an end.
