Q. 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 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

code:
a b c d

View solution

Q. In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of :

View solution

Q. Given the following statements with respect to linear programming problem :

S1: The dual of the dual linear programming problem is again the primal problem

S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution.

S3: If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.

Which of the following is true?

View solution

Q. Consider the two class classification task that consists of the following points :

Class C1 : [1 1.5]   [1 -1.5]

Class C2 : [-2 2.5]   [-2 -2.5]

The decision boundary between the two classes using single perceptron is given by:

View solution

Q. Which one of the following describes the syntax of prolog program ?

I. Rules and facts are terminated by full stop (.)
II. Rules and facts are terminated by semicolon (;)
III. Variables names must with upper case alphabets.
IV. Variables names must start with lower case alphabets.

View solution

Q. 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

Codes:

a       b       c       d

View solution

Q. STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following ?

View solution

Q. _________ predicate calculus allows quantified   variables   to   refer  to objects in the domain of discourse and not to predicates or functions.

View solution

Q. ________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.

View solution

Q. Which of the following special cases does not require reformulation of the problem in order to obtain a solution ?

View solution

Q. The given maximization assignment problem can be converted into a minimization problem by

View solution

Q. Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18). (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by

(Assume p and w denotes profit and weight of objects respectively)

View solution

Q. Match the following:

List-I List-II
a. Absurd i. Clearly impossible being contrary to some evident truth.
b. Ambiguous ii. Capable of more than one interpretation or meaning.
c. Axiom iii. An assertion that is accepted and used without a proof.
d. Conjecture iv. An opinion Preferably based on some experience or wisdom.

Codes: a b c d

View solution

Q. In Artificial Intelligence (AI), what is present in the planning graph?

View solution

Q. What is the best method to go for the game playing problem?

View solution

Q. Which of the following statements is true ?

View solution

Q. The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to which of the following?

View solution

Q. Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q).
Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and ............. respectively.

View solution

Q. Let v(x) mean x is a vegetarian, m(y) for y is meat, and e(x, y) for x eats y. Based on these, consider the following sentences:

I. ∀x v(x) ⇔ (∀y e(x, y) ⇒ ¬m(y))
II. ∀x v(x ) ⇔ (¬(∃y m(y) ˄ e(x, y)))
III. ∀x (∃y m(y) ˄ e(x, y)) ⇔ ¬v(x)

One can determine that

View solution

Q. Match each Artificial Intelligence term in List-I that best describes a given situation in List – II:

List – I                                       List – II
I. Semantic Network                a. Knowledge about what to do as opposed to
how to do it.
II. Frame                                    b. A premise of a rule that is not concluded
by any rule.
III. Declarative knowledge      c. A method of knowledge representation that
uses a graph.
IV. Primitive                              d. A data structure representing stereotypical
knowledge.

Codes :
      I    II   III   IV

View solution