Explanation
Solution
To perform a linear search in a linked list, we follow a specific logical sequence of operations. Let's break down the logic:
-
Initialization: We must start at the beginning of the list.
-
Looping/Condition: We need to keep looking as long as we haven't reached the end of the list and haven't found the key.
-
Iteration: Inside the loop, if the current node isn't the one we want, we move to the next one.
-
Final Result: Once the loop finishes (either because we found the key or reached the end), we return the pointer.
Putting it together, the pseudocode looks like this:
while x=Nil and x.key=K:
The correct sequence is (A) → (B) → (D) → (C).
Conclusion
The correct option is (a).
