COMPUTER SCIENCE MCQS
Showing posts with label
LINEAR PROGRAMMING
.
Show all posts
Showing posts with label
LINEAR PROGRAMMING
.
Show all posts
Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. [J17P3Q64]
Explanation
A t-error correcting q-nary linear code must satisfy : [J17P3Q65]
Explanation
With respect to a loop in the transportation table, which one of the following is not correct ? [J17P3Q68]
Explanation
At which of the following stage(s), the degeneracy do not occur in transportation problem ? (m, n represents number of sources and destinations respectively) [J17P3Q69]
Explanation
Consider the following LPP : [J17P3Q70]
Explanation
For any binary (n, h) linear code with minimum distance (2t+1) [N17P3Q66]
Explanation
Which of the following is a valid reason for causing degeneracy in a transportation problem ? Here m is no. of rows and n is no. of columns in transportation table. [N17P3Q67]
Explanation
Consider the following LPP : [N17P3Q68]
Explanation
Consider the following LPP : [N17P3Q69]
Explanation