Cs402 FinalTerm Most Important Repeated Mcqs Online Quiz Cs402 FinalTerm Most Important Repeated Mcqs Online Quiz Cs402 quiz helps us to increase our knowledge 1 / 22 We can find a CFG corresponding to a DFA. True False 2 / 22 If L is a regular language then LC is also a regular language. True False 3 / 22 PDA is only used to represent a regular language. True False 4 / 22 If L is a regular language then, Lcis also a _____ language. Regular Non-regular Regular but finite None of the given 5 / 22 Like TG, a PDA can also be non-deterministic True False 6 / 22 The word „formal‟ in formal languages means The symbols used have well defined meaning They are unnecessary, in reality Only the form of the string of symbols is significant None of these 7 / 22 Which of the following is a regular Context Free Grammar: S → abS| baS | ^ S → aSb| baS | ^ S → abS| bSa | ^ S → aSb| Sa | ^ 8 / 22 (Σ* - L) represent the _______ of a language L. Complement Kleene‟s closure Union intersection 9 / 22 The above machine is a/anTG ___________ Finite Automata Turing machine FA TG 10 / 22 For every Context Free Grammar (CFG), we can make the corresponding __ FA TG PDA Regular Grammar 11 / 22 We cannot write regular expressions for all _ FA‟s TG‟s NFA‟s CFG’s 12 / 22 If r1 is a regular expression then r1* is a ___ GTG NFA FA RE 13 / 22 Alphabet Σ = {a, bc, cc} has number of letters One Two Three Four 14 / 22 The first rule of converting the given “CFG in CNF”, is _____ CNK algorithm CYK algorithm CKY algorithm KYC algorithm 15 / 22 The process of finding the derivation of the word generated by particular grammar is called Processing Parsing Programming Planning 16 / 22 where the input string is placed before it is run, is called __ Date tape Input Tape Output Tape Magnetic tape 17 / 22 Which of the following is a regular language? String of odd number of zeroes Set of all palindromes made up of 0‟s and 1‟s String of 0‟s whose length is a prime number All of these 18 / 22 In CFG, the symbols that can‟t be replaced by anything are called__ Terminal Non-Terminal Production All of given 19 / 22 If L is a regular language then, Lcis also a _____ language Regular Non-regular Regular but finite None of the given 20 / 22 Even-palindrome is a _______ language Non-regular Regular Regular but infinite Regular but finite 21 / 22 According to 1st part of the Kleene‟s theorem, If a language can be accepted by an FA then it can be acceptedby a ________ as well FA CFG GTG TG 22 / 22 “One language can have _________ TG‟s” Only one Only two More than one Only three Your score isThe average score is 0% 0% Restart quiz