UGC NET CS 2015 Dec – III

Question 41

In Propositional Logic, given P and P → Q, we can infer __________.

• ~ Q
• Q
• P ∧ Q
• ~ P ∧ Q

Question 42

Reasoning strategies used in expert systems include __________.

• Forward chaining, backward chaining and problem reduction
• Forward chaining, backward chaining and boundary mutation
• Forward chaining, backward chaining and back propagation
• Backward chaining, problem reduction and boundary mutation

Question 43

Language model used in LISP is __________.

• Functional programming
• Logic programming
• Object oriented programming
• All of the above

Question 44

In constraint satisfaction problem, constraints can be stated as __________.

• Arithmetic equations and inequalities that bind the values of variables
• Arithmetic equations and inequalities that doesn’t bind any restriction over variables
• Arithmetic equations that impose restrictions over variables
• Arithmetic equations that discard constraints over the given variables

Question 45

As compared to rental and leasing methods to acquire computer systems for a Management Information System (MIS), purchase method has following advantage:

• It has high level of flexibility

• It doesn’t require cash up-front

• It is a business investment

• Little risk of obsolescence

Question 46

Consider the conditional entropy and mutual information for the binary symmetric channel. The input source has alphabet X = {0, 1} and associated probabilities {1 / 2, 1 / 2}. The channel matrix is where p is the transition probability. Then the conditional entropy is given by:

• 1
• - plog(p) - (1 - p)log(1 - p)
• 1 + p log(p) + (1 - p)log(1 - p)
• 0

Question 47

Which of the following is not a lossy compression technique?

• JPEG
• MPEG
• FFT
• Arithmetic coding

Question 48

Blind image deconvolution is ____________.

• Combination of blur identification and image restoration
• Combination of segmentation and classification
• Combination of blur and non-blur image
• None of the above

Question 49

A basic feasible solution of a linear programming problem is said to be __________ if at least one of the basic variable is zero.

• degenerate
• non-degenerate
• infeasible
• unbounded

Question 50

Consider the following transportation problem: The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is:

• 1450
• 1465
• 1480
• 1520