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.

 71. How many undirected graphs (not necessarily connected) can be constructed out of a given set V = {v1, v2, ... vn} of n vertices? a. n(n-1)/2 b. 2^n c. n! d. 2^n(n-1)/2

 72. The rank of the matrix is : a. 4 b. 2 c. 1 d. 0

 73. The trapezoidal rule for integration give exact result when the integrand is a polynomial of degree: a. 0 but not 1 b. 1 but not 0 c. 0 or 1 d. 2

 74. The minimum number of colours required to colour the vertices of a cycle with n nodes in such a way that no two adjacent nodes have the same colour is a. 2 b. 3 c. 4 d. n - 2⌊n/2⌋ + 2

 75. If X, then Y unless Z" is represented by which of the following formulae in propositional logic? ("¬" is negation "^" is conjunction, and "→" is implication) a. (X ^ ¬ Z) → Y b. (X ^ Y) → ¬ Z c. (X → (Y ^ ¬ Z) d. (X → Y(^ ¬ Z)

 76. The decimal value 0.25 a. is equivalent to the binary value 0.1 b. is equivalent to the binary value 0.01 c. is equivalent to the binary value 0.00111.... d. cannot be represented precisely in binary

 77. Maximum number of edges in a n - node undirected graph without self loops is a. n^2 b. n(n - 1)/2 c. n - 1 d. (n + 1) (n)/2