CS402 QUIZ NO 1 SOLVED 100% VERIFIED BY ADMIN (MID TERM SYLLABUS)
Q1: Which of the following state is introduced while developing NFA for the closure of an FA?
A) Simply an initial state
B) Final state
C) An initial state which should be final as well (100% Sure)
D) An initial state with loop for all letters
Q2: Let S = {aa, bb}, then S* will have the __________ string.
A) ^ (100% Sure)
B) abba
C) aabbbaa
D) bbaab
Q3: What do automata mean?
A) Something done automatically(100% Sure)
B) Something done manually
C) Both of these
D) None of these
Q4: If two RE's generate same language then these RE's are called __________.
A) Same RE
B) Equal RE
C) Similar RE
D) Equivalent RE (100% Sure)
Q5: FA stands for __________.
A) Finite Automaton (100% Sure)
B) Fixed Automaton
C) False Automaton
D) Functional Automaton
Q6: While finding RE corresponding to TG, If TG has more than one start state then.
A) Introduce the new start state (100% Sure)
B) Eliminate the old start state
C) Replace the old start state with final state
D) Replace the old final state with new start state
Q7: We can create an equivalent __________ for a language for which we create an __________.
A) FA, NFA (100% Sure)
B) NFA, FA
C) FA, GTG
D) None of the given options
Q8: Formal is also known as _________.
A) Syntactic language (100% Sure)
B) Semantic langauge
C) Informal language
D) None of these
Q9: The minimum length of the string (except null string) of a language that starts and ends in the same letter will be:
A) 1
B) 2 (100% Sure)
C) 3
D) 4
Q10: Languages generated by kleene star are always __________.
A) Finite
B) Inifinite (100% Sure)
C) Sometimes finite and sometimes infinite
D) None of the these
