Quiz Ôn tập

How does the sequential search algorithm work?

• Check each element in the list in order until the desired element is found

• Always divide the list in half to search

• Search for the smallest element first

• Compare the middle element of the list and then expand outwards

When does the worst-case scenario of the sequential search algorithm occur?

• The desired element is at the beginning of the list

• The desired element is at the end of the list or not in the list

• The list has a small number of elements

• The desired element is in the middle of the list

What does the binary search algorithm require before execution?

• The list must be sorted first

• The list must not contain duplicate numbers

• The list must have at least 10 elements

• The list must contain integers

Assuming there is a sorted list [10, 20, 30, 40, 50, 60]. How many steps does the binary search algorithm need to find the number 50?

• 1

• 2

• 3

• 4

How does the Selection Sort algorithm work?

• Find the largest element and move it to the front of the list

• Find the smallest element and place it in the first position, then continue with the rest

• Divide the list into two parts and sort

• Iterate through each element and swap if necessary

After the first iteration of the Selection Sort algorithm, which element will be in the correct position in the list [9, 3, 5, 1]?

• 9

• 3

• 5

• 1

How many steps are needed to find the number 6 in the list [2, 4, 8, 10] using binary search?

• 1

• 2

• 3

• Not found

Which method is used to add an element to a set in Python?

• add()

• append()

• insert()

• extend()

What method is used to add an element to a set in Python?

• add()

• append()

• insert()

• extend()

Given the set A = [1, 2, 3]. Which command removes the element 2 from the set without causing an error if the element does not exist?

• A.remove(2)

• A.discard(2)

• A.pop(2)

• A.delete(2)