Description : To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals
Last Answer : a) Forward Searching
Description : Consider a problem of preparing a schedule for a class of student. What type of problem is this? a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem
Last Answer : c) CSP
Description : Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) All of the mentioned
Last Answer : d) All of the mentioned
Description : Define constraint propagation.
Last Answer : It is the general term for propagating (i.e.) spreading the implications of constraints on the variable on to other variable.
Description : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned
Last Answer : b) Depth-first search algorithm
Description : What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned
Description : Define CSP.
Last Answer : Constraint Satisfaction problem (CSP) is defined by a set of variables X1,X2,…Xn and set of constraints C1,C2,…Cm.
Description : Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned
Last Answer : c) Learning element
Description : Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard
Last Answer : b) NP complete
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 : The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search
Last Answer : (B) Constraint satisfaction
Description : Which will solve the conjuncts of the rule so that the total cost is minimized? a) Constraint variable b) Conjunct ordering c) Data complexity d) All of the mentioned
Last Answer : b) Conjunct ordering
Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned
Description : Show the relationship of an entailment constraint.
Last Answer : Hypothesis ^ Descriptions |= classifications
Description : The CAI (Computer-Assisted Instruction) technique based on programmed instruction is __________ a) frame-based CAI b) generative CAI c) problem-solving CAI d) intelligent CAI
Last Answer : a) frame-based CAI
Description : List the steps involved in simple problem solving technique.
Last Answer : i. Goal formulation ii. Problem formulation iii. Search iv. Solution v. Execution phase
Description : Planning problem can be described as a propositional logic. a) True b) False
Last Answer : a) True
Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True 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 : What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the ... the network to allow weights to be adjusted so that the network can learn d) None of the mentioned
Last Answer : c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn
Description : A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming
Last Answer : a) Feed-forward neural network
Description : What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the ... network to allow weights to be adjusted so that the network can learn. d) None of the mentioned
Last Answer : c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn.
Description : Is the brain in th CSP system?
Last Answer : What is the answer ?
Description : Which technique is being investigated as an approach to automatic programming? a) generative CAI b) specification by example c) non-hierarchical planning d) all of the mentioned
Last Answer : b) specification by example
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
Description : An Artificial Intelligence technique that allows computers to understand associations and relationships between objects and events is called _____________ a) heuristic processing b) cognitive science c) relative symbolism d) pattern matching
Last Answer : c) relative symbolism
Description : A computer vision technique that relies on image templates is __________ a) edge detection b) binocular vision c) model-based vision d) robot vision
Last Answer : c) model-based vision
Description : A.M. turing developed a technique for determining whether a computer could or could not demonstrate the artificial Intelligence, Presently, this technique is called __________ a) Turing Test b) Algorithm c) Boolean Algebra d) Logarithm
Last Answer : a) Turing Test
Description : Membership function can be thought of as a technique to solve empirical problems on the basis of A. knowledge B. examples C. learning D. experience
Last Answer : D. experience
Description : An AI technique that allows computers to understand associations and relationships between objects and events is called: a. heuristic processing b. cognitive science c. relative symbolism d. pattern matching
Last Answer : d. pattern matching
Description : What are the types of clustering technique?
Last Answer : i. Agglomerative clustering ii. K-means clustering
Description : A.M. turing developed a technique for determining whether a computer could or could not demonstrate the artificial Intelligence,, Presently, this technique is called A. Turing Test B. Algorithm C. Boolean Algebra D. Logarithm E. None of the above
Last Answer : A. Turing Test
Description : Any ideas, modifies, changes, for this spa party?
Last Answer : answer:Get a photographer to come and do Fashion Glamor Girl Photos while they're all made up. The girls love the attention of a glamor shoot, and you can probably get a photographer to ... photogs looking for opportunities to make an honest buck. They will sell photos to the parents no doubt.
Description : What is a flattened stack of membrane that modifies sorts and package proteins?
Last Answer : Need answer
Description : Usually modifies a verb but can sometimes modify an adjective?
Last Answer : AdverbExample: She sings abnormally. (abnormally being the adverb, modifying sings)Example: Her singing is surprisingly abnormal. (surprisingly being the adverb, modifying abnormal, which is an adjective)adverbAn adverb usually modifies a verb, but can sometimes modify an adjective.
Description : What modifies nouns or pronouns?
Last Answer : A relative clause is used to modify nouns and pronouns.Examples:The cake that mother made is chocolate. (the relative clause 'that mother made' modifies the antecedent noun 'cake')They have a prize for ... the most points. (the relative clause 'who had the most points' modifies the pronoun 'you')
Description : _____and extensions are software that extends or modifies the functionality of another piece of software and require that software be used in order to function: a) Plugs Stan b) Plug outs c) Plugins d) None of These
Last Answer : c) Plugins
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
Last Answer : 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