Question#1
What is a key consideration for ensuring efficient retrieval of search results in search programs?
a) Providing only user-friendly interfaces
b) Using only keyword matching algorithms
c) Employing a purely random search strategy
d) Implementing effective indexing methods like inverted or full-text indexes ✅

Question#2
Which search technique systematically explores all possible states without prior knowledge of the goal?
a) Genetic algorithms
b) Heuristic search techniques
c) Hill climbing algorithm
d) Uninformed search techniques ✅

Question#3
How does breadth-first search (BFS) expand nodes in a graph or tree?
a) Selecting nodes based on a heuristic value
b) Expanding the deepest nodes first
c) By expanding all nodes at the current level before moving to the next ✅
d) Expanding nodes in a random manner

Question#4
What data structure is primarily used to implement breadth-first search?
a) FIFO queue ✅
b) LIFO stack
c) Binary tree
d) Priority queue

Question#5
Which of the following is an advantage of using the breadth-first search algorithm?
a) It uses very little memory and time
b) It always finds the optimal path in any scenario
c) It guarantees finding a solution if one exists ✅
d) It does not revisit or repeat any states

Question#6
In the context of hill climbing algorithms, what is a 'local maximum'?
a) The highest possible global state
b) The worst state among all neighbors
c) A plateau region with equal-value neighbors
d) A state better than its neighbors but not the highest overall state ✅

Question#7
What is a main disadvantage of depth-first search (DFS)?
a) Possibility of infinite loops and no guarantee of solution ✅
b) It always finds the optimal solution quickly
c) It cannot process graphs with cycles
d) It requires more memory than BFS

Question#8
Which of the following best defines the generate-and-test search algorithm?
a) It uses a heuristic function for selection
b) It relies on user feedback for iteration
c) It only explores the shortest possible paths
d) It generates possible solutions and tests them against criteria ✅

Question#9
Which feature distinguishes steepest-ascent hill climbing from simple hill climbing?
a) Examines all neighboring nodes to select the closest to the goal ✅
b) Backtracks to previously visited states
c) Randomly selects a neighbor regardless of cost
d) Explores all paths in parallel

Question#10
What is the main focus of the user experience in the design of search programs?
a) Prioritizing only security measures
b) Providing intuitive and user-friendly interfaces ✅
c) Maximizing computational resource usage
d) Ensuring purely technical search accuracy

Question#11
When is a breadth-first search algorithm considered optimal?
a) When implemented on acyclic graphs
b) When path cost does not decrease with increasing node depth ✅
c) When the search tree has even branches only
d) When the graph contains only weighted edges

Question#12
What is a key limitation of uninformed search algorithms compared to informed ones?
a) They are only suitable for optimization problems
b) They do not use heuristic or problem-specific information ✅
c) They outperform informed searches
d) They require more initial problem knowledge

Question#13
Which search algorithm uses a stack data structure for traversal?
a) A* search algorithm
b) Depth-first search (DFS) ✅
c) Breadth-first search (BFS)
d) Hill climbing algorithm

Question#14
What is a global maximum in the context of the hill climbing algorithm's state-space landscape?
a) A state better than its immediate predecessor
b) Any state equal to its immediate neighbors
c) The state with the largest number of neighbors
d) The best possible state with highest objective function value ✅

Question#15
What factor is essential for determining the optimal order of search results?
a) Excluding user preferences from ranking
b) Use of a robust ranking algorithm ✅
c) Limiting results to a single page
d) Applying random order selection

Question#16
Which search algorithm is non-optimal and may result in high cost paths?
a) Breadth-first search (BFS)
b) Dijkstra's algorithm
c) Depth-first search (DFS) ✅
d) A* search algorithm

Question#17
Which of the following describes the 'shoulder' in hill climbing's state-space diagram?
a) The lowest point in the landscape
b) A plateau region that has an uphill edge ✅
c) A state with all equal-valued neighbors
d) A neighbor state higher than all others

Question#18
What is the primary difference between uninformed and heuristic search algorithms?
a) Heuristic algorithms examine every possible solution
b) Uninformed algorithms use heuristic functions
c) Heuristic algorithms use problem-specific information to guide search ✅
d) Uninformed search never completes in practice

Question#19
In which situation might a hill climbing algorithm fail to find the best solution?
a) When it gets stuck at a local maximum ✅
b) When starting from the goal state
c) When all states are equal
d) When using depth-first exploration

Question#20
What optimization problem is commonly solved using the hill climbing algorithm?
a) Sorting numbers in ascending order
b) The traveling salesman problem for shortest round trips ✅
c) Linear search in an unsorted list
d) Binary search in a sorted array