Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

101.

For a give Moore Machine, Given Input=’101010’, thus the output would be of length:(a) |Input|+1(b) |Input|(c) |Input-1|(d) Cannot be predictedThe question was posed to me in an online interview.This question is from Moore Machine in portion Finite Automata of Automata Theory

Answer» CORRECT option is (a) |Input|+1

To EXPLAIN I would say: Initial state, from which the OPERATIONS begin is ALSO initialized with a value.
Discussion
102.

A Language for which no DFA exist is a________(a) Regular Language(b) Non-Regular Language(c) May be Regular(d) Cannot be saidI got this question in my homework.My question is from Deterministic Finite Automata-Introduction and Definition topic in section Finite Automata of Automata Theory

Answer»

Correct choice is (b) NON-Regular Language

The best explanation: A language for which there is no EXISTENCE of a deterministic finite automata is always Non Regular and METHODS LIKE Pumping Lemma can be used to prove the same.
Discussion
103.

The production of form non-terminal -> ε is called:(a) Sigma Production(b) Null Production(c) Epsilon Production(d) All of the mentionedThis question was addressed to me in an online interview.This key question is from The Language of NFA in division Finite Automata of Automata Theory

Answer»

The correct option is (B) NULL Production

Easiest explanation: The production of FORM non-terminal ->ε is call null production.
Discussion
104.

Number of final state require to accept Φ in minimal finite automata.(a) 1(b) 2(c) 3(d) None of the mentionedThe question was asked in exam.This question is from Finite Automata in section Finite Automata of Automata Theory

Answer» RIGHT OPTION is (d) None of the mentioned

Easiest explanation: No FINAL state requires.
Discussion
105.

Which of the following is the corresponding Language to the given DFA?(a) L= {x ϵ {0, 1} * | x ends in 1 and does not contain substring 01}(b) L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}(c) L= {x ϵ {0,1} |x ends in 1 and does not contain substring 00}(d) L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 11}I got this question in unit test.I want to ask this question from DFA Processing Strings in chapter Finite Automata of Automata Theory

Answer»

The CORRECT option is (b) L= {X ϵ {0,1} * |x ends in 1 and does not contain substring 00}

To explain: The Language can be anonymously checked and thus the ANSWER can be predicted. The language needs to be accepted by the automata (acceptance state) in order to prove its regularity.
Discussion
106.

The ratio of number of input to the number of output in a mealy machine can be given as:(a) 1(b) n: n+1(c) n+1: n(d) None of the mentionedThis question was addressed to me in final exam.My doubt stems from Mealy Machine in division Finite Automata of Automata Theory

Answer» RIGHT ANSWER is (a) 1

To EXPLAIN: The number of output here follows the transitions in PLACE of states as in Moore machine.
Discussion
107.

Which of the following does the given Mealy machine represents?(a) 9’s Complement(b) 2’s Complement(c) 1’s Complement(d) 10’s ComplementI got this question in an interview.Enquiry is from Mealy Machine in section Finite Automata of Automata Theory

Answer»

Right OPTION is (C) 1’s Complement

For EXPLANATION I would say: Inputs can be TAKEN and can be verified.
Discussion
108.

In Moore machine, output is produced over the change of:(a) transitions(b) states(c) Both(d) None of the mentionedThe question was asked by my college director while I was bunking the class.My doubt is from Moore Machine in portion Finite Automata of Automata Theory

Answer»

The correct answer is (b) states

The explanation is: MOORE MACHINE produces an output over the CHANGE of transition states while mealy machine does it so for TRANSITIONS itself.
Discussion
109.

If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________(a) Compiler(b) Interpreter(c) Loader and Linkers(d) None of the mentionedThis question was posed to me in quiz.My question is based upon Finite Automata-Introduction topic in division Finite Automata of Automata Theory

Answer»

The correct ANSWER is (a) COMPILER

Easy explanation: A Compiler is USED to give a finite solution to an infinite phenomenon. EXAMPLE of an infinite phenomenon is Language C, ETC.
Discussion
110.

a ^ nb ^ m where n >= 1, m >= 1, nm >= 3 is example of(a) Type 0(b) Type 1(c) Type 2(d) Type 3The question was asked during an online interview.This question is from Union, Intersection & Complement in section Finite Automata of Automata Theory

Answer»

Correct ANSWER is (d) Type 3

The explanation: It is a REGULAR EXPRESSION.
Discussion
111.

Predict the total number of final states after removing the ε-moves from the given NFA?(a) 1(b) 2(c) 3(d) 0This question was addressed to me in an interview for job.My doubt is from Finite Automata with Epsilon Transition topic in portion Finite Automata of Automata Theory

Answer»

The CORRECT choice is (c) 3

Explanation: The NFA which would RESULT after ELIMINATING ε-moves can be shown diagramatically.
Discussion
112.

Which of the following is a regular language?(a) String whose length is a sequence of prime numbers(b) String with substring ww^r in between(c) Palindrome string(d) String with even number of Zero’sI had been asked this question by my college director while I was bunking the class.This interesting question is from The Language of NFA topic in portion Finite Automata of Automata Theory

Answer»

The CORRECT ANSWER is (d) STRING with even number of Zero’s

Explanation: DFSM’s for the first three option is not possible; HENCE they aren’t regular.
Discussion
113.

We can represent one language in more one FSMs, true or false?(a) TRUE(b) FALSE(c) May be true(d) Cannot be saidI had been asked this question by my school principal while I was bunking the class.Question is from The Language of NFA topic in portion Finite Automata of Automata Theory

Answer»

Right choice is (a) TRUE

For explanation: We can represent ONE language in more one FSMs, EXAMPLE for a same language we have a DFA and an equivalent NFA.
Discussion
114.

Which of the following is correct proposition?Statement 1: Non determinism is a generalization of Determinism.Statement 2: Every DFA is automatically an NFA(a) Statement 1 is correct because Statement 2 is correct(b) Statement 2 is correct because Statement 2 is correct(c) Statement 2 is false and Statement 1 is false(d) Statement 1 is false because Statement 2 is falseI had been asked this question during an online interview.This interesting question is from Non Deterministic Finite Automata topic in division Finite Automata of Automata Theory

Answer»

Right option is (b) Statement 2 is correct because Statement 2 is correct

The best I can EXPLAIN: DFA is a SPECIFIC case of NFA.
Discussion
115.

Subset Construction method refers to:(a) Conversion of NFA to DFA(b) DFA minimization(c) Eliminating Null references(d) ε-NFA to NFAI had been asked this question in an international level competition.This interesting question is from The Language of NFA in portion Finite Automata of Automata Theory

Answer»

The correct option is (a) CONVERSION of NFA to DFA

To elaborate: The conversion of a non-DETERMINISTIC automata into a deterministic one is a PROCESS we CALL subset construction or power SET construction.
Discussion
116.

An automaton that presents output based on previous state or current input:(a) Acceptor(b) Classifier(c) Transducer(d) None of the mentioned.The question was asked in exam.Asked question is from Non Deterministic Finite Automata topic in section Finite Automata of Automata Theory

Answer»

Right answer is (c) Transducer

Easiest EXPLANATION: A transducer is an automaton that produces an output on the basis of what input has been given CURRENTLY or PREVIOUS state.
Discussion
117.

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 transitiveThis question was addressed to me during a job interview.This is a very interesting question from Finite Automata-Introduction in chapter Finite Automata of Automata Theory

Answer» CORRECT option is (d) REFLEXIVE and transitive

Easiest explanation: A partially ordered RELATION refers to ONE which is Reflexive, Transitive and Antisymmetric.
Discussion