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 In Drawing Fa3 (Which Is Equal To Fa1 + Fa2) A State Will Be Declared Final If States Of Both Fa’S Are Final At Least One State Is Final Depends On Language None Of The Given B
CS402 In Fa Final State Represent By ___________Sign + - = * A
CS402 In Fa If One Enters In A Specific State But There Is No Way To Leave It Then That Specific State Is Called Dead States Waste Baskets Davey John Lockers All Of These D
CS402 In Fa If One Enters In A Specific State But There Is No Way To Leave It Then That Specific State Is Called __________ Dead State Waste Basket Davey John Locker All Of These A
CS402 In Fa One Enter In Specific Stat But There Is No Way To Leave It Then State Is Called Dead States Waste Baskets Davey John Lockers All Of Above D
CS402 In Fa Starting State Is Represented By A __________ Sign + - * S A
CS402 In Gtg If A State Has More Than One Incoming Transitions From A State. Then All Those Incoming Transitions Can Be Reduced To One Transition Using __________ Sign - + * None Of The Given B
CS402 In Gtg’S There May Exist No Path For A Certain String True False Depends On Alphabet None Of These A
CS402 In New Format Of An Fa This State Is Like Dead-End Non Final State Accept Reject Statr Read B
CS402 In Polish Notation (O-O-O) Is The Abbreviation Of__________? Operand - Operator – Operand Operand - Operand- Operator Operator -Operand – Operand Operand -Operand – Operand C
CS402 In Pref(Q In R) Q Is ___________ To (Than) R Q Is Not Equal To R Q Is Equal To R Q Is Infinite None Of Them A
CS402 In Pumping Lemma Theorem (X Y^N Z) The Range Of N Is N=1 2 3 4………. N=0 1 2 3 4………. N=…….-3 -2 -1 0 1 2 3 4…… N=…….-3 -2 -1 1 2 3 4…… A
CS402 In Tg There May Be A Transition For Null String True False Can’T Show Transition For String None Of These A
CS402 In Tg There May Exist More Than One Path For Certain String True False Depends On The Language None Of These A
CS402 In Tg There May Exist No Paths For Certain String True False Depends On The Language None Of These A
CS402 In Tg There May Exist No Paths For Certain String True False Depends On The Language None Of These A
CS402 In The Null Production N --> ^ N Is A Terminal Non Terminal Word None Of The Given Options B
CS402 In Which Of The Following Language Rev(S)=S Equal Integer Palindrome Factorial C
CS402 It Delays The Transmission Of Signal Along The Wire By One Step (Clock Pulse) Or Box Delay Box Nand Box And Box B
CS402 It Is Very Important To Determine Which Sequences Of Rows Do Correspond To Possible Paths Through The Cfg Cfl Pda Tape C