The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table from the maximum value in that table. (C) adding each entry in a column from the maximum value in that column. (D) adding maximum value of the table to each entry in the table.

The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table from the maximum value in that table. (C) adding each entry in a column from the maximum value in that column. (D) adding maximum value of the table to each entry in the table.
by

1 Answer

Answer :

(B) subtracting each entry in the table from the maximum value in that table.
by

Related questions

Maximization assignment problem is transformed into a minimization problem by a. Adding each entry in a column from the maximization value in that column b. Subtracting each entry in a column from the maximum value in that column c. Subtracting each entry in a column from the maximum value in that table d. Any one of the above

Description : Maximization assignment problem is transformed into a minimization problem by a. Adding each entry in a column from the maximization value in that column b. Subtracting each entry in a column from the maximum ... entry in a column from the maximum value in that table d. Any one of the above

Last Answer : c. Subtracting each entry in a column from the maximum value in that table

Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix

Description : Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix

Last Answer : c. Regret matrix

If profit, sales, production, etc is given then it is _________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem

Description : If profit, sales, production, etc is given then it is _________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem

Last Answer : c. Maximization problem

If cost, time, etc is given, then it is ________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem

Description : If cost, time, etc is given, then it is ________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem

Last Answer : d. Minimization problem

What is the m What is the major differe ajor difference in focus bet nce in focus between locat ween location decision ion decisions in the service sect s in the service sector and in or and in the manufacturing sector? a)There is no difference in focus b)The focus in manufacturing is revenue maximization, while the focus in service is cost minimization c)The focus in service is revenue maximization, while the focus in manufacturing is cost minimization d)The focus in manufacturing is on raw materials, while the focus in service is on labour

Description : What is the m What is the major differe ajor difference in focus bet nce in focus between locat ween location decision ion decisions in the service sect s in the service sector and in or and ... minimization d)The focus in manufacturing is on raw materials, while the focus in service is on labour

Last Answer : c)The focus in service is revenue maximization, while the focus in manufacturing is cost minimization

Which statute governs external commercial borrowing? e) Foreign Exchange Maximization Act, 1972 f) Foreign Exchange Management Act, 1999 g) Foreign Exchange Minimization Act, 2004 h) Foreign Exchange Regulation Act, 1972

Description : Which statute governs external commercial borrowing? e) Foreign Exchange Maximization Act, 1972 f) Foreign Exchange Management Act, 1999 g) Foreign Exchange Minimization Act, 2004 h) Foreign Exchange Regulation Act, 1972

Last Answer : f) Foreign Exchange Management Act, 1999

If no. of rows are equal to number of columns and the matrix elements are Time elements then the problem is: a. Balanced and Minimization Transportation problem b. Unbalanced and Minimization Transportation problem c. Balanced and Minimization Assignment problem d. Unbalanced and Minimization Assignment problem

Description : If no. of rows are equal to number of columns and the matrix elements are Time elements then the problem is: a. Balanced and Minimization Transportation problem b. ... Transportation problem c. Balanced and Minimization Assignment problem d. Unbalanced and Minimization Assignment problem

Last Answer : c. Balanced and Minimization Assignment problem

If no. of rows are not equal to number of columns and the matrix elements are profit elements then the problem is: a. Balanced and Maximization Transportation problem b. Unbalanced and Maximization Transportation problem c. Balanced and Maximization Assignment problem d. Unbalanced and Maximization Assignment problem

Description : If no. of rows are not equal to number of columns and the matrix elements are profit elements then the problem is: a. Balanced and Maximization Transportation problem b. ... Transportation problem c. Balanced and Maximization Assignment problem d. Unbalanced and Maximization Assignment problem

Last Answer : a. Balanced and Maximization Transportation problem

For maximization in assignment problem, the objective is to maximize the a. Profit b. Optimization c. Cost d. None of the above

Description : For maximization in assignment problem, the objective is to maximize the a. Profit b. Optimization c. Cost d. None of the above

