Professional Documents
Culture Documents
1. (a) Define formally a deterministic finite Automata DFAand non deterministic finite Automata (NFA). 8
Prove their equivalence. . .
(b) Give regular expression, NFAand minimised DFAfor the language over (0, 1) having all strings 12
such that the third symbol from the right end is zero. .
2. (a) Using pumping lemma, prove that the given language is not regular. 10
(i) L1 = { ww I WE { 0, 1 }*}
(ii) L2 = {Oi 1i Ii ~ 1 }
3. (a) Compare Mealy and Moore machine. Design a Mealy machine to convert each occurrence of 10
. substringabb by aba. L = { a, b }
(b) Find CFG for generating
10
(i) Strings containing alternate sequence of O's and 1's, L = { 0, 1 }
(ii) Strings over L = { a, b } with atleast two a's. .
A ~ bAB IE
B ~ Baa' A I E
(b) Construct right linear grammer and .Ieftlinear grammer for the language a (ba)* 10
7. Write short notes on : (any four) :- 20
(a) Closure properties of Regular Language.
(b) Halting Problem.
(c) Chomsky Hierarchy of Grammer.
(d) Myhill- Nerode's Theorem.
(e) Post's correspondence problem.
ti::) f\UerTl[JL clilY IUUI \.i,Ug,:HIVIl" "' "'. , ,, ~ _n- .,----------
(3) Assumptions made should be clearly stated.
(4) Figures to the right indicate full marks. .
(5) Assume suitable data wherever required but justify the same.
Q. No.1 a) Design the DFA which accepts set of strings such that every string containing 00 (08)
as a substring but no~qqO,asa substring.
b)(i)Prove that L = { 01}J2'3J I i >=} and =1} is not contextfree. (08)
(ii)Showthat 0(0+1)'+(0+1)'00 (0+1)= (1'0) '(O}')'. (04)
A -?Aa Sa I a I
b) Design the turing machine to find the value of log2nwhere n is any binary number(] 0)
and a perfect square. .
Q.No.3 a) Designthe push down automata to accept language containing all odd length (10)
palindromesover L = {O,]}. '
b) Prove that it is undecidable whether Context free grammar is ambiguous. (10)
Q.No.S -a) i) Determine th . -. lut'.. - for foilOWIn Instance 0 f Post correspondence problem.(05)
List A List B
i wi xi
I 0] 0
2 ] 10010 0
3 ] . ]] I]
4 ]1 01
ii) Write note on 'Post Machine'. (05)
b) i) Write note on 'Multitape Turing machine'. (05)
ii)Design mealy machine to find 2's complement of binary.number. (05)
Q.No.6 a)Coostruct DFA equivalent to NF A ({p,q,r,s}, {O,]},ON.p, {q,s}) where ONis given (] 0)
In following table.
*
r
*5 , . ...
b) i) Write note on 'Universal turing machine'. (05)
ii) Prove that if Land M are regular languages then L-M is also regular. (05)
1. (a) Design the DFA for the language, contains strings in which leftmost 10
symbol differ from rightmost symbol. L:.is given { 0, 1 }.
(b) What is Turing machine? Explain different techniques for Turing 10
machine construction.
2. (a) Compare and contrast Moore and Mealey machine. Design a Mealey 10
machine to convert each occurrence of substring abb by aba. L = { a, b }
(b) What is parsing? What are the two different parsing methods? 10
Explain their differences with examples.
4. (a) State and prove pumping Lemma for context free languages. 10
(b) Design a grammer for accepting an Even Palindrome over L = { a, b}. 10
Con. 6617-11.
1. (a) Design finite state machine which accepts exactly the two strings baa and ab. 5
(b) Convert the following NFA to a DFA 5
0 1
-~p {p, q} {p}
q {r, s} {t}
r {p, r} {t}
*s $ $
*t $ $
2. (a) Obtain DFA to accept the strings which contains exactly three a's over L = {a, b} 8
(b) Give Mealy and Moore machine to change each occurence of substring 120 to 10
121 over ~ = {O, 1,2}
(c) Give the statement of Pumping Lemma for regular languages. 2
3. (a) Minimize the following DFA, where qo is the start state and q3 and qs are final 10
states -
a b
-- qo q1 q3
q1 qo q3
q2 q1 q4
* q3 qs qs
q4 q3 q3
* qs qs qs
(b) Using Pumping Lemma, show that following grammars are not regular :- 10
(i) L = { an ban In Z I}
(i i) L = { d Ij I i z j}
12 2nd half11-AM(f)
Con. 6617-MP-3844-11.
B~111SI OBB
For the string 00110101 find the following :-
(i) Leftmost derivation
(ii) Rightmost derivation
(iii) Parse tree.
(b) Convert the following grammar into CNF :-
S ~ ASB IE
A ~ aAS Ia
B ~ SbS I A I bb
5. (a) Convert the following grammar in GNF :-
S~AA 10
A~SSI1
(b) Construct PDA for the following Language :-
L = { am 1 am I m, n ~ 1}
n
I-n
I
E ~ E + E E - E (E) I id I
(b) Design Turing machine for recognising the following Languages :-
(i) L = { an bn en I n ~ 1}
(ii) L = { x I na (x) = nb(x)}
7. Write short notes on any four of the following :-
(a) Chomsky hierarchy
(b) Post correspondence problem
(c) Universal turing machine
(d) Halting problem
(e) Closure properties of context free language.
lG- eM P N .::-Serm r-S
Q)rpJ p~ ~ ~~+-UJ'OoI?--
MP-3850
2. (a) Define fragmentation and explain why the IPV4 and IPVs protocols need 10
to fragment some packets. Is there any difference between the two
protocols in this matter?
(b) An 8 bit byte with binary values 10101111 is to be encoded using an even 10
parity Hamming code. What is the binary value after encoding?
3. (a) What is the function of TCP protocol? Discuss it's header format. 20
(b) Explain sliding window protocol using Go Back-M Techniques.
5. (a) What is IPV4 protocol? Explain the IPV4 Header format with diagram. 20
(b) What is purpose 'of Digital Subscriber Line (DSL)? Explain ADSL.
..
6. (a) What are transport service primitives? 20
(b) Explain framing, flow and error control in data Link layer.
Q.l. A) Construct an EER diagram tor the ail'1ine database. The airline database contains
information about passengers, flights,. departure, ~mpl.oyees and aircratl:s. For passengers
name, address,phone number and related flight information is recorded. Fol' employees
tiame, address, salary, an identification number, and flight information is recorded. Not all
employees can fly aircraft; just the pilots. For such employees their qualifications, Le. what
kind of planes they can fly is recorded. For planes the model number and make is recorded .
. The airline has many aircraftsof a certain type. For flights it is required to keep the following
information: the flight num~er, origin, destination, departure timeand arrival time. Note that
for the same source.,.destination, there can be many flights J.>.er
week. Relevant assumptions, if
required, can be made. 08
B) Convert above EER diagram into relational schema. 07
C) Explain the terms unstructured data inXML and fragmentation' in distributed
. database. 05
Q.6. A) Write SQL expressions considering the following relations with the given fields. 10
DEPT (Ono, Dname, Location, Numstaft)
EMP (Eno, Ename, Salary, Supno, Dno)
WORKS (Eno, Pno, Role)
PROJ (Pno, Pname, Ptype, Budget)
i) Get the number of employees having salary more than Rs. 50,000/ and working
on more than I project.
ii) List the employees working on more than 2 projects.
iii) List the projects on which more than 7 employees are working.
iv) Find the names and budgets of projects which have more than 7 employees.
working on them.
S) Explain external merge sorting in query processing. 10
Q.l)
A) Explain in brief the interrupts in Intel 8085 ~p. (5)
B) Draw the ciicuitQiagram for generation of RESET signal and explainitts working. (5)
C) Design an interface for 8255 with the following requirements: 1, 16-bitIIP and
1, 16-bitOIP port. Starting address is 2000a. (5)
D) Differentiate between the Memory mapped I/O and I/O mapped I/O. (5)
A) Explain the operation of IC 8254 as a square wave generator with the control
word and timing diagram for count value of4. (5)
B) IC 8255 is interfaced with Intel 8086 at an address2006H. Write a set of
statements in Assembly language to initialize it such that Port A will be in (5)
mode 2, Port B will be in Mode I Output.
C) Explain the.operation ofIC 8259 with the block diagram. Explain all the
signals in detail. (10)
A) Write an Assembly language program for Intel 8086 processor to perfonn the
division of2 digit BCD number which is in unpacked fOmi. (5)
B) Explain the fully nested mode of PIC 8259. (5)
C) Explain the modes of operation of a DMA Controller. (10)
A) Explain following addressing modes ofIntel 8086, Write an instruction for each
mode: . (5)
a) Direct addressing mode, b) Relative base indexed.
B) Draw the flowchart for initialization sequence of PIC 8259. (5)
C)What do you understand by bus arbitration? Explain the different bus arbitration
techniques with diagram. (10)
Q.6)
A) Explain the memory segmentation in Intel 8086 processor with it's advantages &
disadvantages. (5)
B) Explain the status signals ofIntel 8086 processor. Show all the possible
combinations along with the processor state and 8288 command associated with each
combination. (5)
C) Explain the operational command words of PIC 8259. (10-)
Q.2. (a) Explain Principles of Requirement engineering for web application. [10]
(b) Explain I~teraction design by considering all aspectS of web engineering. rIl
Q.3. (a) Explain JavaScript built in objects. [8]
i. r-
!
(b) Write HTML code which includes table, hyperlink, character formatting
Q.6. (a) What are streaming technologies? Explain streaming media architecture using
[10]
1. Consider a university database that keeps track of st:.Jdent and their majors, transcripts
and registration and the university courses. Several sections of each course are offered
and each section is related to the instructor who is teaching. It also keeps track of the
sponsored research project of faculty and graduate students of the academic depart-
ments of tho particular college. The database also keeps track of research grants and
contracts awarded to the university. A grant is related to one principle investigator and to
all researchers it supports.
(a) Draw an extended ER diagram for the above system. 7
(b) Show mapping of EER diagram into relational schema. 7
(c) Take two typical queries and write them in SQL. 6
5. (a) What is Data transparency? Explain the type of transparencies distributed data- 10
base should achieve.
(b) What is well formed and valid XML document? With example explain what is XML 10
Schema file.
1. (a) Explain the following Intel 8086 assembly language instructions giving example:- 10
(a) TEST
(b) DAA
(c) STOS
(d) SAR
(e) JC.
(b) Explain the interrupt structure of the 8085 microprocessor with a neat diagram. 10
3. (a) Exp.lain the different bus arbitration techniques with their adva-ntages ~nd 10
_ disadVantages. .
(b) Write an assembly language program for 8086 to transfer the block of 1 KB 10
'located at 0100 H to 02 OOH using string instructions.
. 4. (a) Explain the necessity of a bus controller in 8086 maximum mode operation. Also 10
explain the 8288 b~s controller in detail.
(b) What is segmented memory? State the advantages of segmented memory with 10
reference
. .
to the 8086 microprocessor. '
5. (a) Explain the concept of DMA. Show and explain an interfacing diagram of the 10
8086 with the 8237 DMA controller.
(b) Explain the operating modes of 8255 PPI. Also, explain the handshaking 10
operation for input and output in mode 1.
a. (a) What is CRG? Write the algorithm for computing checksum and explain with 10
suitable example.
(b) Explain the following with examples':- 10
MAC address, IP address, Socket, Baud rate, Latency.
7. (a) What are the congestion prevention policies? Explain the congestion control 10
in virtual circuit and datagram subnets.
- (b) Write note on' : S-ONET. 10
TE I CC'Yl/ P } JZ (PeO 8' , /2 , , 2_
Tees
KR-5348
(Total Marks: 100
N.D. : (l) Question No.1 is compulsory.
(2) Attempt any fou!" questions from remaining silo. questions.
(3) Draw suitable diagrams wherever necessary.
(4) Assume suitable data, if necessary.
1. (a) What is finite automation? Give the finite automation M accepting (a,b)*(baaa). 5
(b) Explain C~omsky H!erarchy with languages used, forms of productions in grammars 5
and accepting device.
(c) Differentiate Moore and Me~ly machine. 5
(d) Give and explain ambiguous context free language. 5
2. (a) Design finite state, machine to add 2 binary numbers of equal length. 10,
(b) Give the rules for defining languages assoCiated,with any regular expression: to
Let Ll '= all words beginning with, a -
L2 = all words ending with a
, what is L 1 intersection L2 ?
3. (a) Give the statement for pumping Lemma for regular languages. 2
(b) Construct an NFA-I\ for - 8
(i) (00 + 1) * (10)*
(ii) ((0 + 1)* 10 + (00)*(11 )*)*
(c) Let G be the grammar 10
S ~ aB I bA
A~al as I bAA
B~ bibS I aBB
Find the leftmost derivation, right most derivation and parse tree for the string
"bbaaabbaba".
4. (a,) What is TM ? Give the power of TM ~ver, FSM. Explain tindecidebility and 10
incompleteness in Turing machine.
(b) Explain PDA and power of PDM. Also design the NPDA for the given - , . 10
CFG
S~aAA
A~bS
A~aS
S~a
5. (a) Explain basic Complexity classes. 6
(b) Define NP-hard and NP-complete languages. 4
(c) Using pumping lemma, check whether an bl1 is regular or not. 10
6. (a) How regular expression is converted to DFA ? Explain aU rules with example. 10
(b) Construct a PDA accepting the language of Palindromes. 10
3. (a) Write short note on (i) content modelling (ii) access modeling. 10
(b) Write a code in any web deve'opment tool to represent ordered and unoredered 10
list, form, tables and images for a web page.
4. (a) You are appointed as Team Leader for a web based application for online 15
admission process of first year Engineering, find all the stake holder for
this and give a simple format of application form tl)at will be displayed
on screen (do not write any code).
(b) Explain all attributes for Tables in HTML. 5
.\
~
i
. ( 3 Hours) [ Total Marks: 100
N.B. : (1) '()Jest ion No.1 is coIIpllsory.
(2) A~tempt any four questions out of remaining six,questions.
(3) Assumptions made should be clearly stated.
(4) ,Ass':1IIle suitable data wherever required but justify the same.
(5) Fi<J1:1res to the right indicate full marks.
La) Design the finite state mpchine that compares two binarr numbers to (08)
determine whetherthey are equal and which of the two I~ Ic1..Yj fJ-"",
b)(i)State.and prove the pumping lemma for context nee languages. (08)
(ii)Convertthe following regular expressionto NFA with e transitiQns. (04)
R= (1(00)*1+01.*0)*
B-tSb& A bb I I
J. a) Give the DFA accepting the following language over alphabet {O,I } (08)
L = 'Set of all strings beginning with I that, when interpreted as a binary
integer, is a multiple of5: for example, strings 101,1010, and 1111 in the
language; 0, 100, and t II not.
b) (i) Design turing machille that can accept the set of all even palindromes (08)
over alphabet {0,1}
(ii) Show that that (04)
(1+00*1)+ (1+00*1)(0+10*1) * (OHO*l) = 0*1(0+ 10*1) *
4. a) Construct the PDA equivalent to the following context free grammar. (10)
S-+ OaB
B-t OS lIS I 0
..,
Test whether 0104 is in language.
I
b) Design turing machine to recognize the language L = {I n2n3n n2:I} (10)
. (R+S)+T = R+(S+T)
(RS)T = R(ST)
ii) Write short notes on any two (08)
(i) Grebaic Theorm.
(ii) P<?stcorrespondence problem.
(iii) Myhill-Nerode's Theorm.
..if:
, t ;r
{: /1:, (!)
WI May 07-2]7 '1" S. ~~~~Lb~LjD~Uf>lLee
CO,n.3132-07. (REVISED COURSE) ND-1216
(3 Hours) [Total Marks: 100
1. (a) Distinguish between NFA and DFA. Give two examples of each. 5
(b) Design a FSM for testing divisibility by three. 5
(c) Design a Moore M/c to change all vowels to '$'. 5
(d) Design a PDA to accept (ab)n (cd)n. 5
2. (a) What is p~rsing ? What are the two different parsing.methods ? Explain thier difference 10
with examples.
(b) Design a TM to generate 2n. 10
3. (a) Design a suitable PDA to accept an even palindrome over {a, b}. 10
(b) Design a NFA to accept (a/b)* aba. Convert it to a reduced DFA. 10
4. (a) Design a TM to accept (1n 1 bn). Can a DFA be designed for the same? Justify. 10
(b) Convert the followingto CNF : . 10
S ~ a S b / b S a / ab / ba / E.
6. (a) Define different types of grammers and give one example of each. 10
.. (b) State different types of machines and state atleast one application of each. 10
C~aCra
D~ aDa r bDb I .
.b) Design the turing machine to recognize the language L={ anbn cn I n>=1 } 10
Q. No.6 a) pesign TM which will recognize strings containing equal number of 'O's 10
and '1 's. .
b) Design the DFA for the language, contains strings in which leftmost 10
symbol differ from rightmost symbol. L is given {O,I }
1. Solvethefollowings
:- :'$1 .
(a) State the pumping lemma for regular language and prove that L = { 02nIn 2: 1 }is not 5
. regular.
'(b), Design a Mealy machine that accepts an input from (0 + 1)*, if the input ends 5
in '101, output A; if the input ends in 110, output B ; otherwise C.
(c) Let G = (V, T, P, S) be the CFG having following set of productions. Derive the 5
string "aabbaa" using leftmost derivation and rightmost derivation.
S ~ aAS Ia
A ~ SbAI SSI ba
(d) Write a short note on Universal Turing Machine. 5
2. Solvethe followings:-
-
(a) Constructan NFA with E movesfor the regularexpression10(0+ 01 + 0110)* 6
(b) Find the equivalent DFA accepting the regular language defined by the right linear 14
grammar gIven as-
S ~ aA IbB
A ~ aA IbG Ia
B~aBlb
C~bB
B ~ AC ICBIb I E
. C ~BC lAB Ic
(c) Give context free grammar generating the following sets. 4
(i) The string containing no consecutive 'b's but 'a's can be consecutive.
(ii) The set of all strings over alphabet {a, b} with exactly twice as many
a's as b's. .
rTTTD1\.T \'TUD
Con.. 3433-VR-5ll 5-09. 2
'-.
5. Solve the followings :- ,,..'
(a) Construct a Turing machines M to accept the language L = {wcwRIwe { 0, I } * 10
and wRmeans reverse ofw }. Trace the sequence of moves made corresponding
to input string OlelO
(b) Construct a turing machine M for performing proper subtraction m-n is defined 10
to be m-n for m > n and zero for m < n. The TM started with omI0" on its tape,
halts with om-" on its tape. Trace the sequence of moves for the input string
0000100. .
-A
*- I
~ 1 E
--+A F
B
7. Solve the followings :- .
. HCD. H I
E . B'B
F G
C
H
E
(a) Explain the undecidability of PCP ? Does PCP with following two list- 6
A = (10,011, 101) and B = (101,11,011) have a solution '? Justify your answer.
(b) Write short note on Recursive Decent Parser. 4 .
(c) Find a Greibach normal-form grammar equivalent to the following CFG. 6
A~Bb IBB B ~AB I a S ~BAI ab
(d) Give DFA accepting the following languages over the character (0, I) 4
(i) The set of all strings ending in 00.
(ii) The set of all strings with three consecutive zeros.
N. B.: (1) Questioh NO.1 is compulsory.
(2) Attempt in all five questions.
(3) Figures to the right indicate full marks.
(4) Draw neat circuit diagrams/blocks diagrams wherever necessary.
Q No.3. a) Define cumulative distribution function and probability distribution function. List their
Properties. 10
b) The required power at the receiving antenna is 1O6W. The gain of the
transmitting and receiving antennas are 20 dB each. The frequency of the carrier
is 5GHz and distance between two antennas is 10Km. Determine power to
transmitted by transmitter 10
th
b) A key is given by the sequence ofKl, K2, --------- K29, where Ki is the shift number ofi
character. Its value lies in the range of 1 to 25. All the possible keys are equally likely.
Calculate unicity distance if English language is used in encryption. 10
Q.No.6 a) A Delta modulation system is design to operate at 3 times the Nyquist rate for a Signal
with 3 KHZ bandwidth. The quantizing step size to 250 mv .
i) Determine the miximum amplitude of 1KHz input sinusoid for which delta modulator
does not show slope overload.
ii) Determine the post filtered output SNR for the signal of part (i) 10
Tees
KR-5348
(Total Marks: 100
N.D. : (l) Question No.1 is compulsory.
(2) Attempt any fou!" questions from remaining silo. questions.
(3) Draw suitable diagrams wherever necessary.
(4) Assume suitable data, if necessary.
1. (a) What is finite automation? Give the finite automation M accepting (a,b)*(baaa). 5
(b) Explain C~omsky H!erarchy with languages used, forms of productions in grammars 5
and accepting device.
(c) Differentiate Moore and Me~ly machine. 5
(d) Give and explain ambiguous context free language. 5
2. (a) Design finite state, machine to add 2 binary numbers of equal length. 10,
www.campuskeeda.com
www.campuskeeda.com
(b) Give the rules for defining languages assoCiated,with any regular expression: to
Let Ll '= all words beginning with, a -
L2 = all words ending with a
, what is L 1 intersection L2 ?
3. (a) Give the statement for pumping Lemma for regular languages. 2
(b) Construct an NFA-I\ for - 8
(i) (00 + 1) * (10)*
(ii) ((0 + 1)* 10 + (00)*(11 )*)*
(c) Let G be the grammar 10
S ~ aB I bA
A~al as I bAA
B~ bibS I aBB
Find the leftmost derivation, right most derivation and parse tree for the string
"bbaaabbaba".
4. (a,) What is TM ? Give the power of TM ~ver, FSM. Explain tindecidebility and 10
incompleteness in Turing machine.
(b) Explain PDA and power of PDM. Also design the NPDA for the given - , . 10
CFG
S~aAA
A~bS
A~aS
S~a
5. (a) Explain basic Complexity classes. 6
(b) Define NP-hard and NP-complete languages. 4
www.campuskeeda.com
www.campuskeeda.com
6. (a) How regular expression is converted to DFA ? Explain aU rules with example. 10
(b) Construct a PDA accepting the language of Palindromes. 10
www.campuskeeda.com
www.campuskeeda.com
www.campuskeeda.com