• Computing and data
  • Grade 10

Computer science: algorithms and data structures – 10th Grade

Written with AI (How we create content)Target level: Grade 10Last updated: Report an error
About Computer science: algorithms and data structures

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.

All lessons in Computer science: algorithms and data structures (in learning order)

  1. What is Choosing the container before writing the code?
    Choosing the container before writing the code · Grade 10 · 40 min
  2. What is A list you reach by position and a list you must walk?
    A list you reach by position and a list you must walk · Grade 10 · 45 min
  3. What is Stack and queue: two ways to decide who is served next?
    Stack and queue: two ways to decide who is served next · Grade 10 · 40 min
  4. What is A method that calls itself and still comes to an end?
    A method that calls itself and still comes to an end · Grade 10 · 45 min
  5. What is Reading a recursive method by trusting the smaller case?
    Reading a recursive method by trusting the smaller case · Grade 10 · 45 min
  6. What is Sorting by comparison, and the price of every swap?
    Sorting by comparison, and the price of every swap · Grade 10 · 45 min
  7. What is Branching data: the tree and the search it makes possible?
    Branching data: the tree and the search it makes possible · Grade 10 · 45 min
  8. What is What happens to the running time when the input doubles?
    What happens to the running time when the input doubles · Grade 10 · 45 min

Common 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.