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

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
by

1 Answer

Answer :

(A) rows or columns
by

Related questions

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. None of the above

Description : 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. None of the above

Last Answer : b. Rows & columns

While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to a. Minimize total cost of assignment b. Reduce the cost of assignment to zero c. Reduce the cost of that particular assignment to zero d. All of the above

Description : While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to a. Minimize total cost of assignment b. Reduce the cost of ... to zero c. Reduce the cost of that particular assignment to zero d. All of the above

Last Answer : c. Reduce the cost of that particular assignment to zero

. The method used for solving an assignment problem is called a. Reduced matrix method b. MODI method c. Hungarian method d. None of the above

Description : . The method used for solving an assignment problem is called a. Reduced matrix method b. MODI method c. Hungarian method d. None of the above

Last Answer : . c. Hungarian method

.................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Last Answer : a. Hungarian Method

The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b

Description : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b

Last Answer : b. A travelling salesman problem

The method used for solving an assignment problem is: a. Reduced matrix method b. MODI method c. Hungarian method d. None of these

Description : The method used for solving an assignment problem is: a. Reduced matrix method b. MODI method c. Hungarian method d. None of these

Last Answer : c. Hungarian method

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

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

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 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

An assignment problem is a special case of transportation problem, where a. Number of rows equals number of columns b. All rim conditions are 1 c. Values of each decision variable is either 0 or 1

Description : An assignment problem is a special case of transportation problem, where a. Number of rows equals number of columns b. All rim conditions are 1 c. Values of each decision variable is either 0 or 1

Last Answer : D.variable is either 0 or 1

An assignment problem is considered as a particular case of a transportation problem because a. The number of rows equals columns b. All xij = 0 or 1 c. All rim conditions are 1 d. All of the above

Description : An assignment problem is considered as a particular case of a transportation problem because a. The number of rows equals columns b. All xij = 0 or 1 c. All rim conditions are 1 d. All of the above

Last Answer : d. All of the above

Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Last Answer : d. All of the above

........................... method is used to solve an assignment problem. a. American method b. Hungarian method c. German method d. British method

Description : ........................... method is used to solve an assignment problem. a. American method b. Hungarian method c. German method d. British method

Last Answer : b. Hungarian method

The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ……………….. A) Degree, Cardinality B) Cardinality, Degree C) Rows, Columns

Description : The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ……………….. A) Degree, Cardinality B) Cardinality, Degree C) Rows, Columns

Last Answer : B) Cardinality, Degree

The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table

Description : The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table

Last Answer : (C) Same number of rows as the original table

At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution

Description : At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution

Last Answer : (C) Alternative solution

For solving an assignment problem, which method is used? a. British b. American c. German d. None of the above

Description : For solving an assignment problem, which method is used? a. British b. American c. German d. None of the above

Last Answer : B. american

What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search

Description : What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search 

Last Answer : (3) Heuristic Search

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.

Description : 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 ... value in that column. (D) adding maximum value of the table to each entry in the table.

Last Answer : (B) subtracting each entry in the table from the maximum value in that table.

If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if (A) h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Last Answer : (C) h* underestimates h

A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

Description : A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

Last Answer : d) Mars Hover (Robot Navigation)

A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext

Description : A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext

Last Answer : C. Hypertext

The minimum number of rows and columns that a word table can have, is: a) Zero b) 1 Row and 1 Column c) 1 Row and 2 Columnsd) None of The Above

Description : The minimum number of rows and columns that a word table can have, is: a) Zero b) 1 Row and 1 Column c) 1 Row and 2 Columns d) None of The Above

Last Answer : b) 1 Row and 1 Column

Which of the following is NOT characteristic of a nursing research? a. Development of theories, principles, and generalizations b. Uses chaotic method of problem-solving c. Requires full skill of writing report d. Involves precise observation and accurate description

Description : Which of the following is NOT characteristic of a nursing research? a. Development of theories, principles, and generalizations b. Uses chaotic method of problem-solving c. Requires full skill of writing report d. Involves precise observation and accurate description

Last Answer : b. Uses chaotic method of problem-solving

