# Recent questions in Artificial Intelligence

1
The part of machine level instruction, which tells the central processor what has to be done, is Operation code Address Locator Flip-Flop
2
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$
3
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$
1 vote
4
Math List-I with List-II: ... ) ; (b) - (ii); (c) - (i) (a) - (i) ; (b) - (iii); (c) - (ii) (a) - (ii) ; (b) - (iii); (c) - (i)
1 vote
5
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
1 vote
6
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
7
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
8
Which of the following is an example of unsupervised neural network? Back-propagation network Hebb network Associative memory network Self-organizing feature map
9
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
10
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
11
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
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
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)\}$
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
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
16
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.
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$