Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy
Last Answer : c) Graph-Plan
Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms
Last Answer : d) MIN/MAX Algorithms
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 : Differentiate BFS & DFS.
Last Answer : BFS means breath wise search. Space complexity is more. Do not give optimal solution Queuing fn is same as that of queue operator DFS means depth wise search. Space complexity is less Gives optimal solution Queuing fn is somewhat different from queue operator.
Description : Algorihtm used for path planning is A : Dijkstra's Algorithm B : DFS Algorithm C : BFS Algorithm D : Searching Algorithm
Last Answer : A : Dijkstra's Algorithm
Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)
Last Answer : a) O(bd+1) and O(bd+1)
Description : In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) Searchable state spaces d) All of the mentioned
Last Answer : b) Reversible state spaces
Description : Give the drawback of DFS.
Last Answer : The drawback of DFS is that it can get stuck going down the wrong path. Many problems have very deep or even infinite search tree. So dfs will never be able to recover from an unlucky choice at ... the top of the tree. So DFS should be avoided for search trees with large or infinite maximum depths
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 : Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned
Last Answer : b) When all step costs are equal
Description : Which data structure conveniently used to implement BFS? a) Stacks b) Queues c) Priority Queues d) All of the mentioned
Last Answer : b) Queues
Description : Which suggests the existence of an efficient recursive algorithm for online smoothing? a) Matrix b) Constant space c) Constant time d) None of the mentioned
Last Answer : b) Constant space
Description : A BFS of a LPP is said to be ______ if at least one of the basic variable is zero a. Degenerate b. Non-degenerate c. Infeasible d. unbounded
Last Answer : a. Degenerate
Description : Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space
Last Answer : d) Less memory & Finds a solution in large infinite space
Description : The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest
Last Answer : b) Game Tree
Description : What are the two data structures that make IR systems efficient?
Last Answer : i. Lexicon ii.Inverted Index
Description : What are the algorithms to have efficient parsing?
Last Answer : i. Left to right parsing algorithm ii. Chart Parsing algorithm. iii. Left corner parsing
Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}
Last Answer : Answer: A
Description : Automated vehicle is an example of ______ a) Supervised learning b) Unsupervised learning c) Active learning d) Reinforcement learning
Last Answer : a) Supervised learning
Description : LIFO is ______ where as FIFO is ________ a) Stack, Queue b) Queue, Stack c) Priority Queue, Stack d) Stack. Priority Queue
Last Answer : a) Stack, Queue
Description : Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest
Last Answer : a) Shallowest
Description : Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost
Last Answer : c) Deepest
Description : The process of removing detail from a given state representation is called ______ a) Extraction b) Abstraction c) Information Retrieval d) Mining of data
Last Answer : b) Abstraction
Description : Automated vehicle is an example of ______. a) Supervised learning b) Unsupervised learning c) Active learning d) Reinforcement learning
Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned
Last Answer : c) Fuzzy Set
Description : Apple siri is a good example of ______ AI. A. Narrow AI B. General AI C. Neural AI D. None of above
Last Answer : A. Narrow AI
Description : Human to Machine is _____ and Machine to Machine is ______. A. Process, Process B. Process, Program C. Program, Hardware D. Program, Program
Last Answer : C. Program, Hardware
Description : ______ that deals with the interaction between computers and humans using the natural language A. LISP B. ELIZA C. PROLOG D. NLP
Last Answer : D. NLP
Description : Symbols, symbolic expressions and computing with those is at the core of ______ A. LISP B. ELIZA C. PROLOG D. NLP
Last Answer : A. LISP A. LISP
Description : ______ is used for AI because it supports the implementation of software that computes with symbols very well. A. LISP B. ELIZA C. PROLOG D. NLP
Last Answer : A. LISP
Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic
Last Answer : C. Predicate calculus
Description : Communication between man and machine is related with ______ A. LISP B. ELIZA C. All of above D. None of above
Last Answer : B. ELIZA
Description : ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical
Last Answer : A. Heuristic
Description : ______ is a branch of computer science which deals with helping machines finds solutions to complex problems in a more human like fashions A. Artificial Intelligence B. Internet of Things C. Embedded System D. Cyber Security
Last Answer : A. Artificial Intelligence
Description : Would you call DFS on this woman?
Last Answer : By the way, her husband was screaming at her that it was her fault and she was obviously bawling. She is a good person and has been a good neighbor as well.
Description : Where can I find the best deal on a DFS sofa?
Last Answer : You can get DFS sofas at many furniture stores, including Raymore and Flannigan, but you'll have to wait for the best deal until the Summer sales.
Description : What exactly is DFS furniture?
Last Answer : DFS furniture is a furniture store based in the UK. They have sofas, beds, furniture for the outdoors, living room and more. http://www.dfs-furniture.co.uk/
Description : Where is DFS furniture located?
Last Answer : DFS furniture is located in the UK. Go to http://www.dfs.co.uk/find-a-store/?location=&x=0&y=0 to find a specific location.
Description : _________ is a web programming model for scalable data processing on large clusters over large data sets a) MapReduce b) HDFS c) GFS d) DFS
Last Answer : MapReduce
Description : In Hadoop, the files are stored in a) Directory b) DFS c) GFS d) HDFS
Last Answer : HDFS
Description : Is it odd my cousin keeps making plans with my bf's group of friends?
Last Answer : answer:My take, she probably doesn't have a huge social group at the moment. She just got out of a long relationship, and typically in long relationships your friendships will suffer at least a bit, especially ... she'll move on. Be a good cousin and help her out til one of those comes to fruition.
Description : What is the full form of BFS ?
Last Answer : The full form of BFA is Bangladesh Fire Service.
Description : . ___________ was built primarily as the fundamental storage service for Google’s search engine. a) BFS b) HDFS c) GFS d) GAE
Last Answer : 200 TB
Description : ___________ was built primarily as the fundamental storage service for Google’s search engine. a) BFS b) HDFS c) GFS d) GAE
Last Answer : GFS
Description : BFS in LPP stands for: a. Best Feasible solution b. Better feasible solution c. Basic feasible solution d. None of the above
Last Answer : c. Basic feasible solution
Description : What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned
Description : Write the time & space complexity associated with depth limited search.
Last Answer : Time complexity =O (bd) , b-branching factor, d-depth of tree Space complexity=o (bl)
Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned
Last Answer : c) Small search space
Description : What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state
Last Answer : a) An initial state and one or more goal states
Description : What is the name for space inside which a robot unit operates? a) environment b) spatial base c) work envelope d) exclusion zone
Last Answer : c) work envelope