- Computing and data
- Grade 10
Computer science: algorithms and data structures – 10th Grade
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)
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.