CS402 Quiz Solution

CS402 Quiz Solution If the intersection of two regular languages is regular then the complement of the intersection of these two languages i

CS402 Quiz Solution


If the intersection of two regular languages is regular then the complement of the intersection of these two languages is __________.

Regular


The language of all strings partition ∑* into ___________ class(es).

Two

 

The language of all strings not beginning with ‘b’ partitions ∑* into ___________distinct classes.

 

Two

 

If Q = {xx, xyxxxy }, and R = {xyxyxyxxyy, xyxyyyxx} then Pref( Q in R) = ____________

xyxyyy


A language ending with ‘b’ partitions ∑* into ___________distinct classes.

Three

 

If R is regular language and Q is any language (regular/ non-regular), then Pref( _______in _______) is regular.

Q,R


The reverse of the string sbfsbb over { sb, f, b }

Sb, f, sb, b

Bsbfsb


The basic approach of Myhill Nerode theorem is similar to the concept of:

concatenation of FAs

 

 

If there is no final state of two FAs then their ______ also have no _____ state

union, final

If an FA has N states then it must accept the word of length

N

 

For a machine with N number of sta., the total number of strings to be tested, defined over an alphabet of m letters, is

 

mN +mN+1+ mN,-2 ,m2N-1

 

Which of the following is not a true theorem?

 

Pseudo theorem

 

The language "PRIME” is an example of language.

 

non regular

 

The product of two regular languages is

 

Regular

 

One language can have _______ CFG(s).

 

More than one

 

 

Which of the following is a non-regular language?

 

Prime

 

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 no

 

In large FA with thousands of states and millions of directed edges, without an effective procedure it is ______ to find a path from initial to final state.

 

Impossible

 

A problem that has decision procedure is called problem.

 

Decidable problem

 

Which one of the following languages is a non regular language?

 

Palindrome

 

Using Myhill Nerode theorem we partition sigma star into distinct

 

Classes

 

