Algorithms and data structures

Question 1 of 10

A tree data structure has a top node called the

Question 2 of 10

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

Question 3 of 10

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

Question 4 of 10

Linear search checks items

Question 5 of 10

Binary search only works if the list is

Question 6 of 10

Which data structure removes items in the same order they were added?

Question 7 of 10

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

Question 8 of 10

The worst-case time complexity of bubble sort is

Question 9 of 10

In the worst case, how many comparisons does a linear search of n items make?

Question 10 of 10

Binary search requires the list to be