Question#1
Search program designers must consider relevance, user experience, and security.
a) True ✅
b) False

Question#2
Uninformed search algorithms typically rely on heuristic functions to guide searching.
a) True
b) False ✅

Question#3
Breadth-first search always explores nodes at the deepest level first.
a) True
b) False ✅

Question#4
DFS uses a stack data structure for its implementation, often recursively or explicitly.
a) True ✅
b) False

Question#5
BFS is optimal if the path cost decreases as node depth increases.
a) True
b) False ✅

Question#6
Hill climbing algorithms look ahead beyond their immediate neighbors to direct their search.
a) True
b) False ✅

Question#7
Effective indexing in search programs helps in retrieving relevant results quickly.
a) True ✅
b) False

Question#8
Both BFS and DFS require storing the entire search tree in memory at all times.
a) True
b) False ✅

Question#9
The hill climbing algorithm always guarantees finding the global maximum in the state space.
a) True
b) False ✅

Question#10
In BFS, levels of the tree must be saved in memory to expand to the next level.
a) True ✅
b) False

Question#11
Breadth-first search is complete and guarantees a solution if a solution exists at finite depth.
a) True ✅
b) False

Question#12
DFS is an optimal algorithm because it always finds the path with the lowest cost.
a) True
b) False ✅

Question#13
Cross-language search functionalities require language detection and translation mechanisms.
a) True ✅
b) False

Question#14
The generate-and-test algorithm always returns the best possible solution out of all candidates.
a) True
b) False ✅

Question#15
User data security and privacy must be considered in the design of search programs.
a) True ✅
b) False

Question#16
Steepest-ascent hill climbing evaluates all neighboring nodes and selects the one closest to the goal.
a) True ✅
b) False

Question#17
DFS is guaranteed to terminate with a solution even in infinite state spaces.
a) True
b) False ✅

Question#18
Heuristic search algorithms often outperform uninformed search for complex problems.
a) True ✅
b) False

Question#19
A state in a hill climbing algorithm's landscape with no better neighbors is called a local maximum.
a) True ✅
b) False

Question#20
In generate-and-test search, the process stops as soon as a valid solution is found.
a) True ✅
b) False