exam recall Qs
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt Play1/9
There's no tags or description
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
10 Terms
Each parent node has at most two child nodes.
It must have a root node
It has a polynomial or better time complexity
O(log n)
Every comparison halves the size of the binary tree to look at
Rules about the problem domain that can be used to find a good approximate but not optimal solution to a problem
As the size of the input increases the amount of time taken remains the same
The number of elements in a set
A Turing machine that can execute the behaviour of any other Turing machine
Can compute any computable sequence
It has an infinite amount of memory
Check the queue is not already empty.
Compare the value of the front pointer with the maximum size of the array
If equal then front pointer becomes 1
Otherwise add one to the front pointer
Static data structures have storage size determined at compile time.
Dynamic data structures can grow and shrink during execution.
Dynamic data structures
