Description : A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network
Last Answer : c) Transition Network
Description : The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False
Last Answer : a) True
Description : The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False
Description : A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges
Last Answer : A) vertices, edges
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
Last Answer : 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 is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned
Description : Frames in artificial intelligence is derived from semantic nets. 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 : Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks
Last Answer : d) Partitioned Networks
Description : One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. 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 : 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 : Define Similarity nets.
Last Answer : Similarity net is an approach for arranging models. Similarity net is a representation in which nodes denotes models, links connect similar models and links are tied to different descriptions.
Description : State true of false. i) A node is a parent if it has successor nodes. ii) A node is child node if out degree is one. A) True, True B) True, False C) False, True D) False, False
Last Answer : B) True, False
Description : State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True D) False, False
Last Answer : C) False, True
Description : Which of the following is not the promise of artificial neural network? a) It can explain result b) It can survive the failure of some nodes c) It has inherent parallelism d) It can handle noise
Last Answer : a) It can explain result
Description : In artificial Neural Network interconnected processing elements are called A. nodes or neurons B. weights C. axons D. Soma
Last Answer : A. nodes or neurons
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 (D) Only (a), (b) and (c).
Last Answer : (D) Only (a), (b) and (c).
Description : What is the consequence between a node and its predecessors while creating bayesian network? a) Functionally dependent b) Dependant c) Conditionally independent d) Both Conditionally dependant & Dependant
Last Answer : c) Conditionally independent
Description : What is the consequence between a node and its predecessors while creating Bayesian network? a) Conditionally dependent b) Dependent c) Conditionally independent d) Both a & b
Description : Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. ... have to be explicitly hand-coded d) False - just having a single perceptron is enough
Last Answer : c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded
Description : A network has 10 nodes and 17 branches. The number of different node pair voltage would be
Last Answer : A network has 10 nodes and 17 branches. The number of different node pair voltage would be 45.
Description : What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) ... branch represents outcome of test and each leaf node represents class label d) None of the mentioned
Last Answer : c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label
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 : A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical
Last Answer : A. Heuristic
Description : Semantic Network is also known as Frame networks. a) True b) False
Description : A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another. a) True b) False
Description : Consider the following statements: 1. Propagation of a nerve impulse in a myelinated nerve fibre is different from that of unmyelinated fibre. 2. The impulse actually travels by leaping through the nodes of Ranvier in an unmyelinated fibre 3. ... incorrect? (a) 1, 2 (b) 1, 3, 4 (c) 2 only (d) 2, 3
Last Answer : Ans:(d)
Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.
Last Answer : (C) Each i-node is 256-bytes long.
Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2
Last Answer : (C) (n-1)/2
Description : End Nodes are represented by __________ a) Disks b) Squares c) Circles d) Triangles
Last Answer : d) Triangles
Description : Chance Nodes are represented by __________ a) Disks b) Squares c) Circles d) Triangles
Last Answer : c) Circles
Description : Decision Nodes are represented by ____________ a) Disks b) Squares c) Circles d) Triangles
Last Answer : b) Squares
Description : Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes c) Chance Nodes d) All of the mentioned
Description : How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned
Last Answer : a) Depends on the nodes
Description : Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
Last Answer : b) Quality of heuristic function
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 search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search
Last Answer : a) Depth-limited search
Description : When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal
Description : Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median
Last Answer : C. Core, Support , Boundary
Description : With regard to the physics of power systems used operate robots, which statement or statements are most correct? a) hydraulics involves the compression of liquids b) hydraulics involves the compression of air c) pneumatics involve the compression of air d) chemical batteries produce AC power
Last Answer : c) pneumatics involve the compression of air
Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.
Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.
Description : What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : c) Path cost from start node to current node + Heuristic cost
Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : a) Heuristic function
Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost
Last Answer : c) The one closest to the goal node
Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost
Last Answer : c) Estimated cost of cheapest path from root to goal node
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