Selenium Data Structures & Algorithms 2

Question 1

In Selenium test automation, which data structure is most efficient for storing a unique set of browser session IDs to avoid duplicate sessions?

Accepted Answer

HashSet

Answer

HashSet ensures uniqueness and provides O(1) average-time lookup, making it ideal for storing unique session IDs.

Question 2

You need to execute Selenium test cases in a specific priority order. Which data structure best supports this requirement?

Accepted Answer

PriorityQueue

Answer

A PriorityQueue dequeues elements based on their priority, allowing test cases to execute in the desired order.

Question 3

What is the time complexity of searching for an element in a balanced Binary Search Tree (BST)?

Accepted Answer

O(log n)

Answer

In a balanced BST, each comparison halves the search space, resulting in O(log n) search time.

Question 4

A Selenium framework stores locators in a Map<String, By>. Which Map implementation maintains insertion order?

Accepted Answer

LinkedHashMap

Answer

LinkedHashMap maintains the order in which key-value pairs were inserted, unlike HashMap which offers no order guarantee.

Question 5

Which sorting algorithm is most efficient for nearly-sorted test result arrays in Selenium reporting?

Accepted Answer

Insertion Sort

Answer

Insertion Sort performs at O(n) on nearly-sorted data, making it optimal when the array is already mostly ordered.

(Selenium) Selenium Testing Certification Practice Test