menu
search
Log In

RANK Predictor for GATE 2021

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects


Gatecse
Recent questions and answers in Artificial Intelligence

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions and answers in Artificial Intelligence

0 votes
0 answers
1
UGCNET-Oct2020-II: 36
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
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
asked Nov 20, 2020 in Artificial Intelligence jothee 79 views
0 votes
3 answers
2
UGCNET-July-2018-II: 71
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
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
answered Nov 10, 2020 in Artificial Intelligence abhishek tiwary 807 views
0 votes
0 answers
3
UGCNET-Jan2017-III: 72
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$
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$
asked Mar 24, 2020 in Artificial Intelligence jothee 181 views
1 vote
2 answers
4
UGCNET-June-2019-II: 97
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
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
answered Nov 28, 2019 in Artificial Intelligence Rashmi Ashutosh Vish 1.3k views
1 vote
1 answer
5
UGCNET-June-2019-II: 94
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)$
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)$
answered Nov 15, 2019 in Artificial Intelligence hashida 1.4k views
1 vote
1 answer
6
UGCNET-June-2019-II: 100
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
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
answered Sep 13, 2019 in Artificial Intelligence Nbhardwaj 676 views
2 votes
1 answer
7
UGCNET-June-2019-II: 99
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$
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$
answered Aug 31, 2019 in Artificial Intelligence nirban.das 839 views
1 vote
1 answer
8
UGCNET-June-2019-II: 92
Math List-I with List-II: ... (ii); (c) - (i) (a) - (i) ; (b) - (iii); (c) - (ii) (a) - (ii) ; (b) - (iii); (c) - (i)
Math List-I with List-II: ... ) ; (b) - (ii); (c) - (i) (a) - (i) ; (b) - (iii); (c) - (ii) (a) - (ii) ; (b) - (iii); (c) - (i)
answered Jul 12, 2019 in Artificial Intelligence Sanjay Sharma 720 views
2 votes
1 answer
9
UGCNET-June-2019-II: 91
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$
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$
answered Jul 11, 2019 in Artificial Intelligence Sanjay Sharma 1.2k views
2 votes
1 answer
10
UGCNET-June-2019-II: 98
Which of the following is an example of unsupervised neural network? Back-propagation network Hebb network Associative memory network Self-organizing feature map
Which of the following is an example of unsupervised neural network? Back-propagation network Hebb network Associative memory network Self-organizing feature map
answered Jul 6, 2019 in Artificial Intelligence Ram Swaroop 777 views
1 vote
1 answer
11
UGCNET-June-2019-II: 93
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
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
answered Jul 6, 2019 in Artificial Intelligence Ram Swaroop 1k views
0 votes
2 answers
12
UGCNET-July-2018-II: 72
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
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
answered Mar 6, 2019 in Artificial Intelligence shahidhope 839 views
0 votes
1 answer
13
UGCNET-July-2018-II: 78
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 ... sentence b are true Sentence a is true but sentence b is false Sentence a is false but sentence b is true
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
answered Jul 20, 2018 in Artificial Intelligence sunnykg 791 views
0 votes
1 answer
14
UGCNET-July-2018-II: 74
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 ... 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
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
answered Jul 15, 2018 in Artificial Intelligence shahidhope 912 views
0 votes
1 answer
15
UGCNET-July-2018-II: 73
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)\}$
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)\}$
answered Jul 15, 2018 in Artificial Intelligence shahidhope 1.1k views
0 votes
2 answers
16
UGCNET-June2014-III: 30
Slots and facets are used in Semantic Networks Frames Rules All of these
Slots and facets are used in Semantic Networks Frames Rules All of these
answered May 12, 2018 in Artificial Intelligence Prasanjeet Ghosh 2.3k views
0 votes
2 answers
17
UGCNET-June2014-III: 28
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. ... 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
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
answered May 12, 2018 in Artificial Intelligence Prasanjeet Ghosh 1.1k views
0 votes
2 answers
18
UGCNET-June2014-III: 14
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
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
answered May 12, 2018 in Artificial Intelligence Prasanjeet Ghosh 1.1k views
0 votes
2 answers
19
UGCNET-June2014-III: 09
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
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
answered May 12, 2018 in Artificial Intelligence Prasanjeet Ghosh 2.5k views
0 votes
1 answer
20
Required Artificial Intelligence resources for UGC NET
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.
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.
answered Mar 1, 2018 in Artificial Intelligence iarnav 1.5k views
2 votes
1 answer
22
UGCNET-Dec2015-III: 64
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$
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$
answered Jan 21, 2017 in Artificial Intelligence Sanjay Sharma 2.7k views
3 votes
1 answer
23
UGCNET-Dec2015-III: 46
Language model used in LISP is Functional programming Logic programming Object oriented programming All of the above
Language model used in LISP is Functional programming Logic programming Object oriented programming All of the above
answered Aug 11, 2016 in Artificial Intelligence sh!va 1.2k views
3 votes
1 answer
24
UGCNET-Dec2015-III: 8
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
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
answered Aug 9, 2016 in Artificial Intelligence Sanjay Sharma 3.1k views
2 votes
1 answer
25
UGCNET-June2015-III: 56
Match the following knowledge representation techniques with their applications: ... 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
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
answered Aug 1, 2016 in Artificial Intelligence Sanjay Sharma 946 views
3 votes
1 answer
26
UGCNET-June2015-III: 59
Match the following with respect to heuristic search techniques: ... -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
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
answered Aug 1, 2016 in Artificial Intelligence Sanjay Sharma 1.2k views
3 votes
1 answer
27
UGCNET-June2015-III: 23
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
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
answered Aug 1, 2016 in Artificial Intelligence Sanjay Sharma 1.2k views
1 vote
1 answer
28
UGCNET-Dec2013-III: 26
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 ... are set up to establish the precondition of operators is called backward planning goal stack planning operator subgoaling operator overloading
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
answered Jul 28, 2016 in Artificial Intelligence Sanjay Sharma 1.5k views
2 votes
1 answer
29
UGCNET-Dec2013-III: 25
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
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
answered Jul 27, 2016 in Artificial Intelligence Sanjay Sharma 1k views
1 vote
1 answer
30
UGCNET-Sep2013-III: 13
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
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
answered Jul 23, 2016 in Artificial Intelligence Sanjay Sharma 529 views
1 vote
1 answer
31
UGCNET-Sep2013-III: 6
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 ... that can reduce the difference a bidirectional search that can reduce the difference an operator that can reduce the difference
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
answered Jul 22, 2016 in Artificial Intelligence Sanjay Sharma 1.2k views
1 vote
1 answer
32
UGCNET-Sep2013-III: 5
The Blocks World Problem in Artificial Intelligence is normally discussed to explain a Search technique Planning system Constraint satisfaction system Knowledge base system
The Blocks World Problem in Artificial Intelligence is normally discussed to explain a Search technique Planning system Constraint satisfaction system Knowledge base system
answered Jul 22, 2016 in Artificial Intelligence sh!va 2k views
3 votes
1 answer
33
UGCNET-June2013-III: 67
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):- !.
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):- !.
answered Jul 20, 2016 in Artificial Intelligence sh!va 771 views
2 votes
1 answer
34
UGCNET-June2013-III: 71
The map colouring problem can be solved using which of the following technique? Means-end analysis Constraint satisfaction AO* search Breadth first search
The map colouring problem can be solved using which of the following technique? Means-end analysis Constraint satisfaction AO* search Breadth first search
answered Jul 19, 2016 in Artificial Intelligence sh!va 1.6k views
1 vote
1 answer
35
UGCNET-Dec2012-III: 67
An expert system shell is an expert system without domain knowledge explanation facility reasoning with knowledge all of the above
An expert system shell is an expert system without domain knowledge explanation facility reasoning with knowledge all of the above
answered Jul 13, 2016 in Artificial Intelligence shekhar chauhan 1.5k views
0 votes
1 answer
36
UGCNET-Dec2012-III: 9
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 ... using single layer perception OR can be solved using single layer perception and XOR problem can be solved using radial basis function
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
answered Jul 12, 2016 in Artificial Intelligence asu 1.6k views
1 vote
1 answer
37
UGCNET-June2012-III: 21
$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 ... goal state. To find a path involving the fewest number of steps, we should test, $g=1$ $g=0$ $h'=0$ $h'=1$
$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$
answered Jul 7, 2016 in Artificial Intelligence Sanjay Sharma 1.9k views
2 votes
3 answers
38
ISRO2011-2
Which of the following is an unsupervised neural network? RBS Hopfield Back propagation Kohonen
Which of the following is an unsupervised neural network? RBS Hopfield Back propagation Kohonen
answered Jun 21, 2016 in Artificial Intelligence naga praveen 2.9k views
0 votes
1 answer
40
Performance measure P
answered Apr 6, 2016 in Artificial Intelligence srestha 218 views
To see more, click for all the questions in this category.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...