Computing

1A data structure that follows Last In, First Out is a

2In the worst case, binary search on 1,024 sorted items needs about how many comparisons?

3After pushing 3, 5, 7 onto an empty stack and popping once, the top item is

4A tree data structure has a top node called the

5Linear search checks items

6Binary search only works if the list is

7An error in the logic of a program that gives wrong results without crashing is a

8The maximum number of comparisons binary search needs for 1,024 sorted items is about

9The time complexity of binary search is

10Which sorting algorithm repeatedly compares neighbouring items and swaps them if they are in the wrong order?