# GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1809 - 1811 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

## Question 1809

Appeared in Year: 2019 (UGC-NET)

### Question

Assertion-Reason▾

### Assertion(Ꭺ)

These exists no algorithm for deciding if any two Turing Machines and accept the same language. (December)

### Reason(Ꭱ)

Let and be arbitrary Turing machines. The problem to determine is undecidable.

### Choices

Choice (4)Response

a.

Both Ꭺ and Ꭱ are false

b.

Ꭺ is true but Ꭱ is false

c.

Both Ꭺ and Ꭱ are true and Ꭱ is the correct explanation of Ꭺ

d.

Both Ꭺ and Ꭱ are true but Ꭱ is NOT the correct explanation of Ꭺ

## Question 1810

Appeared in Year: 2019 (UGC-NET)

### Question

MCQ▾

Consider the following models:

: Mamdani model

: Takagi – Sugeno – Kang model

Which of the following option contains examples of additive rule model?

(December)

### Choices

Choice (4)Response

a.

, and

b.

Only and

c.

Only and

d.

Only and

## Question 1811

Appeared in Year: 2019 (UGC-NET)

### Question

MCQ▾

The following multithreaded algorithm computes transpose of a matrix in parallel: (December)

1. `p Trans (X, Y, N)`
2. `if N =1`
3. `then Y [1, 1] ⇽ X [1, 1]`
4. `else partition X into four (N / 2) × (N/2) submatrices X11, X12, X21, X22`
5. `partition Y into four (N / 2) × (N/2) submatrices Y11, Y12, Y21, Y22`
6. `spawn p Trans (X11, Y11, N/2)`
7. `spawn p Trans (X12, Y12, N/2)`
8. `spawn p Trans (X21, Y21, N/2)`
9. `spawn p Trans (X22, Y22, N/2)`

What is the asymptotic parallelism of the algorithm?

### Choices

Choice (4)Response

a.

b.

c.

d.

Developed by: