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 The Language Generated By The Cfg Is Called The Language ___________ By The Cfg Produced Null String Pumping Lemma Non Of Then A
CS402 The Language Q Is Infinite True False Na Na A
CS402 The Language Q Is Said To Be Quotient Of Two Regular Languages P And R Denoted By--- If Pq=R R=Q/P Q=R/P Q=P/R P=R/Q B
CS402 The Language That Can Be Expressed By Any Regular Expression Is Called A Non Regular Language True False Na Na B
CS402 The Languages -------------- Are The Examples Of Non Regular Languages Even-Even And Prime Palindrome And Prime Palindrome And Even-Even Factorial And Squre B
CS402 The Langue Generated By Cfg Is Called Context Free Language (Cfl) True False Na Na A
CS402 The Length Of Output String In Case Of ___________ Is One More Than The Length Of Corresponding Input String Finite Automaton Tg Gtg None Of These A
CS402 The Locations Into Which We Put The Input Letters On Input Tap Are Called Words Alphabets Cells Elements C
CS402 The Machine Helps In Building A Machine That Can Perform The Addition Of Binary Numbers Incrementing Complementing Decrementing None Of The Given A
CS402 The Major Problem In The Earliest Computers Was To Store The Contents In The Registers To Display Mathematical Formulae To Load The Contents From The Registers To Calculate The Mathematical Formula B
CS402 The Moment A Final State Of ___________ Fa Is Entered The Possibility Of The Initial State Of __________ Fa Will Be Included As Well First Third First Second Second Third All Of Above B
CS402 The Part Of An Fa Where The Input String Is Placed Before It Is Run Is Called State Transition Input Tape Output Tape C
CS402 The Pda Is Called Non-Deterministic Pda When There Are More Than One Out Going Edges From……… State Start Or Read Pop Or Reject Read Or Pop Push Or Pop C
CS402 The Process Of Finding The Derivation Of Word Generated By Particular Grammar Is Called Plus Timing Parsing Halt All Of Above B
CS402 The Production Of The Form Non Terminal ? ? Is Said To Be Null Production True False Depends On The Language None Of Given A
CS402 The Production Of The Form Nonterminal ?? Is Said To Be Null Production True False Na Na A
CS402 The Production Of The Form Nonterminal ?One Nonterminal Is Called The Null Production Null Able Production Unit Production None Of The Given C
CS402 The Production Of The Form Nonterminal ?String Of Two Nonterminals Is Called A Live Production Dead Production Type Of Production None Of Them A
CS402 The Production Of The Form: Nonterminal-> ^ Is Said To Be Production Null Unit Chomsky Form Production None Of The Given Options A
CS402 The Production S --> Ss | A | B | ^ Can Be Expressed By Re (A+B)+ (A+B) (A+B)* (Ab)* C