|Que.||In propositional logic P ⇔ Q is equivalent to (Where ~ denotes NOT):|
|a.||~ (P ˅ Q) ˄ ~ (Q ˅ P)|
|b.||(~ P ˅ Q) ˄ (~ Q ˅ P)|
|c.||(P ˅ Q) ˄ (Q ˅ P)|
|d.||~ (P ˅ Q) → ~ (Q ˅ P)|
|Answer:(~ P ˅ Q) ˄ (~ Q ˅ P)|
sandeep16064 :(May 26, 2020) PQ'+P'Q
Complement of this became result
|Click Here to Reply|
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here
(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) Multilayer perceptron
(B) Self organizing feature map
(C) Hopfield network
(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?
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
a b c d
(i) OLAP (a) Regression
(ii) OLTP (b) Data Warehouse
(iii) Decision Tree (c) RDBMS
(iv) Neural Network (d) Classification
(i) (ii) (iii) (iv)
φ(V) = Z + (1/ 1 + exp (– x * V + Y) ),
Z, X, Y are parameters