How are data organised in a spreadsheet? 1) Lines and spaces 2) Layers and planes 3) Height and width 4) Rows and columns 5) None of these

Description : How are data organised in a spreadsheet? 1) Lines and spaces 2) Layers and planes 3) Height and width 4) Rows and columns 5) None of these

Last Answer : Answer :3

The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1

Description : The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1

Last Answer : c. m +n – 1

...method in Pandas can be used to change the index of rows and columns of a Series or Dataframe : -Technology

Description : ...method in Pandas can be used to change the index of rows and columns of a Series or Dataframe : -Technology

Last Answer : Correct option(ii)reindex

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.

Which one of the following best describes a project issue? a. A major problem that requires formal escalation. b. A problem that the project manager has to deal with on a day-to-day basis. c. An uncertain event that may or may not occur. d. An opportunity that occurs through change control.

Description : Which one of the following best describes a project issue? a. A major problem that requires formal escalation. b. A problem that the project manager has to deal with on a day-to-day basis. c. An uncertain event that may or may not occur. d. An opportunity that occurs through change control.

Last Answer : a. A major problem that requires formal escalation.

Which one of the following best describes a project issue? a. A major problem that requires formal escalation. b. A problem that the project manager has to deal with on a day-to-day basis. c. An uncertain event that may or may not occur. d. An opportunity that occurs through change control.

Description : Which one of the following best describes a project issue?  a. A major problem that requires formal escalation.  b. A problem that the project manager has to deal with on a day-to-day basis.  c. An uncertain event that may or may not occur.  d. An opportunity that occurs through change control.

Last Answer : a. A major problem that requires formal escalation.

Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ................ (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Description : Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ... ...... (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Last Answer : Answer: Marks given to all

Which of the following methods of teaching encourages the use of maximum senses? Options: A) Problem-solving method B) Laboratory method C) Self-study method D) Team teaching method

Description : Which of the following methods of teaching encourages the use of maximum senses? Options: A) Problem-solving method B) Laboratory method C) Self-study method D) Team teaching method

Last Answer : B) Laboratory method 

Which of the following methods of teaching encourages the use of maximum senses? (A) Problem-solving method (B) Laboratory method (C) Self-study method (D) Team teaching method

Description : Which of the following methods of teaching encourages the use of maximum senses? (A) Problem-solving method (B) Laboratory method (C) Self-study method (D) Team teaching method

Last Answer : (B) Laboratory method

The assignment problem a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximize resources d. All of the above

Description : The assignment problem a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximize resources d. All of the above

Last Answer : d. All of the above

The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above

Description : The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above

Last Answer : d. All the above

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1 The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is :  1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Last Answer : (B) 10 and 7

Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed in each table of revised simplex method than usual simplex method. Which of these statements are correct? (A) (a) and (b) only (B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)

Description : Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed ... c) only (C) (b) and (c) only (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c)

Drawing of number of copies of the same image in rows and columns acrossthe interface window so that they cover the entire window is called a.Roaming b.Panning c.Zooming d.Tiling

Description : Drawing of number of copies of the same image in rows and columns acrossthe interface window so that they cover the entire window is called a.Roaming b.Panning c.Zooming d.Tiling

Last Answer : d.Tiling

What is the minimum number of rows and columns that a word table can have a) 1 row & 1 columnb) 2 rows & 2 columnsc) Zerod)1 row & 2 columnse) None of The Above

Description : What is the minimum number of rows and columns that a word table can have a) 1 row & 1 column b) 2 rows & 2 columns c) Zero d)1 row & 2 columns e) None of The Above

Last Answer : a) 1 row & 1 column

Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height>180); If the SQL queries (a) and (b) above, return 10 rows and 7 rows in the result set respectively, then what is one possible number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Description : Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height ... number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Last Answer : (C) 10

Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can’t cause right path to be overlooked. (C) Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.

Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/ are correct? (A) (a) only (B) (b) only (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map ... (b) only (C) (a) and (b) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c) 

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Last Answer : (D) (a), (b) , (c) and (d)

Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40

Description : Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40

Last Answer : (2) 10