An A* algorithm is a heuristic search technique which
generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost.
A* evaluates each node n with \(f(n)=g(n)+h(n)\), where \(g(n)\) is the actual cost from the start node to n and \(h(n)\) is the heuristic estimate of the cost from n to the goal.
So \(f(n)\) is an estimate of the total distance from the start node to a goal node passing through n. A* generates the successors, computes this estimate for each, and expands the one with the smallest \(f\) — exactly the description of computing the start-to-goal cost estimate through each successor and taking the cheapest.
A depth-first style choice of the most promising child uses only \(h(n)\) (hill climbing / greedy best-first). Keeping only the path lengths \(g(n)\) from the start and expanding the shortest is uniform-cost (branch-and-bound) search, which uses no heuristic at all.
Hence, the answer is generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost..
Match the following components of an expert system :
| 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 follow inferencing steps at any time during consultation |
| d. | Knowledge base | iv. | Permits the user to communicate with the system in a natural way |
Codes :
a b c d
Match the following :
| 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 concepts and rules to represent natural language statements |
| d. | Associative Network | iv. | Frame like structures used to represent stereotypical patterns for commonly occurring events in terms of actors, roles, props and scenes |
Codes :
a b c d
In constraint satisfaction problem, constraints can be stated as __________.
Language model used in LISP is __________.
Reasoning strategies used in expert systems include __________.
Forward chaining systems are __________ where as backward chaining systems are __________.
Given the following set of prolog clauses :
father(X, Y) :
parent(X, Y),
male(X),
parent(Sally, Bob),
parent(Jim, Bob),
parent(Alice, Jane),
parent(Thomas, Jane),
male(Bob),
male(Jim),
female(Salley),
female(Alice).
How many atoms are matched to the variable ‘X’ before the query
father(X, Jane) reports a Result ?
Match the following with respect to heuristic search techniques :
| List - I | List - II |
| (a) Steepest - ascent 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 satisfaction | (iii) Detects difference between current state and goal state |
| (d) Means - end - analysis | (iv) Considers all moves from current state and selects best move |
Codes :
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 closely related knowledge |
| (d) Scripts | (iv) Structures and primitives to represent sentences |
Codes :
Match the following :
| List - I | List - II |
| (a) Intelligence | (i) Contextual, tacit, transfer needs learning |
| (b) Knowledge | (ii) Scattered facts, easily transferable |
| (c) Information | (iii) Judgemental |
| (d) Data | (iv) Codifiable, endorsed with relevance and purpose |
Codes :
Match the following components of an expert system :
| 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 follow inferencing steps at any time during consultation |
| d. | Knowledge base | iv. | Permits the user to communicate with the system in a natural way |
Codes :
a b c d
Match the following :
| 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 concepts and rules to represent natural language statements |
| d. | Associative Network | iv. | Frame like structures used to represent stereotypical patterns for commonly occurring events in terms of actors, roles, props and scenes |
Codes :
a b c d
In constraint satisfaction problem, constraints can be stated as __________.
Language model used in LISP is __________.
Reasoning strategies used in expert systems include __________.