61.
Consider the following linear programming
problem:

Max. z = 0.50x

_{2}– 0.10x_{1}
Subject to the constraints

2x

_{1}+ 5x_{2}≤ 80
x

_{1}+ x_{2}≤ 20
and x

_{1}, x_{2}≥ 0
The total maximum profit (z) for the above
problem is:

(A) 6 (B)
8

(C) 10 (D)
12

Answer: B

62.
Consider the following statements:

(a) If primal (dual) problem has a finite
optimal solution, then its dual (primal) problem has a finite optimal solution.

(b) If primal (dual) problem has an unbounded
optimum solution, then its dual (primal) has no feasible solution at all.

(c) Both primal and dual problems may be
infeasible.

Which of the following is correct?

(A) (a) and (b) only (B) (a) and (c) only

(C) (b) and (c) only (D) (a), (b) and (c)

Answer: D

63.
Consider the following statements :

(a) Assignment problem can be used to
minimize the cost.

(b) Assignment problem is a special case of
transportation problem.

(c) Assignment problem requires that only one
activity be assigned to each resource.

Which of the following options is correct?

(A) (a) and (b) only (B) (a) and (c) only

(C) (b) and (c) only (D) (a), (b) and (c)

Answer: D

64.
What are the following sequence of steps
taken in designing a fuzzy logic machine ?

(A) Fuzzification → Rule evaluation →
Defuzzification

(B) Fuzzification → Defuzzification → Rule
evaluation

(C) Rule evaluation → Fuzzification →
Defuzzification

(D) Rule evaluation → Defuzzification →
Fuzzification

Answer: A

65.
Which of the following 2 input Boolean logic
functions is linearly inseparable?

(a) AND (b)
OR

(c) NOR (d)
XOR

(e) NOT XOR

(A) (a) and (b) (B) (b) and (c)

(C) (c), (d) and (e) (D) (d) and (e)

Answer: D

66.
Let R and S be two fuzzy relations defined as

Then, the resulting relation, T, which
relates elements of universe of X to elements of universe of Z using
max-product composition is given by

Answer: C

67.
Consider the following operations to be
performed in Unix:

“The pipe sorts all files in the current
directory modified in the month of “June” by order of size and prints them to
the terminal screen. The sort option skips ten fields then sorts the lines in
numeric order.”

Which of the following Unix command will perform
above set of operations?

(A) ls – l | grep “June” | sort + 10n

(B) ls – l | grep “June” | sort + 10r

(C) ls – l | grep – v “June” | sort + 10n

(D) ls – l | grep – n “June” | sort + 10x

Answer: A

68.
Which of the following statements is
incorrect for a Windows Multiple Document Interface (MDI)?

(A) Each document in an MDI application is
displayed in a separate child window within the client area of the
application’s main window.

(B) An MDI application has three kinds of
windows namely a frame window, an MDI client window and number of child
windows.

(C) An MDI application can support more than
one kind of document.

(D) An MDI application displays output in the
client area of the frame window.

Answer: D

69.
Which of the following statement(s) is/are
True regarding ‘nice’ command of UNIX?

I. It is used to set or change the priority
of a process.

II. A process’s nice value can be set at the
time of creation.

III. ‘nice’ takes a command line as an
argument.

(A) I, II only (B) II, III only

(C) I, II, III (D) I, III only

Answer: C

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

(A) Only I and II are equivalent sentences

(B) Only II and III are equivalent sentences.

(C) Only I and III are equivalent sentence.

(D) I, II, and III are equivalent sentences.

Answer: D

## 0 Comments