# Discrete Mathematics-Logic Programming [NTA-NET (Based on NTA-UGC) Computer Science (Paper-II)]: Questions 1 - 2 of 2

Access detailed explanations (illustrated with images and videos) to **2202** questions. Access all new questions we will add tracking exam-pattern and syllabus changes. *Unlimited Access for Unlimited Time*!

View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

## Question number: 1

» Discrete Mathematics » Logic Programming

Appeared in Year: 2016

### Question

Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state

Which of the following state cannot be reached?

### Choices

Choice (4) | Response | |
---|---|---|

a. | ||

b. | ||

c. | ||

d. |

## Question number: 2

» Discrete Mathematics » Logic Programming

Appeared in Year: 2013

### Question

Which of the following is the minimum cost for an assignment problem given below?

| |||||

A | B | C | D | ||

Workers | I | 5 | 3 | 2 | 8 |

II | 7 | 9 | 2 | 6 | |

III | 6 | 4 | 5 | 7 | |

IV | 5 | 7 | 7 | 8 |

(September Paper-III)

### Choices

Choice (4) | Response | |
---|---|---|

a. | 13 | |

b. | 17 | |

c. | 18 | |

d. | 16 |