Computer Science & Application
1. The exclusive or of prepositions p and q (p⊕q) is true if :
(A) Both p and q are true
(B) Both p and q are false
(C) Exactly one of p and q is true
(D) All of the above
Answer : (C)
2. Which of the following is logically equivalent to ¬(p v(¬p^q)) ? :
(A) p^q
(B) ¬p^¬q
(C) ¬p^q
(D) p^¬q
Answer : (B)
3. For set A and B, A - B is equal to which of the following ?
(A) 120
(B) 720
(C) 5040
(D) 24
Answer : (A)
5. A simple path in a graph G that passes through every vertex exactly once is known as :
(A) Eulerian path
(B) Planner path
(C) Unique Node path
(D) Hamilton path
(A) [log(n-1)!]
(B) [logn!]
(C) [log(n-1)!]/n
(D) [log n!]/n
(A) Divides
(B) Multiplies
(C) Adds
(D) All of these
(A) 2n
(B) 2n-1
(C) 22n
(D) 22n-1
(A) Multiple optimal solution
(B) Feasible solution
(C) Infeasible solution
(D) Unbounded solution
Answer : (D)
10. In transportation model having m rows and « column, degeneracy is a condition where the number of positive variables in the basic solution is less than :
(A) m+n-1
(B) m+n-2
(C) m+n-3
(D) m+n-4
Answer : (A)
No comments:
Post a Comment