A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

21. 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) Judgmental

(d) Data (iv) Codifiable, endorsed with relevance and purpose

code:
a b c d
a. (iii) (ii) (iv) (i)
b. (iii) (i) (iv) (ii)
c. (i) (ii) (iii) (iv)
d. (i) (iii) (iv) (ii)
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).(iii) (i) (iv) (ii)

22. Which of the following statements is true for Branch - and - Bound search?
a. Underestimates of remaining distance may cause deviation from optimal path
b. Overestimates can't cause right path to be overlooked
c. Dynamic programming principle can be used to discard redundant partial paths
d. All of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Dynamic programming principle can be used to discard redundant partial paths

23. 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
a. (i) (iv) (iii) (ii)
b. (iv) (i) (ii) (iii)
c. (i) (iv) (ii) (iii)
d. (iv) (ii) (i) (iii)
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).(iv) (i) (ii) (iii)

24. 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 :
a. rows or columns
b. rows + columns
c. rows + columns – 1
d. rows + columns + 1
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).rows or columns

25. 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?
a. S1 and S2
b. S1 and S3
c. S2 and S3
d. S1, S2 and S3
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).S1, S2 and S3

26. 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:
a. x1 + x2 + 1.5 = 0
b. x1 + x2 -1.5 = 0
c. x1 + 1.5 = 0
d. x1 - 1.5 = 0
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).x1 + 1.5 = 0

27. 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.
a. I, II
b. I, III
c. III, IV
d. II, IV
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).I, 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

Codes:

a       b       c       d
a. iii       iv       i       ii
b. iii       iv       ii       i
c. i       ii       iii       iv
d. iv       iii       ii       i
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).iv       iii       ii       i

29. STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following ?
a. SHAKEY
b. SRI
c. NLP
d. None of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).NLP

30. _________ predicate calculus allows quantified   variables   to   refer  to objects in the domain of discourse and not to predicates or functions.
a. Zero-order
b. First-order
c. Second-order
d. High-order
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).First-order

Page 3 of 12