Recent questions tagged artificial-intelligence

+3 votes

1 answer

1

UGCNET-Dec2014-III-72 Artifical intelligence
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 ... responses Codes : a b c d i ii iii iv i iii ii iv ii iv iii i ii iii iv i

asked Aug 2, 2016 in Others by makhdoom ghaya Boss (29.5k points) | 470 views

+3 votes

1 answer

2

UGCNET-June2015-III-59
Match the following with respect to heuristic search techniques: List-I List-II a. Steepest accent Hill Climbing i. Keeps track of all partial paths which can be candidate for further exploration b. Branch - and - bound ii. Discover problem state(s) that satisfy a set of constraints c. Constraint ... -iv, b-iii, c-ii, d-i a-iii, b-iv, c-i, d-ii a-iv, b-ii, c-i, d-iii

asked Aug 1, 2016 in Others by jothee Veteran (97.1k points) | 503 views

+2 votes

1 answer

3

UGCNET-June2015-III-56
Match the following knowledge representation techniques with their applications: List-I List-II a. Frames i. Pictorial representation of objects, their attributes and relationships b. Conceptual dependencies ii. To describe real world stereotype events c. Associative networks iii. Record like structures for grouping ... c-ii, d-i a-iv, b-iii, c-i, d-ii a-iv, b-iii, c-ii, d-i

asked Aug 1, 2016 in Others by jothee Veteran (97.1k points) | 476 views

+3 votes

1 answer

4

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

asked Aug 1, 2016 in Others by jothee Veteran (97.1k points) | 670 views

+1 vote

1 answer

5

UGCNET-Dec2014-III-59
Match the following components of an expert system : LIST-I LIST-II a. I/O interface i. Accepts user's queries and responds to question through I/O interface b. Explanation module ii. Contains facts and rules about the domain c. Inference engine iii. Gives the user, the ability to ... the system in a natural way Codes : a b c d i iii iv ii iv iii i ii i iii ii iv iv i iii ii

asked Jul 30, 2016 in Knowledge Representation by makhdoom ghaya Boss (29.5k points) | 709 views

0 votes

1 answer

6

UGCNET-Dec2014-III-58
Match the following : LIST-I LIST-II a. Script i. Directed graph with labelled nodes for graphical representation of knowledge b. Conceptual Dependencies ii. Knowledge about objects and events is stored in record-like structures consisting of slots and slot values. c. Frames iii. Primitive ... props and scenes Codes : a b c d iv ii i iii iv iii ii i ii iii iv i i iii iv ii

asked Jul 30, 2016 in Knowledge Representation by makhdoom ghaya Boss (29.5k points) | 614 views

+2 votes

2 answers

7

UGCNET-Dec2014-III-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 to a goal node ... path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion. None of the above

asked Jul 30, 2016 in Others by makhdoom ghaya Boss (29.5k points) | 647 views

+1 vote

1 answer

8

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

asked Jul 28, 2016 in Others by jothee Veteran (97.1k points) | 767 views

+2 votes

1 answer

9

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

asked Jul 27, 2016 in Others by jothee Veteran (97.1k points) | 589 views

+3 votes

1 answer

10

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 (97.1k points) | 617 views

+1 vote

1 answer

11

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 (97.1k points) | 359 views

+1 vote

1 answer

12

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 (97.1k points) | 532 views

+1 vote

1 answer

13

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 (97.1k points) | 680 views

+2 votes

2 answers

14

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 (97.1k points) | 769 views

+2 votes

1 answer

15

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 (97.1k points) | 587 views

+3 votes

1 answer

16

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 (97.1k points) | 510 views

+1 vote

1 answer

17

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 (97.1k points) | 1k views

+1 vote

1 answer

18

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 (97.1k points) | 745 views

0 votes

1 answer

19

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 (97.1k points) | 1.1k views

+1 vote

1 answer

20

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 (48.2k points) | 783 views

+2 votes

4 answers

21

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 (17 points) | 2.3k views

0 votes

2 answers

22

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 (29.5k points) | 649 views

0 votes

2 answers

23

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$ ... 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 (29.5k points) | 780 views

0 votes

2 answers

24

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 (29.5k points) | 758 views

0 votes

2 answers

25

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 (29.5k points) | 503 views

+3 votes

1 answer

26

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 (97.1k points) | 457 views

+1 vote

1 answer

27

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 (97.1k points) | 882 views

+2 votes

1 answer

28

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 (97.1k points) | 720 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