Menu

Question Discussion & Solution

MCQ

Q.

An NFA is nothing more than a ?-NFA with no ? transitions

A

True

B

False

C

May be

D

Can't say

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________

A

reflexive

B

transitive

C

symmetric

D

reflexive and transitive

Discussion

MCQ

2.

Final state is represented by?

A

Square

B

Circle

C

Double Circlue

D

Rhombus

Discussion

MCQ

3.

Number of states require to simulate a computer with memory capable of storing

A

3 * 2⁸

B

2^(3*8)

C

2⁽³⁺⁸⁾

D

None of the mentioned

Discussion

MCQ

4.

In Final state, The number of odd arrows are one greater than even, i.e. odd = even+1?

A

TRUE

B

FALSE

C

Can be true or false

D

Can not say

Discussion

MCQ

5.

Languages of a automata is

A

If it halts

B

If it is accepted by automata

C

If automata touch final state in its life time

D

All language are language of automata

Discussion

More Compiler Design Topics

Compiler Design Basics

61 MCQs

Non Deterministic Finite Automata

26 MCQs

Lexical Analysis

64 MCQs

Regular Expressions

64 MCQs

Finite Automata

48 MCQs

Syntax Analyser

29 MCQs

Semantic Analyser

11 MCQs

Run Time Environment

10 MCQs

Code Generation

12 MCQs

Code Optimization

22 MCQs

Parsing

110 MCQs

Transformation from NFA to DFA

15 MCQs

Cross Compiler

15 MCQs

Epsilon Moves

15 MCQs