)' ~.

Cc-attv\,'-\1~ ') log R~~ C R~) t""-\ o~

Nov. 1 Pro 117 ~.O~m) Q.Qfv\Vt!t-r);?SLt~~~(~
Con. 4829-06. YM-6709
(REVISED COURSE)

(3 Hours) [Total Marks: 100

N.S. (1) Question No.1 is compulsory.

(2) Attempt any four questions out of remaining six questions.

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 }

(b) Design DFA that accept the following language : . 10

(i) Set of all strings with odd number of.1's followed by even number of O's L = { 0; 1 }
,(ii) Set of all strings which begin and end with different letters L = { x, y, z }.

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. .

.4. (a) Construct PDA accepting- 10

L= { an bm an 1m, n ~ 1}
(b) Convert the following grammar to CNF 10
S ~ abAB .

A ~ bAB IE
B ~ Baa' A I E

5. (a) Prove the variations and equivalence of Turing Machine. 10

(b) Design TM to accept the language : 10
L = {xe { 0,1 }*'x contains equal number of O's and 1's } . Simulate the operation for the
string 110100.

6. (a) Convert the given grammers to Greibach Normal form. 10

S ~ ss la Sb lab. .

(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)

Q.No.2a) Convertthe given grammar to grebaic normal form . (10)

S~ aSB aA I

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.NoAa) Stateand provepumpinglemmafor regularlanguagesand provethat Lpr (10)

consisting of all strings of} 's whose length is prime is not regular.
b) Design finite state machine that compares two binary numbers to determine (10)
whether they are equal and which ofthe two are larger.

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)

Q.No.7 a) Write regular expressions for following languages. (05)

i) L = { a"bm : (n+m) is even}
ii) L = { w (a,b)* : (number of a's in w) mod 3 = 0 }

b) Construct context free grammar equivalent to following PDA . (05)

o(qo,b, Zo) = {(qo. ZZo)}
o(qo., Zo) = {( qo.E)}
o(qo.b, Z) = {(.qo.ZZ)}
o(qo.a, Z) = {( ql. Z)}
8(ql. b, Z) = {( qo.E)}
8(ql. a, Zo) = {( qo,Zo)}
c) Write short notes on any two. (10)
i) Myhill Nerode Theorm.
ii) Halting Problem.
iii) Grebaic Theorm.
 T,E-.. .AeNY\ 5 CRox)
