CS402 mid term current latest Paper 14 MAy 2011

[Vuhelper]

Read the given statement Yes/No justify your answer
why?...................... [3]

Is RE infinite?

An alphabet is concatenation of letters and is also called sigma?

All FA’s are also NFA or not

Any onther way to represent the final (+) and initial(-)
states?..................[2]

A regular language L has only ending with “01” are these belonged to?....[2]

Justify why

“1101” and “111011”

FA1+FA2=FA1UFA2……………………………�� �…………………………………………� ��……….[5]

Explain Moore Machine……………………………………� ��…………………………………..…[5]

2ND..........................

CS402- Theory of Automata (Session - 2)
Question No: 1 ( Marks: 1 ) - Please choose one
If an alphabet has n number of letter, then number of strings of length m will be
n+m
(n)(m)
mn
nm
Question No: 2 ( Marks: 1 ) - Please choose one
Languages generated by kleene star are always ______________.
Finite
Infinite
Sometimes finite & sometimes infinite
None of the these
Question No: 3 ( Marks: 1 ) - Please choose one
1*(1 + ) = 1* this statement is
True
False
Sometimes true & sometimes false
None of these
Question No: 4 ( Marks: 1 ) - Please choose one
a*b* = (ab)* this expression is __________



28 mcqs 95% from past papers

subjective questions are:
Uses of research process in organization. 3 marks
a company launches new product in the market but it does not generate revenue . xplain reasons of its failure. 3 marks
discuss three major types of target market? 5 marks
what is market information system? xplain its subsystems . 5 marks.