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.

to be honest its playstation. it has a lot of games