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 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 1

» Discrete Mathematics » Logic Programming

Edit

Appeared in Year: 2016

MCQ▾

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

The usual 8-puzzle game

The Usual 8-Puzzle Game

The usual 8-puzzle game

Which of the following state cannot be reached?

Choices

Choice (4) Response

a.

Image shows the puzzle game : Choice A

Image Shows the Puzzle Game: Choice A

Image shows the puzzle game

b.

Image shows the puzzle game : Choice B

Image Shows the Puzzle Game: Choice B

Image shows the puzzle game

c.

Image shows the puzzle game : Choice C

Image Shows the Puzzle Game: Choice C

Image shows the puzzle game

d.

Image shows the puzzle game : Choice D

Image Shows the Puzzle Game: Choice D

Image shows the puzzle game

Question number: 2

» Discrete Mathematics » Logic Programming

Edit

Appeared in Year: 2013

MCQ▾

Question

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

Table shows the minimum cost for an assignment problem

Table shows the minimum cost for an assignment problem

Jobs

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

Developed by: