CIT342 Tma Solutions

CIT342

Question: A grammar is ambiguous, if it is possible to generate syntax trees for an expression.
Answer: two different

Question: Which of the following statements are true? Statement 1 : Initial state of NFA is initial state of DFA. Statement 2 : The final state of DFA will be every combination of final state of NFA.
Answer: statement 1 is true and statement 2 is true

Question: Which of the following is correct proposition? Statement 1 : Non determination is a generalisation of determinism. Statement 2 : Every DFA is automatically an NFA.
Answer: statement 2 is correct because statement 1 is correct

Question: Compare the computational power of DFAand NFA
Answer: equal

Question: The following grammar G = ( {s}, {a,b}, s, s -> asb|bsa|ss|î» generates strings having‭ ‬
Answer: equal numbers of a\’s and b\’s

Question: A push down automata can be represented using .
Answer: all of the options

Question: Concatenating the empty set to any set yields {1 *!• = }
Answer: !•

Question: Pop operation on a stack indicates
Answer: removal of elements

Question: Every state of a DFA always has exactly existing transition arrow for each symbol in the alphabet.
Answer: 1

Question: Given the alphabet Σ = {0,1} { w|w contains the string 001 as a substring} is
Answer: l£*001l£*

For your Free Past Questions I Free Exams Summary I Free Past Tma Questions follow on Twitter

Whatsapp: 08039407882 for your Exam Summary I Online Tutorial I Projects Writeups I To become a Tutor

Leave a Reply

MEET OVER 2000 NOUN STUDENTS HERE. 

Join us for latest NOUN UPDATES and Free TMA answers posted by students on our Telegram. 

OUR ONLINE TUTORIAL CLASS IS NOW ON!!! JOIN US NOW. 
JOIN NOW!
close-link
%d bloggers like this: