Question 1
Which of the following data structures can be used to efficiently find the kth smallest element in an array?
1
Array
2
Heap
3
Queue
4
Stack
Question 2
How do you find the largest element in an array efficiently?
1
Use recursion without extra space
2
Sort the array and return the last element
3
Use a linear scan to find the maximum
4
Use a binary search approach
Question 3
What is the time complexity of finding an element in a sorted array using binary search?
1
O(1)
2
O(log n)
3
O( n log n)
4
O(n)
Question 4
How can you efficiently find the missing number in an array of size n containing numbers from 1 to n+1?
1
Use a hash set to store elements
2
Use a linked list
3
Sort and search for the missing number
4
Calculate the sum and subtract from expected sum
Question 5
How would you implement the A* search algorithm for pathfinding in a graph?
1
Use recursion to explore all paths
2
Use a simple list to store nodes
3
Use a priority queue to store nodes
4
Use a stack to store nodes
Question 6
What is the worst-case time complexity for search in a HashMap?
1
O(n)
2
O(log n)
3
O(1)
4
O(n log n)
Question 7
What is the primary purpose of using a search algorithm in AI problem-solving?
1
To enhance the graphical display of the system
2
To store large datasets efficiently
3
To systematically explore possible actions to reach a goal
4
To randomly select possible solutions
Question 8
Which of the following is a disadvantage of using brute force search in AI?
1
It requires domain-specific knowledge
2
It only works for small datasets
3
It is not guaranteed to find a solution
4
It is computationally expensive
Question 9
which algorithm would you use to solve a maze problem?
1
Linear search
2
Depth-first search
3
Bubble sort
4
Binary search
Question 10
Which Python library can be used to visualize search algorithms applied to a problem?
1
Pandas
2
TensorFlow
3
Scikit-learn
4
matplotlib
Question 11
Which of the following are informed search methods?
1
Best First Search
2
A* Search
3
Memory Bound Heuristic Search
4
All of the above
Question 12
Which of the following search method takes less memory space?
1
Depth First Search
2
Best First Search
3
Optimal Search
4
Linear Search