Theory of Computation [GATE (Graduate Aptitude Test in Engineering) Computer Science]: Questions 1 - 6 of 74

Access detailed explanations (illustrated with images and videos) to 2122 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 1

Question

MCQ▾

Which of the following does not belong to the context free grammar?

Choices

Choice (4)Response

a.

End Symbol

b.

Start Symbol

c.

Terminal symbol

d.

Question does not provide sufficient data or is vague

Question 2

Question

MCQ▾

Regular languages are very useful in

Choices

Choice (4)Response

a.

finite automata

b.

push down automata

c.

down automate

d.

All of the above

Question 3

Question

MCQ▾

A finite-state machine with no output function at all is known as

Choices

Choice (4)Response

a.

a null automaton

b.

a semi automaton

c.

a full automaton

d.

a dummy automaton

Question 4

Question

MCQ▾

The graphical representation of the transition of finite automata is ________.

Choices

Choice (4)Response

a.

state diagram

b.

Finite diagram

c.

E -R diagram

d.

All of the above

Question 5

Appeared in Year: 2015 (UGC-NET)

Question

MCQ▾

The family of context sensitive languages is ________ under union and ________ under reversal. (December)

Choices

Choice (4)Response

a.

Closed, not closed

b.

Not closed, not closed

c.

Not closed, closed

d.

Closed, closed

Question 6

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

When one object reference variable is assigned to another object reference variable then

Choices

Choice (4)Response

a.

A copy of the object is created.

b.

A copy of the reference is not created.

c.

It is illegal to assign 1 object reference variable to another object reference variable.

d.

A copy of the reference is created.

Developed by: