 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.

 81. Consider the following transportation problem.The initial basic feasible solution of the transportation problem using Vogel’s Approximation Method(VAM) is given below. The solution of the this problem:  a. is degenerate solution b. is optimum solution c. needs to improve d. is infeasible solution

 82. Consider the Graph shown below. This graph is a ............... a. Complete Graph b. Bipartite Graph c. Hamiltonian Graph d. All of the above

 83. Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table. Find out the minimum time required to complete all the jobs. a. 5 b. 11 c. 13 d. 15

 84. Consider the graph given below. Which one of the following graph is isomorphic to the above graph?  a. A b. B c. C d. D

 85. Consider a complete bipartite graph km,n. For which values of m and n does this, complete graph have a Hamilton circuit ? a. m=3, n=2 b. m=2, n=3 c. m=n≥2 d. m=n≥3

 86. How many cards must be chosen from a deck to guarantee that atleasti. two aces of two kinds are chosen.ii. two aces are chosen.iii. two cards of the same kind are chosen.iv. two cards of two different kinds are chosen a. 50, 50, 14, 5 b. 51, 51, 15, 7 c. 52, 52, 14, 5 d. 51, 51, 14, 5

 87. A text is made up of the characters α, β, γ, δ and σ with the probability 0.12, 0.40, 0.15, 0.08 and 0.25 respectively. The optimal coding technique will have the average length of a. 1.7 b. 2.15 c. 3.4 d. 3.8