Last Answer : a. Profit

If in an assignment problem, number of rows is not equal to number of columns then a. Maximization problem b. Problem is unbalanced c. Problem is degenerate d. Optimum solution is not possible

Description : If in an assignment problem, number of rows is not equal to number of columns then a. Maximization problem b. Problem is unbalanced c. Problem is degenerate d. Optimum solution is not possible

Last Answer : c. Problem is degenerate

In quadrantal bearing system, back bearing of a line may be obtained from its forward bearing, by (A) Adding 180°, if the given bearing is less than 180° (B) Subtracting 180°, if the given bearing, is more than 180° (C) Changing the cardinal points, i.e. substituting N for S and E for W and vice-versa (D) None of these

Description : In quadrantal bearing system, back bearing of a line may be obtained from its forward bearing, by (A) Adding 180°, if the given bearing is less than 180° (B) Subtracting 180°, if the given bearing, is more ... cardinal points, i.e. substituting N for S and E for W and vice-versa (D) None of these

Last Answer : (C) Changing the cardinal points, i.e. substituting N for S and E for W and vice-versa

. For __________ minimization, we take least value from each column and subtract it from all values of that column. a. Column b. Row c. Profit d. Cost

Description : . For __________ minimization, we take least value from each column and subtract it from all values of that column. a. Column b. Row c. Profit d. Cost

Last Answer : a. Column

For __________ minimization, we take least value from each row and subtract it from all values of that row. a. Column b. Row c. Profit d. Cost

Description : For __________ minimization, we take least value from each row and subtract it from all values of that row. a. Column b. Row c. Profit d. Cost

Last Answer : b. Row

For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Description : For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page ... fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Last Answer : (C) √2xz 

In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1

Description : In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1

Last Answer : (A) rows or columns

What do you think of this explanation of why subtracting a negative is the same as adding a positive?

Description : What do you think of this explanation of why subtracting a negative is the same as adding a positive?

Last Answer : I should have added that if you accept that subtracting a positive is the same as adding a negative then it follows that subtracting a negative is the same as adding a positive.

An optimal solution of an assignment problem can be obtained only if a. Each row & column has only one zero element b. Each row & columns has at least one zero element c. The data is arrangement in a square matrix d. None of the above

Description : An optimal solution of an assignment problem can be obtained only if a. Each row & column has only one zero element b. Each row & columns has at least one zero element c. The data is arrangement in a square matrix d. None of the above

Last Answer : d. None of the above

In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple.

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

37. Which of the following is not a characteristics of the LP a. Resources must be limited b. Only one objective function c. Parameters value remains constant during the planning period d. The problem must be of minimization type

Description : 37. Which of the following is not a characteristics of the LP a. Resources must be limited b. Only one objective function c. Parameters value remains constant during the planning period d. The problem must be of minimization type

Last Answer : d. The problem must be of minimization type

Value maximization theory fails to address the problem of A.self-serving management. B.risk C.uncertainty D.sluggish growth.

Description : Value maximization theory fails to address the problem of A.self-serving management. B.risk C.uncertainty D.sluggish growth.

Last Answer : A.self-serving management.

State with a neat example the method for the minimization of primitive flow table.

Description : State with a neat example the method for the minimization of primitive flow table.

Last Answer : • Consider a state diagram • Obtain the flow table • Using implication table reduce the flow table • Using merger graph obtain maximal compatibles • Verify closed & covered conditions • Plot the reduced flow table

The purpose of a dummy row or column in an assignment problem is to a. Obtain balance between total activities and total resources b. Prevent a solution from becoming degenerate c. Provide a means of representing a dummy problem d. None of the above

Description : The purpose of a dummy row or column in an assignment problem is to a. Obtain balance between total activities and total resources b. Prevent a solution from becoming degenerate c. Provide a means of representing a dummy problem d. None of the above

Last Answer : a. Obtain balance between total activities and total resources

