Home » Aptitude Questions and Answers » AI Aptitude Questions

# Artificial Intelligence Searching Problem Aptitude Questions and Answers (MCQ)

**Aptitude Questions and Answers (MCQ) | Searching Problem**: This section contains aptitude questions and answers on Searching Problem in Artificial Intelligence.

Submitted by Monika Sharma, on March 30, 2020

- Random Search
- Depth First Search
- Breadth First Search
- Best First Search

**Options:**

"The search first begins from the root node and the first one of the child node’s sub-tree is completely traversed. That is, first all the one-sided nodes are checked, and then the other sided nodes are checked."

Which search algorithm is described in the above definition?

"In AI search algorithms, we look for a solution which provides us the most optimized way in terms of both time and cost to reach from the current state to the Goal State."

State whether the above condition is true or false?

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.