When searching for the entry X within the list using sequential search R, S, T, U, V, W, Z how many entries will be considered before discovering that the entry is not present? (Note that the list is in alphabetical order.)

7 if we are using the sequential search or linear search.

Explanation:

In linear search it goes to every element and checks if the element is X or not if the element is. So we have seven characters it will go to every element and will check if the element is X or not. Hence it will check 7 times.