In pumping lemma theorem (x y"n z) the range of n is

 

n=1. 2, 3, 4.......

 

The values of input (say a & b) do not remain same in one cycle due to

 

NOT gate

 

The operators like (*" +) in the parse tree are considered as 

 

Terminals

 

Even-Even language partitions ∑*  into _________ distinct classes.

 

Four

 

The strings or words which do not belong to a language are called _________ of that language.

 

 Complement

 

The production S —> SS lalbl^ can be expressed by Regular expression

 

(a+b)+

 

if L1 and L2 are two regular languages. then they expressed by FAs.

 

can be

 

The grammatical rules which involve meaning of words are called 

 

Semantics

 

Set of all palindromes over (a,b) is:

 

Regular and finite

 

The language of all strings not beginning with partitions “b" into  distinct classes.

 

Two

 

The CFG is said to be ambiguous if there exist at least one word of its language that can be generated by production trees.

 

More than one

 

The CFG S —> aSb|abl^ is used to express the language

 

Palindrome

 

A non regular language can be represented by

 

None of the given options

 

In large FA with thousands of states and millions of directed edges, without an effective procedure it is ________ to find a path from initial to final state.

Impossible


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

Operator - Operand – Operand


If an FA has N states then it must accept the word of length

N


Using Myhill Nerode theorem we partition sigma star into distinct __________.

classes


If a language is regular it must generate ____________ number of distinct classes.

finite


If L1 and L2 are regular languages then which statement is NOT true?

L1/L2 is always regular


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 no


A problem that has decision procedure is called _________ problem.

decidable


If L1 and L2 are two regular languages, then they _______ expressed by FAs.

can be


A language that can be expressed by RE, is said to be a _______ language.

regular

 

 

The values of input (say a & b) do not remain same in one cycle due to

NOT gate


Prime is a ______________ language.

non-regular


If an effectively solvable problem has answer in YES or NO, then the solution is called _________.

decision procedure


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

Left side of the tree


If there is no final state of two FAs then their ______ also have no _____ state

union,final


In CFG, symbols that cannot be replaced by anything are called __________.

terminals


Finite Automaton (FA) must have __________ number of states while a language has _________ words.

finite, infinite


The language “PRIME” is an example of ________ language.

non regular


Using Myhill Nerode theorem we partition sigma star into distinct __________.

classes


Even-Even language partitions ∑* into ___________ distinct classes.

four


What will be the 9’s complement of the number 872?

127


In pref(Q in R), Q is _______ to/than R.

Not equal


There is at least one production in CFG that has one _________ on its left side.

Non terminal


In pumping lemma theorem (x y^n z) the range of n is

n=1, 2, 3, 4……….


A language ending with ‘b’ partitions ∑* into ___________distinct classes.

three

 

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

terminals


For a machine with N number of states, the total number of strings to be tested, defined over an alphabet of m letters, is _____________.

mN +mN+1+ mN+2 +… +m2N-1


In a CFG, the non-terminals are denoted by _________.

Capital letters

 

If an FA accepts a word then there must exist a path from __________.

Incase of Myhill Nerode theorem, if a language L partitions sigma star into distinct classes and L is also regular then L generates ___________ number of classes.

finite


Which of the following is pumped to generate further strings in the definition of Pumping Lemma?

y


The complement of a regular language is also __________.

regular

 

Question # 1 of 10 ( Start time: 04:12:20 PM )  Total Marks: 1

An FA has same initial and _____ state, then it means that it has no _______ state.
Select correct option:

 initial, final
 final, initial
 initial, initial
 none of the given options


Question # 2 of 10 ( Start time: 04:13:44 PM )  Total Marks: 1
The product of two regular languages is __________.
Select correct option:

 regular
 infinite
 non-regular
 closure of a regular language


Question # 3 of 10 ( Start time: 04:14:36 PM )  Total Marks: 1
According to Myhill Nerode theorem, if L generates finite no. of classes then L is.......
Select correct option:

 Finite
 Infinite
 Regular
 Non regular


Question # 4 of 10 ( Start time: 04:15:19 PM )  Total Marks: 1
Two languages are said to belong to same class if they end in the same state when they run over an FA, that state
Select correct option:

 Must be final state
 May be final state or not
 May be start state or not
 None of the given option


Question # 5 of 10 ( Start time: 04:16:38 PM )  Total Marks: 1
In pref(Q in R) Q is …… to (than) R
Select correct option:

 Equal
 Not equal
 Greater
 Smaller


Question # 6 of 10 ( Start time: 04:17:14 PM )  Total Marks: 1
For language L defined over {a, b},then L partitions {a, b}* into …… classes
Select correct option:

 Infinite
 Finite
 Distinct
 Non distinct



Question # 7 of 10 ( Start time: 04:18:26 PM )  Total Marks: 1
Which of the following is not a true theorem?
Select correct option:

 Decidability theorem
 Equivalency theorem
 Myhill Nerode theorem
 Pseudo theorem


Question # 8 of 10 ( Start time: 04:19:37 PM )  Total Marks: 1
If a regular expression contains * then it _______ define an ________ language.
Select correct option:

 always, finite
 may, infinite
 always, infinite
 None of the given options


Question # 9 of 10 ( Start time: 04:20:48 PM )  Total Marks: 1
a^n b^n generates the ………… language
Select correct option:

 regular
 non regular
 EQUAL and non regular
 EQUAL and regular


Question # 10 of 10 ( Start time: 04:21:23 PM )  Total Marks: 1
To examine whether a certain FA accepts any words, it is required to seek the paths _______ state.
Select correct option:

 from final to initial
 from initial to initial back
 from final to back final
 from initial to final

Question # 3 of 10 ( Start time: 06:25:04 PM )  Total Marks: 1
If r1 and r2 are regular expressions then which of the following is not regular expression
r1 + r2
r1 r2
r1*
r1 – r2
Question # 4 of 10 ( Start time: 06:25:47 PM )  Total Marks: 1
Kleene star closure can be defined
Over any set of string
Over specific type of string
Question # 5 of 10 ( Start time: 06:26:29 PM )  Total Marks: 1
Which of following string(s) belongs to the language of the regular expression (aa*b)*?

baabab
abbbaa
aaaaaa
aabaab
Question # 6 of 10 ( Start time: 06:27:05 PM )  Total Marks: 1
According to theory of automata there are _________ types of languages
Select correct option:
One
Two
Three
Four
Question # 7 of 10 ( Start time: 06:27:38 PM )  Total Marks: 1
If S = {aa, bb}, then S* will not contain
aabbaa
bbaabbbb
aaabbb
aabbbb
Question # 8 of 10 ( Start time: 06:28:25 PM )  Total Marks: 1
Every non deterministic Finite Automata can be converted into
Regular Expression
Deterministic Finite Automata
Trasition Graph
All of the given options
Question # 9 of 10 ( Start time: 06:29:38 PM )  Total Marks: 1
The states in which there is no way to leave after entry are called
Davey John Lockers
Dead States
Waste Baskets
All of the given options
Question # 10 of 10 ( Start time: 06:30:18 PM )  Total Marks: 1
(a* + b*)* = (a + b)* this expression is _________
True
False
Question # 1 of 10 ( Start time: 06:34:10 PM )  Total Marks: 1
What is false about the PALINDROME LANGUAGE?
Every word is reverse of itself.
It is an infinite language.
FA can be build for it.
None of the given optio
Question # 2 of 10 ( Start time: 06:35:40 PM )  Total Marks: 1
FA is also called
TG
GTG
NFA
DFA
Question # 3 of 10 ( Start time: 06:36:21 PM )  Total Marks: 1
Kleene star closure can be defined

Over any set of string
Over specific type of string
Question # 4 of 10 ( Start time: 06:36:35 PM )  Total Marks: 1
[(a + b)(a + b)]*, given RE cannot generate the string ________

abbaabab
abbbaa
bbbbbb
abbbaaaaa
Question # 5 of 10 ( Start time: 06:37:19 PM )  Total Marks: 1
In an FA, when there is no path starting from initial state and ending in final state then that FA
accept null string
accept all strings
accept all non empty strings
does not accept any string
Question # 6 of 10 ( Start time: 06:38:22 PM )  Total Marks: 1
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
Question # 7 of 10 ( Start time: 06:39:30 PM )  Total Marks: 1
According to theory of automata there are _________ types of languages
One
Two
Three
Four
Question # 8 of 10 ( Start time: 06:39:43 PM )  Total Marks: 1
While finding RE corresponding to TG, If TG has more than one final state then
Introduce the new final state
Eliminate the old final state
Replace the old final state with start state
Replace the old final state with new start state
Question# 9 of 10 ( Start time: 06:40:51 PM )  Total Marks: 1
The states in which there is no way to leave after entry are called
Select correct option:

Davey John Lockers
Dead States
Waste Baskets
All of the given options
Question # 10 of 10 ( Start time: 06:41:07 PM )  Total Marks: 1
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 elemen 

COMMENTS

Read More Here ⇙
Read More Here ⇙
Name

ACC,1,Announcements,3,Assignments,17,bif,7,BIF602,1,BIF731,1,BIF732,1,BIF733,1,bio,23,BIO201,1,BIO202,1,BIO203,1,BIO204,1,BIO301,1,BIO302,1,BIO303,1,BIO401,1,BIO502,1,BIO731,1,BIO732,1,BIO733,1,BIO734,1,BNK,6,BNK601,1,BNK603,1,BNK610,1,BNK611,1,BNK612,1,BNK613,1,bt,34,BT101,1,BT102,1,BT301,1,BT302,1,BT404,1,BT406,1,BT501,1,BT503,1,BT504,1,BT603,1,BT605,1,BT731,1,BT732,1,BT733,1,BT734,1,BT735,1,che,3,CHE301,1,Cisco,1,CS,65,cs101,2,CS201,1,CS202,1,CS205,1,CS206,1,CS301,1,CS302,1,CS304,1,CS311,1,CS312,1,CS315,1,CS401,1,CS402,1,CS403,1,CS405,1,CS407,1,CS408,1,CS410,1,CS411,1,CS432,1,CS435,1,cs501,6,CS502,1,CS504,1,CS506,1,CS507,1,CS508,1,cs601,2,CS602,1,CS603,1,CS604,1,CS605,1,CS606,3,CS607,1,CS609,1,CS610,1,CS611,1,CS614,1,CS615,1,CS620,1,CS701,1,CS702,1,CS703,1,CS704,1,CS706,1,CS707,1,CS708,1,CS709,1,CS710,1,CS711,1,CS712,1,CS713,1,CS716,1,CS718,1,CS721,1,CS723,1,CS724,1,CS725,1,CS726,1,Cybersecurity,1,ECO,11,ECO401,1,ECO402,1,ECO403,1,ECO404,2,ECO501,1,ECO601,1,ECO603,1,ECO606,1,ECO615,1,EDU,30,EDU101,1,EDU201,1,EDU301,1,EDU303,1,EDU304,1,EDU305,1,EDU401,1,EDU402,1,EDU403,2,EDU404,1,EDU405,1,EDU406,1,EDU410,1,EDU411,1,EDU430,1,EDU431,1,EDU501,1,EDU505,1,EDU510,1,EDU512,1,EDU515,1,EDU516,1,EDU601,1,EDU602,1,EDU603,1,EDU604,1,EDU654,1,EDU705,1,EDU712,1,ENG,21,ENG001,1,ENG101,1,ENG201,1,ENG301,1,ENG501,1,ENG502,1,ENG503,1,ENG504,1,ENG505,1,ENG506,1,ENG507,1,ENG508,1,ENG509,1,ENG510,1,ENG511,1,ENG512,1,ENG513,1,ENG515,1,ENG516,1,ENG518,1,ENG519,1,ETH,1,ETH202,1,extension,1,FIN,7,FIN611,1,FIN621,1,FIN622,1,FIN623,1,FIN625,1,FIN630,1,FIN701,1,GDB Solution,1,GEN,2,GEN731,1,GEN732. Mahar Waqas,1,grand quiz,20,GSC,2,GSC101,1,GSC201,1,Handouts,1,HRM,6,HRM613,1,HRM617,1,HRM624,1,HRM626,1,HRM627,1,HRM713,1,Important Question,4,ISL,1,isl201,2,IT,1,IT430,1,Mahar Waqas,309,MCD,8,MCD401,1,MCD402,1,MCD403,1,MCD404,1,MCD501,1,MCD502,1,MCD503,1,MCD504,1,MCM,16,MCM101,1,MCM301,1,MCM304,1,MCM310,1,MCM311,1,MCM401,1,MCM404,1,MCM411,1,MCM501,1,MCM511,1,MCM514,1,MCM515,1,MCM516,1,MCM604,1,MCM610,1,Mega files,334,MGM,1,MGMT,15,MGMT611,1,MGMT614,1,MGMT615,1,MGMT617,1,MGMT622,1,MGMT623,1,MGMT625,1,MGMT627,1,MGMT628,1,MGMT629,1,MGMT630,1,MGMT631,1,MGMT715,1,MGMT727,1,MGMT731,1,MGT,19,MGT101,1,MGT111,1,MGT201,1,MGT211,1,MGT301,2,MGT401,1,MGT402,1,MGT404,1,MGT411,1,MGT501,1,MGT502,1,MGT503,1,MGT504,1,MGT510,1,MGT513,1,MGT520,1,MGT522,1,MGT601,1,MGT602,1,MGT603,1,MGT604,1,MGT610,1,MGT611,1,MGT612,1,MGT613,1,MGT621,1,MGT703,1,MGT705,1,MKT,13,MKT501,1,MKT529,1,MKT530,1,MKT603,1,MKT610,1,MKT611,1,MKT621,1,MKT624,1,MKT625,1,MKT626,1,MKT627,1,MKT630,1,Moazz,333,moazz and Mahar Waqas,1,mth,4,MTH Mahar Waqas,24,MTH001,1,MTH100,1,MTH101,1,MTH102,1,MTH201,1,MTH202,1,MTH301,1,MTH302,1,MTH303,1,mth401,2,MTH501,2,MTH601,1,MTH603,1,MTH621,1,MTH622,1,MTH631,1,MTH632,1,MTH633,1,MTH634,1,MTH641,1,MTH701,1,MTH706,1,MTH7123,1,MTH718,1,MTH721,1,PAD,1,PAD603,1,PAK,2,PAK301,1,PAK302,1,past Papers,399,Phy,3,PHY101,1,PHY301,1,Pk,1,PSC,2,PSC201,1,PSC401,1,psy,20,PSY101,1,PSY401,1,PSY403,1,PSY404,1,PSY405,1,PSY406,1,PSY407,1,PSY408,1,PSY409,1,PSY502,1,PSY504,1,PSY510,1,PSY511,1,PSY512,1,PSY513,1,PSY514,1,PSY610,1,PSY631,1,PSY632,1,Quiz Solution,18,screenshot,2,SEC,1,SEC001,1,SOC,8,SOC101,1,SOC301,1,SOC302,1,SOC401,1,SOC402,1,SOC403,1,SOC601,1,SOC603,1,STA,11,STA100,1,STA301,1,STA621,1,STA630,1,STA631,1,STA632,1,STA642,1,STA643,1,STA644,1,STA730,1,URD,1,URD101,1,Video,6,vu,26,vu toolkit,5,Waqar Siddhu,334,zoo,18,ZOO301,1,ZOO502,1,ZOO503,1,ZOO504,2,ZOO505,1,ZOO731,1,
ltr
item
VU Grand Quiz Assignment GDB past Papers exam: CS402 Quiz Solution
CS402 Quiz Solution
CS402 Quiz Solution If the intersection of two regular languages is regular then the complement of the intersection of these two languages i
VU Grand Quiz Assignment GDB past Papers exam
https://vueducationhub.blogspot.com/2020/08/cs402-quiz-solution.html
https://vueducationhub.blogspot.com/
https://vueducationhub.blogspot.com/
https://vueducationhub.blogspot.com/2020/08/cs402-quiz-solution.html
true
2817428684875374465
UTF-8
Loaded All Posts Not found any posts VIEW ALL Readmore Reply Cancel reply Delete By Home PAGES POSTS View All RECOMMENDED FOR YOU LABEL ARCHIVE SEARCH ALL POSTS Not found any post match with your request Back Home Sunday Monday Tuesday Wednesday Thursday Friday Saturday Sun Mon Tue Wed Thu Fri Sat January February March April May June July August September October November December Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec just now 1 minute ago $$1$$ minutes ago 1 hour ago $$1$$ hours ago Yesterday $$1$$ days ago $$1$$ weeks ago more than 5 weeks ago Followers Follow THIS PREMIUM CONTENT IS LOCKED STEP 1: Share to a social network STEP 2: Click the link on your social network Copy All Code Select All Code All codes were copied to your clipboard Can not copy the codes / texts, please press [CTRL]+[C] (or CMD+C with Mac) to copy Table of Content