CS101 532 CS201 225 CS301 232 CS302 174 CS304 192 CS401 224 CS402 258 CS403 228 CS408 113 CS411 121 CS502 249 CS504 268 CS601 679 CS604 381 CS605 261 CS607 184 CS609 230 CS610 300 CS614 100 CS703 65
Code Question Option A Option B Option C Option D Answer
CS402 Tm Is More Powerful Than Fsm Because The Tape Movement Is Confined To One Direction It Has No Finite State Control It Has The Capability To Remember Arbitrary Long Sequences Of Input Symbols None Of These B
CS402 To Describe The Complement Of A Language It Is Very Important To Describe The ----------- Of That Language Over Which The Language Is Defined String Regular Expression Alphabet Word C
CS402 To Examine Whether A Certain Fa Accepts Any Words It Is Required To Seek The Paths From __________ State Final To Initial Final To Final Initial To Final Initial To Initial C
CS402 Two Machines Are Said To Be Equivalent If They Print The Same Output String When The Different Input String Is Run On Them True False Depends On Language May Be Or May Not Be B
CS402 Using Tree Structure Final State Represent By * - Double Circle None Of Given C
CS402 What Do Automata Mean? Something Done Manually Something Done Automatically Both Of These None Of These B
CS402 What Is False About The Term Alphabet? It Is A Finite Set Of Symbols It Is Usually Denoted By Greek Letter Sigma It Can Be An Empty Set Strings Are Made Up Of Its Elements C
CS402 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 C
CS402 Which Of The Following Is Not A Regular Language? String Of 0’S Whose Length Is A Perfect Squere Set Of All Palindromes Made Up Of 0’S And 1’S String Of 0’S Whose Length Is A Prime Number All Of The Given Options B
CS402 Which Of The Following Is Not A Word Of Language Equal? Aaabbb Abbbabaa Abababa Bbbaaa C
CS402 Which Of The Following Statement Is Not True Fa Can Be Considered To Be An Nfa Fa Can Be Considered To Be An Nfa With Null String Nfa Can Be Considered To Be An Tg Tg Can Be Considered To Be An Nfa D
CS402 Which Of The Following States Is Not Part Of Pda Start Accept Wrtite Reject C
CS402 Which Statement Is True The Tape Of Turing Machine Is Infinite The Tape Of Turing Machine Is Finite The Tape Of Turing Machine Is Infinite When The Language Is Regular The Tape Of Turing Machine Is Finite When The Language Is Nonregular A
CS402 Which Statement Is True? The Tape Of Turing Machine Is Infinite The Tape Of Turing Machine Is Finite The Tape Of Turing Machine Is Infinite When The Language Is Regular The Tape Of Turing Machine Is Finite When The Language Is Nonregular A
CS402 Which Statement Is True? All Words Are Strings All Strings Are Words Both Are Always Same None Of These A
CS402 Which Statement Is True? The Pda Must Have One Accept State And One Reject State The Pda Must Have One Accept State And Two Reject State The Pda Must Have Two Accept State And Two Reject State There Is No Reject State In The Pda D
CS402 While Finding Re Corresponding To Tg We Connect The New Start State To The Old Start State By The Transition Labeled By A B Null String None Of The Given Options C
CS402 Who Did Not Invent The Turing Machine? Alan Turing A. M. Turing Turing None Of These B