The extra row or column which is added to balance an assignment problem is called _____ a. Regret b. Epsilon c. Dummy d. extra 98.

Description : The extra row or column which is added to balance an assignment problem is called _____ a. Regret b. Epsilon c. Dummy d. extra

Last Answer : c. Dummy

To select all column from the table the syntax is: A) select all from table_name B) select * from table_name C) select from table_name D) Non of the above

Description : To select all column from the table the syntax is: A) select all from table_name B) select * from table_name C) select from table_name D) Non of the above

Last Answer : B) select * from table_name

Consider a “CUSTOMERS” database table having a column “CITY” filled with all the names of Indian cities (in capital letters). The SQL statement that finds all cities that have “GAR” somewhere in its name, is: (A) Select *from customers where city=’%GAR%’; (B) Select *from customers where city=’$GAR$’; (C) Select *from customers where city like ‘%GAR%’; (D) Select *from customers where city as ’%GAR’;

Description : Consider a CUSTOMERS database table having a column CITY filled with all the names of Indian cities (in capital letters). The SQL statement that finds all cities that have GAR somewhere in its name, ... *from customers where city like %GAR%'; (D) Select *from customers where city as '%GAR';

Last Answer : Answer: C

Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to the column B in table R. One can determine that: (A) I, III and IV are the same query. (B) II, III and IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Description : Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to ... IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Last Answer : (D) I, III and III are the same query.

A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

In the following table, every entry on the left column can match with any number of entries on the right side.

Description : In the following table, every entry on the left column can match with any number of entries on the right side.

Last Answer : In the following table, every entry on the left column can match with any number of entries ... objects moving through it. S Non-conservative force

How do you Write a pseudo code algorithm that reads in three values and writes out the result of subtracting the second value from the sum of the first and third values?

Description : How do you Write a pseudo code algorithm that reads in three values and writes out the result of subtracting the second value from the sum of the first and third values?

Last Answer : Pseudocode means you don't use any actual computer language, so you can be quite informal. Just get the general idea. In this case, for instance:Input number to aInput number to bInput ... a + c - bShow resultYour teacher may have specific requirements for pseudocode; try to incorporate those.

If a segment is you can find the distance by subtracting the y-coordinates and taking the absolute value.?

Description : If a segment is you can find the distance by subtracting the y-coordinates and taking the absolute value.?

Last Answer : Feel Free to Answer

State true or false. i) comparisons precede logical operations in java ii) assignment operations succeed increment operations iii) arithmetic operations succeed comparisons iv) x precede + A) i-true, ii-true, iii-false, iv-true B) i-true, ii-false, iii-true, iv-false C) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Description : State true or false. i) comparisons precede logical operations in java ii) assignment operations succeed increment operations iii) arithmetic operations succeed comparisons iv) x precede + A) i-true, ii-true, iii-false, ... false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Last Answer : A) i-true, ii-true, iii-false, iv-true

In Java variables, if first increment of the variable takes place and then the assignment occurs. This operation is also called ............................. . A) pre increment B) post increment C) incrementation D) pre incrementation

Description : In Java variables, if first increment of the variable takes place and then the assignment occurs. This operation is also called ............................. . A) pre increment B) post increment C) incrementation D) pre incrementation

Last Answer : A) pre increment

Which of the following is not mandatory in variable declaration? A) a semicolon B) an identifier C) an assignment D) a data type

Description : Which of the following is not mandatory in variable declaration? A) a semicolon B) an identifier C) an assignment D) a data type

Last Answer : C) an assignment

Which of the following operates cannot be overloaded? i) Size of operator (sizeof) ii) Scope resolution Operator iii) Conditional operator (?:) iv) Assignment Operator (=) A) i, ii, iii only B) ii, iii, iv only C) i, iii, iv only D) all i, ii, iii, iv

