# Recent questions and answers in Artificial Intelligence

1
Which of the following is NOT true in problem solving in artificial intelligence? Implements heuristic search technique Solution steps are not explicit Knowledge is imprecise It works on or implements repetition mechanism
2
In artificial Intelligence (AI), an environment is uncertain if it is ___ Not fully observable and not deterministic Not fully observable or not deterministic Fully observable but not deterministic Not fully observable but deterministic
3
A neuron with $3$ inputs has the weight vector $\begin{bmatrix} 0.2 & -0.1 & 0.1 \end{bmatrix}^{T}$ and a bias $\theta =0.$ If the input vector is $X=\begin{bmatrix} 0.2 & 0.4 & 0.2 \end{bmatrix}^{T}$ then the total input to the neuron is: $0.20$ $1.0$ $0.02$ $-1.0$
1 vote
4
Consider the following: Evolution Selection Reproduction Mutation Which of the following are found in genetic algorithms? b, c and d only b and d only a, b, c and d a, b and d only
1 vote
5
A fuzzy conjunction operator denoted as $t(x,y)$ and a fuzzy disjunction operator denoted as $s(x,y)$ form a dual pair if they satisfy the condition: $t(x,y) = 1-s(x,y)$ $t(x,y) = s(1-x,1-y)$ $t(x,y) = 1-s(1-x,1-y)$ $t(x,y) = s(1+x,1+y)$
1 vote
6
Reinforcement learning can be formalized in terms of ____ in which the agent initially only knows the set of possible _____ and the set of possible actions. Markov decision processes, objects Hidden states, objects Markov decision processes, states objects, states
7
The value of the derivative of Sigmoid function given by $f(x)=\dfrac{1}{1+e^{-2x}}$ at $x=0$ is $0$ $\frac{1}{2}$ $\frac{1}{4}$ $\infty$
1 vote
8
Math List-I with List-II: ... ) ; (b) - (ii); (c) - (i) (a) - (i) ; (b) - (iii); (c) - (ii) (a) - (ii) ; (b) - (iii); (c) - (i)
9
Consider the game tree given below: Here $\bigcirc$ and $\Box$ represents MIN and MAX nodes respectively. The value of the root node of the game tree is $4$ $7$ $11$ $12$
10
Which of the following is an example of unsupervised neural network? Back-propagation network Hebb network Associative memory network Self-organizing feature map
1 vote
11
The STRIPS representation is a feature-centric representation an action-centric representation a combination of feature-centric and action-centric representations a hierarchical feature-centric representation
12
In artificial Intelligence (AI), a simple reflex agent selects actions on the basis of ___ current percept, completely ignoring rest of the percept history rest of the percept history, completely ignoring the current percept both current percept and complete percept history both current percept and just previous percept
13
Consider the following two sentences: The planning graph data structure can be used to give a better heuristic for a planning problem Dropping negative effects from every action schema in a planning problem results in a relaxed problem Which of the following is correct with respect ... a and sentence b are true Sentence a is true but sentence b is false Sentence a is false but sentence b is true
14
Consider following sentences regarding $A^*$, an informed search strategy in Artificial Intelligence (AI). $A^*$ expands all nodes with $f(n)<C^*$ $A^*$ expands no nodes with $f(n) \geq C^*$ Pruning is integral to $A^*$ Here, $C^*$ is the cost of ... statement b are true Both statements a and statement c are true Both statements b and statement c are true All the statements a, b and c are true
15
In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics $h_1 \dots h_m$ is available for a problem and none of them dominates any of the others, which should we choose? $h(n)=max\{h_1(n), \dots , h_m(n)\}$ $h(n)=min\{h_1(n), \dots , h_m(n)\}$ $h(n)=avg\{h_1(n), \dots , h_m(n)\}$ $h(n)=sum\{h_1(n), \dots , h_m(n)\}$
16
Slots and facets are used in Semantic Networks Frames Rules All of these
17
Match the following : \begin{array}{|l|l|l||l|} \hline&\textbf{List-I} & & \textbf{List-II} \\\hline \text{a.} & \text{Expert systems}& \text{i.} & \text{Pragmatics} \\\hline \text{b.} & \text{Planning}& \text{ii.} & \text{Resolution} \\\hline \text{c.} & \text{Prolog}& \text{iii.} & \text{means- ... array} a-iii, b-iv, c-i, d-ii a-iii, b-iv, c-ii, d-i a-i, b-ii, c-iii, d-iv a-iv, b-iii, c-ii, d-i
18
Which one of the following describes the syntax of prolog program? Rules and facts are terminated by full stop(.) Rules and facts are terminated by semi colon(;) Variables names must start with upper case alphabets. Variables names must start with lower case alphabets. I, II III, IV I, III II, IV
19
Perceptron learning, Delta learning and $LMS$ learning are learning methods which falls under the category of Error correction learning - learning with a teacher Reinforcement learning - learning with a critic Hebbian learning Competitive learning - learning without a teacher
20
Hi I need some useful resources of AI for upcoming UGC NET exam. Currently, I am reading from Rich and Knight, Is it enough? Please let me know about any good quality books or video lectures.
21
22
Consider the two class classification task that consists of the following points: Class $C_1: [-1, -1], [-1, 1], [1, -1]$ Class $C_2: [1,1]$ The decision boundary between the two classes $C_1$ and $C_2$ using single perception is given by: $x_1-x_2-0.5=0$ $-x_1-x_2-0.5=0$ $0.5(x_1+x_2)-1.5=0$ $x_1+x_2-0.5=0$
23
Language model used in LISP is Functional programming Logic programming Object oriented programming All of the above
24
Forward chaining systems are ____ where as backward chaining systems are ____ Data driven, Data driven Goal driven, Data driven Data driven, Goal driven Goal driven, Goal driven
25
Match the following knowledge representation techniques with their applications: ... , c-i, d-ii a-iii, b-iv, c-ii, d-i a-iv, b-iii, c-i, d-ii a-iv, b-iii, c-ii, d-i
26
Match the following with respect to heuristic search techniques: ... , c-iii, d-ii a-iv, b-i, c-ii, d-iii a-iii, b-iv, c-i, d-ii a-iv, b-ii, c-i, d-iii
27
Which of the following is false for the programming language PROLOG? A PROLOG variable can only be assigned to a value once PROLOG is a strongly typed language The scope of a variable in PROLOG is a single clause or rule The scope of a variable in PROLOG is a single query
1 vote
28
The mean-end analysis process centers around the detection of differences between the current state and goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator cannot be ... goals are set up to establish the precondition of operators is called backward planning goal stack planning operator subgoaling operator overloading
29
If h* represents an estimate from the cost of getting from the current node N to the goal node and h represents actual cost of getting from the current node to the goal node, then A* algorithm gives an optimal solution if h* is equal to h h* overestimates h h* underestimates h none of these
1 vote
30
If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is Alternative solution Infeasible solution Unbounded solution Degenerate solution
1 vote
31
Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the difference one applies a forward search that can reduce the difference a backward search that can reduce the difference a bidirectional search that can reduce the difference an operator that can reduce the difference
1 vote
32
The Blocks World Problem in Artificial Intelligence is normally discussed to explain a Search technique Planning system Constraint satisfaction system Knowledge base system
33
Which one of the following is the correct implementation of the meta-predicate &ldquo;not&rdquo; in PROLOG (Here G represents a goal)? not(G):- !, call(G), fail. not(G). not(G):- call(G), !, fail. not(G). not(G):- call(G), fail, !, not(G). not(G):- call(G), !, fail.not(G):- !.
34
The map colouring problem can be solved using which of the following technique? Means-end analysis Constraint satisfaction AO* search Breadth first search
1 vote
35
An expert system shell is an expert system without domain knowledge explanation facility reasoning with knowledge all of the above
36
You are given an OR problem and XOR problem to solve. Then, which one of the following statements is true? Both OR and XOR problems can be solved using single layer perception OR can be solved using single layer perception and XOR problem can be ... be solved using single layer perception OR can be solved using single layer perception and XOR problem can be solved using radial basis function
1 vote
$A^*$ algorithm uses $f’=g+h’$ to estimate the cost of getting from the initial state to the goal state, where $g$ is a measure of cost getting from initial state to the current node and the function $h’$ is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should test, $g=1$ $g=0$ $h’=0$ $h’=1$