Description : Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search
Last Answer : a) Informed search
Description : What is the general term of Blind searching? a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) Heuristic Search
Last Answer : b) Uninformed Search
Description : Which search strategy is also called as blind search? a) Uninformed search b) Informed search c) Simple reflex search d) All of the mentioned
Last Answer : a) Uninformed search
Description : Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search
Last Answer : d) Informed & Heuristic Search
Description : _______________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) All of the mentioned
Last Answer : a) Constraints Satisfaction Problems
Description : Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned
Last Answer : d) All of the mentioned
Description : How many types are available in uninformed search method? a) 3 b) 4 c) 5 d) 6
Last Answer : c) 5
Description : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable
Last Answer : a) Evaluation function returning lowest evaluation
Description : What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
Last Answer : b) Heuristic search
Description : List the various informed search strategy.
Last Answer : Best first search –greedy search ,A* search Memory bounded search-Iterative deepening A*search -simplified memory bounded A*search -Iterative improvement search –hill climbing -simulated annealing
Description : What is informed search?
Last Answer : One that uses problem – specific knowledge beyond the definition of the problem itself and it can find solutions more efficiently than an uninformed strategy.
Description : List the various search strategies.
Last Answer : a. BFS b. Uniform cost search c. DFS d. Depth limited search e. Iterative deepening search f. Bidirectional search
Description : List the performance measures of search strategies.
Last Answer : i. Completeness ii. Optimality iii. Time complexity iv. Space complexity
Description : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False
Last Answer : a) True
Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False
Last Answer : 1) Intersection Search
Description : Inheritance Search a) True b) False
Description : The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is ... also possible to go all the way to set of variable that caused failure. a) True b) False
Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False
Description : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False
Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False
Description : Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False
Last Answer : b) False
Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False
Description : Which of the following search strategy uses a problem specific knowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search
Last Answer : C : Heuristic Search
Description : Which of the following search strategy uses a problem specificknowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search
Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned
Description : A heuristic is a way of trying __________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than the other is d) All of the mentioned
Description : Which of the following strategies would NOT be effective at improving your communication competence? a) Recognize the people, objects, and situations remain stable over time b) Recognize that each ... frame of perception is unique c) Be active in perceiving d) Distinguish facts from inference
Last Answer : a) Recognize the people, objects, and situations remain stable over time
Description : Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
Last Answer : c) Metalevel state space
Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search
Last Answer : b) The entire tree so far been generated must be stored in BFS
Description : Question Long-Form: I have an interview for a new job next week and they have informed me that I will need to undergo a criminal records search. Where can I get one done and can I get it done for free?
Last Answer : You can get one done at your local police station. Just ask them to do it on you; however, it will not be free of charge, as all stations require a fee.
Description : Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : ... highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function
Last Answer : A : Evaluation function returning lowest evaluation
Description : Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search
Last Answer : (D) Depth first search
Description : Speech Segmentation is a subtask of Speech Recognition. a) True b) False
Description : IR (information Retrieval) and IE (Information Extraction) are the two same thing. a) True b) False
Description : OCR (Optical Character Recognition) uses NLP. a) True b) False
Description : Natural Language generation is the main task of Natural language processing. a) True b) False
Description : Given a stream of text, Named Entity Recognition determines which pronoun maps to which noun. a) False b) True
Last Answer : a) False
Description : The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False
Description : Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False
Description : NLP is concerned with the interactions between computers and human (natural) languages. a) True b) False
Description : Decision Trees can be used for Classification Tasks. a) True b) False
Description : Decision Tree is a display of an algorithm. a) True b) False
Description : A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0. a) True b) False c) Sometimes – it can also output intermediate values as well d) Can’t say
Description : Like relational databases there does exists fuzzy relational databases. a) True b) False
Description : Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai. a) True b) False
Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False
Description : Traditional set theory is also known as Crisp Set theory. a) True b) False