 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.

 61. Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false? a. Every minimum spanning tree of G must contain emin b. If emax is in a minimum spanning tree, then its removal must disconnect G c. No minimum spanning tree contains emax d. G has a unique minimum spanning tree

 62. Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following statements is always true? a. {u,v} must be an edge in G, and u is a descendant of v in T b. {u,v} must be an edge in G, and v is a descendant of u in T c. If {u,v} is not an edge in G then u is a leaf in T d. If {u,v} is not an edge in G then u and v must have the same parent in T

 63. Consider the following statements:S1: The sum of two singular n × n matrices may be non-singularS2: The sum of two n × n non-singular matrices may be singular. Which of the following statements is correct? a. S1 and S2 are both true b. S1 is true, S2 is false c. S1 is false, S2 is trueS1 and S2 are both fals d. S1 and S2 are both false

 64. Consider two well-formed formulas in prepositional logic. Which of the following statements is correct? a. F1 is satisfiable, F2 is valid b. F1 unsatisfiable, F2 is satisfiable c. F1 is unsatisfiable, F2 is valid d. F1 and F2 are both satisfiable

 65. Let f(n) = n^2Logn and g(n) = n (logn)^10 be two positive functions of n. Which of the following statements is correct? a. f(n) = O(g(n)) and g(n) != O(f(n)) b. f(n) != O(g(n)) and g(n) = O(f(n)) c. f(n) = O(g(n)) but g(n) = O(f(n)) d. f(n) != O(g(n)) but g(n) != O(f(n))

 66. Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. then the following relational algebra expression is always equal to  a. A b. B c. C d. D

 67. How many 4-digit even numbers have all 4 digits distinct? a. 2240 b. 2296 c. 2620 d. 4536