Whatsapp +92 307 4151718 vuassassins@gmail.com

CS402 – Theory of Automata

In CS402 Theory of Automata we have you covered with Digitized Past Papers From Fall of Mid Term and Final Term.

NOTE: Tab/Click on Preparation Tab to take the MCQ’s Tests.

FINAL TERM

CS402_Final_SolMcqs2013PaperMoaaz                           View     Download

CS402_FinalTermSolvedMcqs2013ByMoaaz                     View     Download

MID TERM

CS402_Mid_2010_Mcqs_Moaaz_Paper5                          View     Download

CS402_Mid_2010_MCQs_Paper3                                      View     Download

CS402_Mid_Fall_MCQs_Paper4                                        View     Download

FINAL QUIZ PREPARATION WITH JAHANZAIB ASHIQ

CS402 – Final Preparation 1

CS402 – Final Preparation 2

CS402 – Final Preparation 3

CS402 – Final Preparation 4

CS402 – Final Preparation 5

CS402 – Final Preparation 6

1 Comment

  1. AYESHA MUMTAZ

    Above given TG represents the language i.e.
    ►EVEN-EVEN (Page 22)
    ►PALINDROME
    ►FACTORIAL
    ►None of these
    Question No: 5 ( Marks: 1 ) – Please choose one
    According to 1st part of the Kleene‟s theorem, If a language can be accepted by an FA then it can be accepted
    by a ________ as well.
    ►FA
    ►CFG
    ►GTG
    ►TG (Page 25)
    Question No: 6 ( Marks: 1 ) – Please choose one
    Even-palindrome is a _______ language.
    ►Non-regular click here for detail
    ►Regular
    ►Regular but infinite
    ►Regular but finite
    Question No: 7 ( Marks: 1 ) – Please choose one
    If L is a regular language then, Lc
    is also a _____ language.
    ► Regular (Page 66)
    ► Non-regular
    ► Regular but finite
    ► None of the given
    Question No: 8 ( Marks: 1 ) – Please choose one
    Pumping lemma is generally used to prove that:
    ► A given language is infinite
    ► A given language is not regular Click here for detail
    ► Whether two given regular expressions of a regular language are equivalent or not
    ► None of these

    3
    Question No: 9 ( Marks: 1 ) – Please choose one
    If the FA has N states, then test the words of length less than N. If no word is accepted by this FA, then it will
    _________ word/words.
    ►accept all
    ►accept no (Page 85)
    ►accept some
    ►reject no

Submit a Comment