Recent questions tagged artificial-intelligence

+3 votes

1 answer

1

UGCNET-Dec2013-III-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

asked Jul 27, 2016 in Knowledge Representation by jothee Veteran (105k points) | 468 views

+1 vote

1 answer

2

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

asked Jul 22, 2016 in Others by jothee Veteran (105k points) | 272 views

+1 vote

1 answer

3

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 ... search that can reduce the difference a bidirectional search that can reduce the difference an operator that can reduce the difference

asked Jul 22, 2016 in Others by jothee Veteran (105k points) | 408 views

+1 vote

1 answer

4

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

asked Jul 22, 2016 in Others by jothee Veteran (105k points) | 522 views

+2 votes

2 answers

5

UGCNET-June2013-III-72
Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation? Semantic network Frames Scripts Conceptual Dependency

asked Jul 19, 2016 in Knowledge Representation by jothee Veteran (105k points) | 539 views

+2 votes

1 answer

6

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

asked Jul 19, 2016 in Others by jothee Veteran (105k points) | 415 views

+3 votes

1 answer

7

UGCNET-June2013-III-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):- !.

asked Jul 19, 2016 in Others by jothee Veteran (105k points) | 365 views

+1 vote

1 answer

8

UGCNET-Dec2012-III-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

asked Jul 13, 2016 in IS&Software Engineering by jothee Veteran (105k points) | 746 views

+1 vote

1 answer

9

UGCNET-Dec2012-III-67
An expert system shell is an expert system without domain knowledge explanation facility reasoning with knowledge all of the above

asked Jul 13, 2016 in Others by jothee Veteran (105k points) | 500 views

0 votes

1 answer

10

UGCNET-Dec2012-III-9 Neural Networks
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 ... single layer perception OR can be solved using single layer perception and XOR problem can be solved using radial basis function

asked Jul 12, 2016 in Others by jothee Veteran (105k points) | 853 views

+1 vote

1 answer

11

UGCNET- June2016-III-75
A software program that infers and manipulates existing knowledge in order to generate new knowledge is known as: Data Dictionary Reference Mechanism Inference Engine Control Strategy

asked Jul 11, 2016 in Others by Sanjay Sharma Boss (49.6k points) | 644 views

+2 votes

4 answers

12

UGCNET-June2016-III-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

asked Jul 11, 2016 in Others by Abdul Majeed (27 points) | 2k views

0 votes

2 answers

13

UGCNET-June2014-III-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

asked Jul 9, 2016 in Algorithms by makhdoom ghaya Boss (40.4k points) | 488 views

0 votes

2 answers

14

UGCNET-June2014-III-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 additional cost of getting from the current node $N$ to the goal node. Then $f( ... in which one of the following algorithms ? $A^{*}$algorithm $AO^{*}$ algorithm Greedy best first search algorithm Iterative $A^{*}$ algorithm

asked Jul 9, 2016 in Algorithms by makhdoom ghaya Boss (40.4k points) | 579 views

0 votes

2 answers

15

UGCNET-June2014-III-30
Slots and facets are used in Semantic Networks Frames Rules All of these

asked Jul 9, 2016 in Others by makhdoom ghaya Boss (40.4k points) | 559 views

0 votes

2 answers

16

UGCNET-June2014-III-28
Match the following : LIST-I LIST-II a. Expert systems i. Pragmatics b. Planning ii. Resolution c. Prolog iii. Means-end analysis d. Natural language processing iv. Explanation facility 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

asked Jul 9, 2016 in Others by makhdoom ghaya Boss (40.4k points) | 372 views

+3 votes

1 answer

17

UGCNET-June2012-III-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), !, call(P). if- ... . if-else (G, P, $\theta$):-call(G), call(P), !. if-else (G,P, $\theta$) :- call($\theta$). All of the above

asked Jul 7, 2016 in IS&Software Engineering by jothee Veteran (105k points) | 331 views

+1 vote

1 answer

18

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 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$

asked Jul 7, 2016 in Others by jothee Veteran (105k points) | 687 views

+2 votes

1 answer

19

UGCNET-June2012-III-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

asked Jul 6, 2016 in Machine Learning by jothee Veteran (105k points) | 482 views

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 questions tagged artificial-intelligence

Recent Posts

Recent Blog Comments