Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged artificial-intelligence
1
vote
2
answers
61
UGC NET CSE | December 2015 | Part 3 | Question: 45
Reasoning strategies used in expert systems include Forward chaining, backward chaining and problem reduction Forward chaining, backward chaining and boundary mutation Forward chaining, backward chaining and back propagation Forward chaining, problem reduction and boundary mutation
go_editor
asked
in
Artificial Intelligence
Aug 11, 2016
by
go_editor
2.5k
views
ugcnetcse-dec2015-paper3
artificial-intelligence
expert-system
3
votes
2
answers
62
UGC NET CSE | December 2015 | Part 3 | Question: 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
go_editor
asked
in
Artificial Intelligence
Aug 9, 2016
by
go_editor
5.6k
views
ugcnetcse-dec2015-paper3
artificial-intelligence
chaining
3
votes
1
answer
63
UGC NET CSE | December 2014 | Part 3 | Question: 72
Match the following learning modes $w.r.t$. characteristics of available information for learning : a. Supervised i. Instructive information on desired responses, explicitly specified by a teacher. b. Recording ii. A priori design information for memory storing c. Reinforcement ... Codes : a b c d i ii iii iv i iii ii iv ii iv iii i ii iii iv i
makhdoom ghaya
asked
in
Artificial Intelligence
Aug 2, 2016
by
makhdoom ghaya
4.7k
views
ugcnetcse-dec2014-paper3
artificial-intelligence
machine-learning
3
votes
1
answer
64
UGC NET CSE | Junet 2015 | Part 3 | Question: 59
Match the following with respect to heuristic search techniques $:$ ... $\text{(a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)}$
go_editor
asked
in
Artificial Intelligence
Aug 1, 2016
by
go_editor
2.9k
views
ugcnetcse-june2015-paper3
artificial-intelligence
2
votes
1
answer
65
UGC NET CSE | Junet 2015 | Part 3 | Question: 56
Match the following knowledge representation techniques with their applications $:$ ... $\text{(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)}$
go_editor
asked
in
Artificial Intelligence
Aug 1, 2016
by
go_editor
1.7k
views
ugcnetcse-june2015-paper3
artificial-intelligence
3
votes
1
answer
66
UGC NET CSE | Junet 2015 | Part 3 | Question: 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
go_editor
asked
in
Artificial Intelligence
Jul 31, 2016
by
go_editor
2.4k
views
ugcnetcse-june2015-paper3
artificial-intelligence
1
vote
1
answer
67
UGC NET CSE | December 2014 | Part 3 | Question: 59
Match the following components of an expert system $:$ ... $\text{a-i, b-iii, c-ii, d-iv}$ $\text{a-iv, b-i, c-iii, d-ii}$
makhdoom ghaya
asked
in
Data Mining and Warehousing
Jul 30, 2016
by
makhdoom ghaya
3.2k
views
ugcnetcse-dec2014-paper3
artificial-intelligence
expert-system
0
votes
0
answers
68
UGC NET CSE | December 2014 | Part 3 | Question: 58
Match the following $:$ ... $\text{a-ii, b-iii, c-iv, d-i}$ $\text{a-i, b-iii, c-iv, d-ii}$
makhdoom ghaya
asked
in
Data Mining and Warehousing
Jul 30, 2016
by
makhdoom ghaya
2.4k
views
ugcnetcse-dec2014-paper3
artificial-intelligence
knowledge-representation
3
votes
3
answers
69
UGC NET CSE | December 2014 | Part 3 | Question: 56
An $A^{*}$ algorithm is a heuristic search technique which Is like a depth-first search where most promising child is selected for expansion Generates all successor nodes and computes an estimate of distance (cost) from start node ... (costs) from start node to all generated nodes and chooses shortest path for further expansion. None of the above
makhdoom ghaya
asked
in
Others
Jul 30, 2016
by
makhdoom ghaya
2.7k
views
ugcnetcse-dec2014-paper3
artificial-intelligence
searching
1
vote
1
answer
70
UGC NET CSE | December 2013 | Part 3 | Question: 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. ... up to establish the precondition of operators is called backward planning goal stack planning operator subgoaling operator overloading
go_editor
asked
in
Artificial Intelligence
Jul 28, 2016
by
go_editor
2.8k
views
ugcnetcse-dec2013-paper3
artificial-intelligence
2
votes
1
answer
71
UGC NET CSE | December 2013 | Part 3 | Question: 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
go_editor
asked
in
Artificial Intelligence
Jul 27, 2016
by
go_editor
1.8k
views
ugcnetcse-dec2013-paper3
artificial-intelligence
heuristic-search
3
votes
1
answer
72
UGC NET CSE | December 2013 | Part 3 | Question: 23
High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences? Morphological Syntactic Semantic Pragmatic
go_editor
asked
in
Data Mining and Warehousing
Jul 27, 2016
by
go_editor
2.5k
views
ugcnetcse-dec2013-paper3
artificial-intelligence
knowledge-representation
1
vote
1
answer
73
UGC NET CSE | September 2013 | Part 3 | Question: 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
go_editor
asked
in
Artificial Intelligence
Jul 22, 2016
by
go_editor
1.5k
views
ugcnetcse-sep2013-paper3
artificial-intelligence
linear-programming
1
vote
1
answer
74
UGC NET CSE | September 2013 | Part 3 | Question: 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 ... can reduce the difference a bidirectional search that can reduce the difference an operator that can reduce the difference
go_editor
asked
in
Artificial Intelligence
Jul 22, 2016
by
go_editor
3.6k
views
ugcnetcse-sep2013-paper3
artificial-intelligence
means-end
analysis
1
vote
1
answer
75
UGC NET CSE | September 2013 | Part 3 | Question: 5
The Blocks World Problem in Artificial Intelligence is normally discussed to explain a Search technique Planning system Constraint satisfaction system Knowledge base system
go_editor
asked
in
Artificial Intelligence
Jul 22, 2016
by
go_editor
4.3k
views
ugcnetcse-sep2013-paper3
artificial-intelligence
blocks-world-problem
3
votes
2
answers
76
UGC NET CSE | June 2013 | Part 3 | Question: 72
Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation? Semantic network Frames Scripts Conceptual Dependency
go_editor
asked
in
Data Mining and Warehousing
Jul 19, 2016
by
go_editor
12.5k
views
ugcnetcse-june2013-paper3
artificial-intelligence
knowledge-representation
2
votes
1
answer
77
UGC NET CSE | June 2013 | Part 3 | Question: 71
The map colouring problem can be solved using which of the following technique? Means-end analysis Constraint satisfaction AO* search Breadth first search
go_editor
asked
in
Artificial Intelligence
Jul 19, 2016
by
go_editor
3.1k
views
ugcnetcse-june2013-paper3
artificial-intelligence
map-coloring
3
votes
0
answers
78
UGC NET CSE | June 2013 | Part 3 | Question: 67
Which one of the following is the correct implementation of the meta-predicate “not” 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):- !.
go_editor
asked
in
Artificial Intelligence
Jul 19, 2016
by
go_editor
1.2k
views
ugcnetcse-june2013-paper3
artificial-intelligence
prolog
1
vote
1
answer
79
UGC NET CSE | December 2012 | Part 3 | Question: 74
A* algorithm is guaranteed to find an optimal solution if h’ is always 0 g is always 1 h’ never overestimates h h’ never underestimates h
go_editor
asked
in
IS&Software Engineering
Jul 13, 2016
by
go_editor
3.0k
views
ugcnetcse-dec2012-paper3
artificial-intelligence
1
vote
1
answer
80
UGC NET CSE | December 2012 | Part 3 | Question: 67
An expert system shell is an expert system without domain knowledge explanation facility reasoning with knowledge all of the above
go_editor
asked
in
Artificial Intelligence
Jul 13, 2016
by
go_editor
2.7k
views
ugcnetcse-dec2012-paper3
artificial-intelligence
expert-system
1
vote
1
answer
81
UGC NET CSE | December 2012 | Part 3 | Question: 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 ... single layer perception OR can be solved using single layer perception and XOR problem can be solved using radial basis function
go_editor
asked
in
Artificial Intelligence
Jul 12, 2016
by
go_editor
2.6k
views
ugcnetcse-dec2012-paper3
artificial-intelligence
neural-network
2
votes
3
answers
82
UGC NET CSE | June 2016 | Part 3 | Question: 73
Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning? $I$ $HI$ $CHI$ $GHI$
Abdul Majeed
asked
in
Others
Jul 11, 2016
by
Abdul Majeed
5.2k
views
ugcnetcse-june2016-paper3
artificial-intelligence
alpha-beta-pruning
0
votes
2
answers
83
UGC NET CSE | June 2014 | Part 3 | Question: 33
________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. Best first search Goal stack planning Alpha-beta pruning procedure Min-max search
makhdoom ghaya
asked
in
Algorithms
Jul 9, 2016
by
makhdoom ghaya
3.1k
views
ugcnetjune2014iii
artificial-intelligence
algorithms
0
votes
2
answers
84
UGC NET CSE | June 2014 | Part 3 | Question: 31
Consider $f(N) = g(N) + h(N)$ Where function $g$ is a measure of the cost of getting from the start node to the current node. $N$ and $h$ is an estimate of the additional cost of getting from the current node $N$ to ... one of the following algorithms? $A^{*}$algorithm $AO^{*}$ algorithm Greedy best first search algorithm Iterative $A^{*}$ algorithm
makhdoom ghaya
asked
in
Algorithms
Jul 9, 2016
by
makhdoom ghaya
3.0k
views
ugcnetjune2014iii
artificial-intelligence
algorithms
0
votes
2
answers
85
UGC NET CSE | June 2014 | Part 3 | Question: 30
Slots and facets are used in Semantic Networks Frames Rules All of these
makhdoom ghaya
asked
in
Artificial Intelligence
Jul 9, 2016
by
makhdoom ghaya
3.5k
views
ugcnetjune2014iii
artificial-intelligence
0
votes
2
answers
86
UGC NET CSE | June 2014 | Part 3 | Question: 28
Match the following $:$ ... $\text{a-i, b-ii, c-iii, d-iv}$ $\text{a-iv, b-iii, c-ii, d-i}$
makhdoom ghaya
asked
in
Artificial Intelligence
Jul 9, 2016
by
makhdoom ghaya
2.3k
views
ugcnetjune2014iii
artificial-intelligence
3
votes
1
answer
87
UGC NET CSE | June 2012 | Part 3 | Question: 23
Which of the following prolog programs correctly implement if G succeeds then execute goal P else execute goal $\theta$ ? if-else (G, P, $\theta$):-!,call(G), call(P). if-else (G,P, $\theta$) :- call($\theta$). if-else (G, P, $\theta$):-call(G), !, ... (G, P, $\theta$):-call(G), call(P), !. if-else (G,P, $\theta$) :- call($\theta$). All of the above
go_editor
asked
in
IS&Software Engineering
Jul 7, 2016
by
go_editor
1.2k
views
ugcnetcse-june2012-paper3
artificial-intelligence
1
vote
2
answers
88
UGC NET CSE | June 2012 | Part 3 | Question: 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 ... . To find a path involving the fewest number of steps, we should test, $g=1$ $g=0$ $h'=0$ $h'=1$
go_editor
asked
in
Artificial Intelligence
Jul 7, 2016
by
go_editor
4.4k
views
ugcnetcse-june2012-paper3
artificial-intelligence
3
votes
2
answers
89
UGC NET CSE | June 2012 | Part 3 | Question: 2
In Delta Rule for error minimization weights are adjusted w.r.to change in the output weights are adjusted w.r.to difference between desired output and actual output weights are adjusted w.r.to difference between output and output none of the above
go_editor
asked
in
Artificial Intelligence
Jul 6, 2016
by
go_editor
5.1k
views
ugcnetcse-june2012-paper3
artificial-intelligence
machine-learning
Page:
« prev
1
2
3
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged artificial-intelligence
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...