GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1660 - 1664 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-

How to register? Already Subscribed?

Question 1660

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Which of the following problems is/are decidable problem (s) (recursively enumerable) on a Turing machine M?

(1) G is a CFG with

(2) There exist two TMs and such that language of all TMs

(3) M is a TM that accepts w using a most cells of tape

Choices

Choice (4)Response

a.

(1) , (2) and (3)

b.

(1)

c.

(1) and (2)

d.

(3)

Question 1661

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Which of the following is principal conjunctive normal form for ?

Choices

Choice (4)Response

a.

b.

c.

d.

Question 1662

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Which type of addressing mode, less number of memory references are required?

Choices

Choice (4)Response

a.

Implied

b.

Immediate

c.

Register

d.

Indexed

Question 1663

Question

MCQ▾

In Computer Organization, John Mauchly is associated with which of these concepts?

Choices

Choice (4)Response

a.

Registers

b.

Interrupts

c.

Loops

d.

Subroutines

Question 1664

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Suppose that a connected planar graph has six vertices, each of degrees four. Into how many regions is the plane divided by a planar representation of this graph?

Choices

Choice (4)Response

a.

8

b.

20

c.

12

d.

6

Developed by: