Question#1
In search program design, _____ is crucial for providing users with accurate and useful information in result rankings.
a) indexing
b) relevance ✅
c) scalability
d) query performance

Question#2
Search programs rely on advanced _____ techniques to interpret user queries and understand their intent.
a) natural language processing ✅
b) encryption
c) hardware optimization
d) machine learning

Question#3
To efficiently handle a large volume of data and queries, search programs must address the issue of _____.
a) ranking
b) flat maximum
c) security
d) scalability ✅

Question#4
The BFS algorithm employs a _____ data structure for implementing its search process.
a) FIFO queue ✅
b) LIFO stack
c) hash table
d) priority queue

Question#5
Search result ordering in search programs requires a robust _____.
a) ranking algorithm ✅
b) encryption scheme
c) hashing function
d) compression algorithm

Question#6
In graph traversal, the time complexity of BFS is given by _____.
a) O(log n)
b) O(V + E) ✅
c) O(b^d)
d) O(n^2)

Question#7
BFS will only guarantee an optimal solution if path cost is a _____ function of the node depth.
a) non-decreasing ✅
b) linear
c) decreasing
d) random

Question#8
DFS requires only enough memory to store a _____ from the root node to the current node it is examining.
a) complete tree
b) ranking list
c) single path ✅
d) frontier set

Question#9
The space complexity of the DFS algorithm is determined by the size of the _____ set, given as O(bm).
a) vertex
b) goal
c) fringe ✅
d) state

Question#10
Heuristic search algorithms utilize _____ functions to guide search, making them more efficient than uninformed techniques.
a) cryptographic
b) heuristic ✅
c) indexing
d) random

Question#11
The hill climbing algorithm is also known as a _____ local search, as it always chooses the best immediate neighbor.
a) randomized
b) iterative
c) backtracking
d) greedy ✅

Question#12
In hill climbing, a ''flat local maximum'' refers to a landscape where all _____ states of the current state have the same value.
a) fringe
b) neighbor ✅
c) child
d) global

Question#13
Unlike steepest-ascent hill climbing, simple hill climbing evaluates only _____ neighbor state at a time.
a) one ✅
b) all
c) multiple
d) adjacent

Question#14
The _____ region in a state space landscape has an uphill edge and is referred to as a plateau in hill climbing.
a) valley
b) shoulder ✅
c) fringe
d) summit

Question#15
A search algorithm that generates potential solutions and checks them against criteria until successful is called _____.
a) BFS
b) hill climbing
c) generate-and-test ✅
d) A* search

Question#16
The traveling salesman problem is a classic example where a _____ approach can provide a reasonably good route, though not always optimal.
a) brute-force
b) DFS
c) uninformed
d) heuristic ✅

Question#17
Steepest-ascent hill climbing examines _____ the neighboring nodes to select the one closest to the goal.
a) exactly two of
b) all ✅
c) none of
d) one of

Question#18
If a hill climbing algorithm does not remember previous states and strictly moves upward, it does not perform _____.
a) expansion
b) backtracking ✅
c) heuristics
d) testing

Question#19
A landscape's _____ corresponds to the best possible state with the highest objective function value in hill climbing.
a) valley
b) local minimum
c) global maximum ✅
d) flat maximum

Question#20
Cross-language search requires techniques such as language detection, translation, and _____ indexing for effective functionality.
a) temporal
b) multilingual ✅
c) graph
d) priority