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.

181. The no. of ways to distribute n distinguishable objects into k distinguishable boxes, so that ni objects are placed into box i, i = 1, 2, …. k equals which of the following?
a. A
b. B
c. C
d. D
View Answer Report Discuss Too Difficult!
Answer: (c).C

182. The initial basic feasible solution to the following transportation problem using Vogel’s approximation method is
a. x11=20, x13=10, x21=20,
x23=20, x24=10, x32=10,
Total cost=180
b. x11=20, x12=20, x13=10,
x22=20, x23=20, x24=10,
Total cost=180
c. x11=20, x13=10, x22=20,
x23=20, x24=10, x32=10,
Total cost=180
d. None of the above
View Answer Report Discuss Too Difficult!
Answer: (d).None of the above

183. The solution of the recurrence relation is :
a. O(lg n)
b. O(n)
c. O(n lg n)
d. None of the above
View Answer Report Discuss Too Difficult!
Answer: (d).None of the above