~. -r~e>~~ ~~ ,~tA &-\ ~ . f'l-1-/1
'-}f)S6
Con-. 5867-08. RC-64.79~
(REVISED COURSE)
(3 Hours) [Total Marks: 100

N.H. : (1) Question No.1 is compulsory.

(2) Attempt any four questions from the remaining questions.

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.

3. (a) Prove that it is undecidable whether a context free grammar is ambiguous. 10

(b) Prove the variations and equivalence of the push down automata. 10

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

5. (a) Design a Turing machine to Compute n!. 10

(b) Explain GNF with suitable example. 10

6. (a) Write a program to translate a regular expression to finite automata. 10

"""' (b) Construct a NFA for the regular expression 01 * + 1 and convert it 10
to DFA.

7. Write a detail note on (any four) ;- 20

(a) Post correspondence problem
(b) Halting problem
(c) Uz:tiversal TM
(d) Myhill-Nerode's theorem
(e) Ambiguity resolution.
11 . 2nd half11-AM(f)

Con. 6617-11.

N.S.: (1) Question NO.1 is compulsory.

(2) Attempt any four questions from the remaining questions.

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 $ $

(c) Convert the following regular expression to NFA with E -transitions: 5

R = (1 (00)*1 + 0 1* 0)*
(d) Write a short note on Ambiguity Resolution. 5

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.

4. (a) Consider the grammar :-

S~OBI1A
A~OI OSI1AA

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

(c) Differentiate between DPDA and NPDA.

6. (a) Define PDA and construct PDA for the grammar :-

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

N. B. : (1) Question NO.1 is compulsory.

(2) Attempt any four questions from the remaining six questions.

1. Answer following questions in brief :- 20

(a) What is the principle difference between connectionless communication (Sx4)
and connection oriented communication?
(b) Consider the' delay of pure ALOHA versus slotted ALOHA at low load.
Which one is less? Explain four answer.
(c) Give one advantage of RPC on UDP over transactional TCP. Give one
advantage TCP over RPC.
(d) Compare and contrast a circuit switching and packet switching network.

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.

4. (a) Explain Dijkstra's algorithm as shortest path routing with example. 20

(b) Explain working of following network components and state in which layer
they work. Repealers, Hubs, Bridges, Routers and Switches and Gateways.

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.

7. Write short notes on (any four) of the following :- 20

(a) SONET
(b) ADHOC Networking
(c) Bluctooth Architecture
(d) Comparison of 8023 and 80211
(e) Berkeley Socket.
 r2-~ 1n 1 " -r: E;'- 5'efli ~.3: lfj m r ~
Ad\t~cJ r-D~ede., M~~~
. . MP-38475tj5:teYrj
(3 Hours)

N.S. : (1) Question No.1 is compulsory.

(2) Solve any four from Q. 2 to Q. 7.
(3) Figures to the right indicate full marks.

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

0.2. A) Explain various parallel database architectures. 10

B) Explain query processing in Distributed database system 10

Q.3. A) Explain EER-to-relational model mapping. 10

B) What is XML DTD. 10

QA. A) What is heuristic rule in query optimization? Explain transformation rules. 10

B) Explain nested loop join and block nested loop join algorithms in query
processing. 10

Q.5. A) Explain macro life cycle in database design methodology. 10

B) What is equijoin, natur~1join, outer join, self join? Explain with suitable example. 10

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.7 Write detailed notes on (any two) "

i) XML schema.
ii) Client server architecture.
Hi)Object relational features in SQU.
 1l? Of) p"N S e.rr'Y) - Y r{
.(Yl jC~f-oeC-esst>
(REVISED COURSE) MP-3842

N. B.: (1) Question No.1 is compulsory.

(2) Sol\(e any four questions from the remaining.
(3) Draw necessary diagram wherever necessary.
(4) Figures to the right indicate full marks.

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) Design 8086 based system with following specifications: (10)

a) Interface 32 KB SRAM. Use IC 6264.
b) Interface 16 KB DRAM. Use 8 KB Chips.
B) Explain the following Intel 8086 assembly language instructions giving example: (10)
a) SAL, b) TEST, c) DAA, d) JA, e) NOP.

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. 7) Explain the following in brief:

A) RS 232C interface
B) Fixed and Variable port addressing formats
C) Address decoding techniques
D) Difference between Software and Hardware interrupts.
 MP-3853
[ Total Marks: 100

(b) Attempt any four questions out of .remaining six' questions.

Q.1. (a) Explain the qualities of web applications. [10]

(b) Differentiate betweenHTML and DHTML. [5]

(~) Explain architecture of web document management system. [5]

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

(b) Explain DTD,XML Schema and XSLwith example. [10]

Q.5. (a) Explain information design of web application. [10]

(b) Explain server side technologies. [10]

Q.6. (a) What are streaming technologies? Explain streaming media architecture using

Point to point connection and broadcasting infrastructure. [10]

[10]

Q.7. Write short note on any ~ of following : [20]

'{a) Project Risk Management

(b ) Test schemes for web applications

(c) Layered architecture

( d) Evolution Of web applications.

 "TG t em ptJ 1JI C'r;<.e-\.L)
A [)8fY15

IJ : scan Oct.l2 342

Con. 7572-12.

N.B.: (1) Question No.1 is compulsory.

(2) Attempt any four questions out of the remaining six questions.

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

2. (a) Explain different architecture for parallel database. 10

(b) Explain different joins such as EQUIJOIN, NATURAL JOIN, LEFT AND RIGHT 10
OUTER JOIN with suitable example.

3. (a) Explain query processing in distributed database. 10

(b) Explain with example nested relation in ORDBMS. 10

4. (a) Explain heuristic query optimization with given example :- 10

Select e-Iname
from Employee e, Works-on w, Project p
where P.pname = 'Database' And
p. pnumber = w.pno And
e.essn = w.ssn And
e.bdate > '1977-12-31'
(b) In SQL 3 how type inheritance and table inheritance is implemented? ~xplain with 10
suitable example.

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.

6. (a) Explain Nested-loop join and Block Nested-loop join algorithm.

(b) Explain database design and implementation process.

7. Write short notes on (any four) ;-

(a) Replication in distributed DBMs
(b) Aggregate functions in SQL
(c) XML Schema elements
(d) EXIST and NOT EXIST clause in SQL
(e) Query processing in typical DBMs system.
 'it: Ie fY\ pNi ~j;[ C peJj I )
I , 2:r 11 IL
(YIICro-OPOOCesso(f"
Shilpa -(b) 34
Con.7f;02-12. I(.R-S093

N.S.: (1) Question NO.1 is compulsory.

(2) Attempt any four questions out of remaining six questions.

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

2. (a) Explain addressing modes of 8085 microprocessor with example.

(b) Explain assembler directives of 8086 ..... ,._

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.

6. (a) Design an 8086 based system with the following specifications.

(i) 8086 is in minimum mode
(ii) 64 kbyte EPROM using 52 KB devices
(iii) 64 kbyte RAM using 32KB devices.
Draw the complete. schematic of the design indicating address ma'p.
(b) Explain the operation of Ie 8259 with block diagram:
. .
7. Write short notes on any four of the following :-
(a) RS 232 serial interface standard
(b) Difference between memory mapped I/O and I/O mapped I/O
(c) IEEE 488 GPIB
(d) 8284 clock generator
(e) String instructions in 8086
(f) Addressing modes of 8086.
10 . 2nd hall. 12-shllpa(e)

Con. 9854-12. KR5231

N.S.: (1) Question NO.1 is compulsory.

(2) Attempt any four questions out of remaining six questions.
(3) Assume suitable data wherever required.

1. (a) Explain the following with example :-

(i) Repeater
(ii) Hubs
(iii) Bridges
(iv) Switches
(v) Router. .
(b) Explain the layers details of oSI and TCP/IP Models.
. .
2. (a) Explain the major componets of telephQne networks. 10:
(b) Explain the error detection and error correCtion algorithms. , '10

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.

4. (a) Differentiate between the following :- 10

(i) protocol and Interface
(ii) Connectionless and connection oriented service.
(b) Explain and compare the following :- 10

Ethernet, Token Bus and Token Ring.

5. (a) Explain CSMA/CD. 10

(b) list the features of bluetooth and explain the network formation process. 10

6. (a) Explain: FDMA, TDMA and COMA. 10

(b) What are different types of routing? Explain Distance vector routing.' 10

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

7. _Write short notes on (any f~ur) ;- 20

(a) Myhill Nerode Theorem
(b) Universal TM
(c) Rice Theorem
(d) Closure properly and decision algorithm for CFL
(e) Application areas ofRE, FA,.PDA, CFG, TM.
 (C' N1P &rri.y -~,k '"c
[ "tlh <'-ell'; cr
N.B. : (1) Question No.1 is compulsory.
(2) Attempt any four questions from remaining questions from Q. Nos. 2 to 7.
(3) Specify your answers with examples and diagrams wherever necessary.

1. Attempt the following questions :- 20

(a) List various client side and server side Technologies.
(b) What do you mean byweb browser, what facilities it provides' to the
user?
(c) List various' tags in HTML with simple example fOi a web page.
(d) What do you m~an by internal and external style sheet?

2. (a) What do you mean by components of generic ~eb appliction architecture? 10

Explain in detail.
(b) Explain 2 Tier and 3 Tier Architectur~ for web application.' 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

5. (a) What is XML, XSL, DTD? Explain with simple example.

(b) Explain in detail characteristics of web applications.

6. (a) Differentiate between

.
Get and Post method. for a web based application, 10
write a simple code to explain the same.
(b) Explain in brief Requirement Engineering activities. 10

7. (a) Explain role of tester in.testing web application.

(b) What do you mean by content management system.
 'lM1Z- Ca>fI\~'
~ c-S . l> v/:tJ r{' } tJ (; .
--1T~' .
[ REVISED COORSE ]
<nl/1869-<>6...r .: . TV-8307
,A .

.\
~
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)*

7.a) Prove the following: - (10)

, (i) L = {aP I p is prime}is notcontextnee.
(ii) L = { (ab) n ak : n>k, k~O} is not regular.
b) Consider the following grammar: - . (10)
S~ASB I e
A -taAS a I

B-tSb& A bb I I

Put the above grammar in Chomskynormal form.

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.

b)Provethat it is undecidablewhether a context free grarnmaris ambiguous.(IO)

5. a) Convertthe following gramrnarinto Grebaicnormal form. (10)
. S-t XY1 I 0
X~ OOX Y I
Y--IXI

I
b) Design turing machine to recognize the language L = {I n2n3n n2:I} (10)

6. a) Designthe PDA that will recognizethe language L = WWR: W is in (10)

{a,b}* i,e even length palindrome over I = {a,b}.
b) Give the moore and mealy machinefor the following (10)
For the input nom l:*, where L = {0,1,2},printthe residu modulo 5
of the input treated as ternary..
7.a) Write regular expressions for the following languages (06)
i)'L = {O,l}containing all possible combinations of D's and l's but
not having two consecutive O's.
ii) The set of all strings ofO's and l's such that every pair of adjacent O's
appears before any pair of adjacent 1'so
iii)The set of all strings over L = {O,l}without length two.
b) i) Verify the following identities involving regular expressions. . (06)

. (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

N.S.: (1) Question No. ~ is compulsory. .

(2) Answer any four out of the remaining six questions.

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.

5. (a) Design a TM to multiply 2 unary numbers. 12

(b) Use pumping lemma to show that the following is regular. 8
L = {x/ x = on 12m n > a }
m>O

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

7. Write short notes on any five out of the following: 20

(a) GNF
(b) Universal TM
(c) Recursive descent parser
(d) Post correspondence problem
(e) My hill-Nerode theorem
(f) Ambiguity resolution.
-----
 Con. 3405-08. [REVISED CUUH::iEJ "u-~~oo
(3 Hours) (Total. Mark$ : 100
N.S.: (1) Question No.1 is compulsory.. .
(2) Attempt any four questions out of remaining six questions.
(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) Prove that 10

. i) L={ (ab)nak I n>k, k>=O}is notregular.
ii) L={ anbncn I n>=1 } is not context free.
b) Convert the following -NFA to minimized DFA 10

Q.No.2 a) Convert the following grammar in chomsky normal form 10

S ~ AACD
A~aAbr .

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.3 a) Prove that every nontrivial property of the RE languages is undecidable. 10

b) Design the PDA for the language L={ wcw r w{a,b}.} .
10.

Q. No.4 a) Convert the following grammar in grebaic normal form 10

. s~AAlo
. A~ SS 11
.- b) Design tnoore machine to convert each occurrence of substring 1000 DY 10
. 1001. .

Q.No.5 a) Convert the following expression grammar to PDA. - 10

I ~ a b I la I Ib I 10I II
. E~ I I E*EI E+EI (E) . .

. b).Writeregularexpressionfor the followinglanguages. 05

J) L={ anbm I n>=4, m<=3} ii) L={ w: Iwlmod 3 = 0, w{a,bf}
c) Write note on 'Universal turing machine' 05

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 }

Q. No.7 a) Design FSM for binary adder. 10

b) Write short note on any two. 10
(i) Post Corr~spondence Problem.
(ii) Myhill-Nerode's Theorm.
(Hi)Halting problem.
\;) V.Ex~J.0'9.G~Scan.33
1-
rr~ f. CCD~) Se"f03C c?--) 'Iot/o!!!;
'-.~ \')'M'~ by.N"
Con. 3433-09.
~
~ eOi <=-j-i(c..' C O'(\\,?\l :tei Gc \e\\ce \fR.-SttS
(REVISED COURSE)
(fJJ 1
(3 Hours) [Total Marks: 100
N.B.: (1) Question No.1 is"'compulsory.
(2) -Solve any four questions out of remaining six questions.
. (3) All questionscarry equal marks.
(4) Assume suitable data if required.
(5) Figures to the right indicate full marks.

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

3. Solve the followings :-

(a) Given a CFG G, find G' in Chomsky normal form generating L(G) - E.- 10
S ~ASB IE A~AaS Ia B ~ SbSIAI bb
(b) Construct left linear and right linear grammar for the regular expression 6
(01 +. 10)* 11)* 00)*.
(c) Write short note on ambiguity resolution. 4
4. Solve the followings :-
(a) Design a PDA for CFL that checks the well formedness of parenthesis i.e. the 8
language L of all "balanced" string of two types of parenthesis say "( Y' & "[ ]".
Trace the sequence of moves made corresponding to input string ( ([ ]) []).
(b) Construct a PDA that will accept a CFL generated by the following :- 8
CFG G = (~ T, P, S) having the following set of productions--
S ~AB IABC
A ~ BA BC E a
I I I

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. .

6. Solve the followings :- 10

(a) Give the context .free grammar for the language N(M) where-
M = ( { qO,ql }, { 0, I }, { X, ZO }, 0, qO,ZO, cp),where 0 is given by
o(qO,0, ZO) = { (qO,XZO) }, o(ql, I, X) = { (qt, e) }
. o(qO,0, X) = { (qO,XX) }, o(ql, e, X) = { (ql, e) }
o(qO, I, X) = { (ql, e) }, o(ql, e, ZO) = { (ql, e) }
(b) Writedowh the minimizationalgorithmand using it find out the minimumstate finite 10
automaton equivalent to the transition table given below.
.

-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.

QL Attempt any four ;

a. Compare PCM and delta modulation
b. Compare between antipodal and Orthogonal signal.
c. Explain ergodic process.
d. Explain Inter Symbol Interference
e. What is the function of match filter in communication system

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

Q4 a) ,Generator polynomial for a ( 15,7) Cyclic code is g (x) = 1+ X4 + x6 + x7 +x8

4
I) Find the code vector ( in systematic form) for message polynomial D (x) = X2 + X3 + X
ii)Assume that first & last bits of the code vector for D (X) = x2 +x3 + x4 suffer from
transmission errors. Find the error syndrome of received code vector. 10
h) What is matched filter? Derive the expression for minimum probability of error of the
matched filter' 10
Q.No.5 a) What is Binary Symmetric channel (BSC)? Explain optimum receiver algorithm tor binary
symmetric channel. lO

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

a. Effect of noises on communication system.

b. Signature authentication using public key crypto system.
c. Image and data compression
d. Modified Deobinary Encorder
e. Equilizers.
 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,

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

(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

7. _Write short notes on (any f~ur) ;- 20

(a) Myhill Nerode Theorem
(b) Universal TM
(c) Rice Theorem
(d) Closure properly and decision algorithm for CFL
(e) Application areas ofRE, FA,.PDA, CFG, TM.
www.campuskeeda.com

www.campuskeeda.com
www.campuskeeda.com

www.campuskeeda.com