Description : Which of the following operates cannot be overloaded? i) Size of operator (sizeof) ii) Scope resolution Operator iii) Conditional operator (?:) iv) Assignment Operator (=) A) i, ii, iii only B) ii, iii, iv only C) i, iii, iv only D) all i, ii, iii, iv

Last Answer : A) i, ii, iii only

Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use a resource at a time. A) i-a, ii-b, iii-c B) i-a, ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b

Description : Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use ... , ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b

Last Answer : D) i-c, ii-a, iii-b

Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project

Description : Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project

Last Answer : D) Project

Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Description : Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Last Answer : b) Selection sort

Which of the following operators cannot be overloaded in C/C++? (1) Bitwise right shift assignment (2) Address of (3) Indirection (4) Structure reference

Description : Which of the following operators cannot be overloaded in C/C++? (1) Bitwise right shift assignment (2) Address of (3) Indirection (4) Structure reference

Last Answer : Answer: 4

What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ? (A) Generalization (B) Aggregation (C) Specialization (D) Adding suitable attributes

Description : What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ? (A) Generalization (B) Aggregation (C) Specialization (D) Adding suitable attributes

Last Answer : (D) Adding suitable attributes

35. Which of the following is not a characteristic of the L P model a. Alternative courses of actions b. An objective function of maximization type c. Limited amount of resources d. Non-negativity condition on the value of decision variable

Description : 35. Which of the following is not a characteristic of the L P model a. Alternative courses of actions b. An objective function of maximization type c. Limited amount of resources d. Non-negativity condition on the value of decision variable

Last Answer : b. An objective function of maximization type

34. Maximization of objective function in an L P model means a. Value occurs at allowable set of decisions b. Highest value is chosen among allowable decisions c. Neither of above d. Both a & b

Description : 34. Maximization of objective function in an L P model means a. Value occurs at allowable set of decisions b. Highest value is chosen among allowable decisions c. Neither of above d. Both a & b

Last Answer : a. Value occurs at allowable set of decision

State whether true or false. i) init( ) of servlet is called after a client request comes in ii) Servlets are ultimately converted into JSP A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Description : State whether true or false. i) init( ) of servlet is called after a client request comes in ii) Servlets are ultimately converted into JSP A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Last Answer : A) i-false, ii-false

C programs are converted into machine language with the help of A) An Editor B) A complier C) An operating system D) None of the above

Description : C programs are converted into machine language with the help of A) An Editor B) A complier C) An operating system D) None of the above

Last Answer : B) A complier

Which of the following is/ are the drawbacks of Ring Topology? A) Failure of one computer, can affect the whole network B) Adding or removing the computers disturbs the network activity. C) If the central hub fails, the whole network fails to operate. D) Both of A and B

Description : Which of the following is/ are the drawbacks of Ring Topology? A) Failure of one computer, can affect the whole network B) Adding or removing the computers disturbs the network activity. C) If the central hub fails, the whole network fails to operate. D) Both of A and B

Last Answer : D) Both of A and B

Which of the following concepts means adding new concepts to a program as it runs? (A) Data hiding (B) Dynamic loading (C) Dynamic typing (D) Dynamic binding

Description : Which of the following concepts means adding new concepts to a program as it runs? (A) Data hiding (B) Dynamic loading (C) Dynamic typing (D) Dynamic binding

Last Answer : (B) Dynamic loading

Suppose d = {“john”:40, “peter”:45}, to delete the entry for “john” what command do we use a) d.delete(“john”:40) b) d.delete(“john”) c) del d[“john”]. d) del d(“john”:40)

Description : Suppose d = {“john”:40, “peter”:45}, to delete the entry for “john” what command do we use a) d.delete(“john”:40) b) d.delete(“john”) c) del d[“john”]. d) del d(“john”:40)

Last Answer : c) del d[“john”].

The mv command changes (A) the inode (B) the inode-number (C) the directory entry (D) both the directory entry and the inode

Description : The mv command changes (A) the inode (B) the inode-number (C) the directory entry (D) both the directory entry and the inode

Last Answer : (C) the directory entry