CS402 Quiz No. 2 Lecture 31 to 42 (18th and 19th February)

[+ Ijaz]

Quiz No. 2 will be opened on 18th February, 2016 and it will contain Lecture 31 to 42. The quiz will remain open for two days (18th and 19th February) only. No extra time will be given afterwards if quiz is missed due to any reason.

[A *]

Plzzz share your quiz.....

[Javed]

It seems nobody has yet taken the quiz . . . 

[Nauman]

In a STACK: The element PUSHed first is POPed first The element PUSHed first is POPed in the last (Page 107 concept) The element PUSHed in last is POPed in last None of given options

[+ Ijaz]

CS402 Quiz #2 Lecture 31-42    Friday, 19 February, 2016

Question # 1 of 10 ( Start time: 10:41:40 PM )          Total Marks: 1

Identify the FALSE statement about following CFG: S -> SB|AB A -> CC B -> b C -> a

Select correct option

           

CFG generates NULL string

           

CFG is not in CNF

           

CFG has 8 Nonterminals

           

All of the given options

Question # 2 of 10 ( Start time: 10:43:05 PM )          Total Marks: 1

The operators like (* , +) in the parse tree are considered as ________.

Select correct option

           

terminals ok******************

           

non-terminals

           

productions

           

intermediates

 

sec(s)  

Question # 3 of 10 ( Start time: 10:44:12 PM )          Total Marks: 1

The production of the form: Non-terminal-> ^ is said to be ______ production.

Select correct option

           

NULLok*****************

           

UNIT

           

Chomsky form production

           

CNF

Question # 4 of 10 ( Start time: 10:45:42 PM )          Total Marks: 1

In conversion form of PDA, there is _________ accept state(s).

Select correct option

           

More than One

           

At least one

           

Exactly one

           

At most one

Question # 5 of 10 ( Start time: 10:47:16 PM )          Total Marks: 1

Which of the following statement is FALSE?

Select correct option

           

Every Regular Expression be expressed by a CFG.

           

Every CFG cannot be expressed as a regular expression.

           

For a PDA, there exists a CFG that represents the same language.

           

For every PDA, there always exists a regular expression.

   Click here to Save Answer & Move to Next Question

 

Question # 6 of 10 ( Start time: 10:48:58 PM )          Total Marks: 1

The CFG S--> aSa | bSb | a | b | ^ represents ___________ language.

Select correct option

           

EVEN-EVEN

           

PALINDROMEok*****************

           

EQUAL

           

ODD-ODD

   Click here to Save Answer & Move to Next Question

 

Question # 7 of 10 ( Start time: 10:50:18 PM )          Total Marks: 1

To write the expression from the tree, it is required to traverse from ___________.

Select correct option

           

Top to bottom of the tree

 

           

Left side of the tree ok*****************

           

Bottom to top of the tree

           

Right side of the tree

  

Question # 8 of 10 ( Start time: 10:51:44 PM )          Total Marks: 1

In conversion form of PDA no two ___________ states exist in a row without _________ state.

Select correct option

           

PUSH , READ

           

POP ,  READ

           

PUSH , START

           

POP , REJECT

Question # 9 of 10 ( Start time: 10:53:15 PM )          Total Marks: 1

In nondeterministic PDA, a string is supposed to be accepted if there exists at least one path traced by the string, leading to ______ state.

Select correct option

           

ACCEPT ok*****************

           

REJECT

           

START

           

READ

  

Question # 10 of 10 ( Start time: 10:54:35 PM )        Total Marks: 1

In conversion form of PDA there is no __________ state.

Select correct option

           

PUSH

           

READ

           

ACCEPT

           

REJECT ok*****************

[asmat]

In polish notation, (o-o-o) is the abbreviation of _________.

START, READ, HERE and ACCEPT states are called the ____ of machine.

The part of an FA, where the input string is placed before it is run, is called _______

non-terminal is denoted by _______________

the symbols that can not be replaced by anything are called _____________

a tree for all the possible strings of CFG is called ______________