Final Model Paper
Final Model Paper
Final Model Paper
DEPARTMENT OF
INFORMATION TECHNOLOGY
II B.TECH II SEMESTER QUESTION BANK 2017-18
LIST OF SUBJECTS
CODE NAME OF THE SUBJECT
States 0 1
p q,s q
q r q,r
r s p
s - p
SECTION – II
SECTION – III
6. Construct right-linear and left-linear grammars for the following regular expression.
0* (1(0+1))*
(OR)
7. Construct the left-most and right-most derivations and parse trees for the following
grammar
S aB | bA
A aS | bAA | a
B bS | aBB | b which accepts the string “aaabbabbba”.
SECTION – IV
SECTION – V
*********
MALLA REDDY COLLEGE OF ENGINEERING &
TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
II B.Tech II Semester supplementary Examinations
Formal Language and Automata Theory
Model Paper -2
(Information Technology)
Roll No
Time: 3 hours Max. Marks: 75
Note: This question paper contains two parts A and B
Part A is compulsory which carriers 25 marks and Answer all questions.
Part B Consists of 5 SECTIONS (One SECTION for each UNIT). Answer FIVE
Questions, Choosing ONE Question from each SECTION and each Question carries
10 marks.
SECTION – II
4.Write regular expressions for each of the following languages over an alphabet {0, 1}
a) The set of all strings not containing “111”
b) The set of all strings in which every pair of adjacent 0’s appears before
any pair of adjacent 1’s
(OR)
5. Prove pumping lemma of regular sets?
SECTION – III
6. Explain left & right derivations and left & right derivation trees with examples
(OR)
7. What is meant by ambiguous grammar? Test whether the grammar is ambiguous or
not. S A | B
A aAb | ab B
abB | є
SECTION – IV
(OR)
SECTION – V
10. What are the various variations of TM? How to achieve complex tasks using TM.
(OR)
11. Design Turing Machine to increment the value of any binary number by one. The
output should also be a binary number with value one more the number given.
*******
R15
Code No: R15A0506
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
II B.Tech II Semester Regular Examinations, April/May 2017
Formal Language and Automata Theory
(CSE)
Roll No N 3
Q 0 1
p {q, s} Q
q R {q, r}
r S p
s - p
SECTION – II
4. Consider the following regular expression and construct the finite automaton
*
a) a + b b) (a + b)
*
c) a(a + b) d) a(a + b)*b
(OR)
*
5. Convert the R.E. = (a|b) into DFA
SECTION – III
6. Construct right-linear and left-linear grammars for the following regular expression.
0* (1(0+1))*
(OR)
7. Construct the left-most and right-most derivations and parse trees for the following
grammar
S aB | bA
A aS | bAA | a
B bS | aBB | b which accepts the string “aaabbabbba”.
SECTION – IV
SECTION – V
10. Design a Turing Machine that recognizes any palindrome of digits {0, 1}. Give its
state transition diagram and table.
(OR)
11. Find whether the post correspondence problem P = {(10, 101), (011, 11), (101, 011)}
has a match. Give the solution.
*********
Code No: R15A0506
MALLA REDDY COLLEGE OF ENGINEERING &
TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
II B.Tech II Semester supplementary Examinations, November/December 2017
Formal Language and Automata Theory
(CSE)
Roll No
Time: 3 hours Max. Marks: 75
Note: This question paper contains two parts A and B
Part A is compulsory which carriers 25 marks and Answer all questions.
Part B Consists of 5 SECTIONS (One SECTION for each UNIT). Answer FIVE
Questions, Choosing ONE Question from each SECTION and each Question carries
10 marks.
SECTION – II
4. Write regular expressions for each of the following languages over an alphabet {0, 1}
a) The set of all strings not containing “111”
b) The set of all strings in which every pair of adjacent 0’s appears before
any pair of adjacent 1’s
(OR)
5. Show that {anb2n|n>0} is not a regular set, using pumping lemma.
SECTION – III
6. Construct right-linear and left-linear grammars for the following regular expression.
(0 + 1)* 11(1 + 0)*
(OR)
7. What is meant by ambiguous grammar? Test whether the grammar is ambiguous or
not.
S A|B
A aAb | ab B
abB | є
SECTION – IV
(OR)
SECTION – V
10. Design a Turing Machine to accept the strings having equal number of 0’s and
1’s.
(OR)
11. Show that the PCP with two lists x = (b, bab3, ba) and y = (b3, ba, a) has a solution.
Give the solution sequence.
*******
R 13
Code No: XXXXX
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY,
HYDERABAD B.Tech II Year II Semester Examinations
FORMAL LANGUAGES AND AUTOMATA THEORY
Time: 3 hours Max Marks: 75
Note: This question paper contains two parts A and B.
Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B consists
of 5 Units. Answer any one full question from each unit. Each question carries 10 marks and
may have a, b, c as sub questions.
PART-A
1) a) Define the terms alphabet, string, prefix, suffix, language give examples to each. (2M)
b) Give DFA & NFA which accept the language { (10)n : n 0 } (2M)
c) Define a linear grammar (2M)
d) Define a ambiguous CFG (2M)
e) Construct a CFG for the set of all strings over the alphabet {a,b} with exactly twice
10 as many a’s and b’s. (2M)
f) Distinguish between DPDA and NPDA (3M)
g) Explain the operations of a NPDA with diagram? (3M)
h) Define unrestricted grammar.(3M)
i) What is the modified version of PCP (3M)
j) Differentiate between PDA and TM with respect to: halt state and final state (3M)
PART-B
2) Construct a Mealy machine which is equivalent to the Moore machine given in table. (10M)
(OR)
3) Construct the corresponding Mealy machine to the Moore machine described by the transition table given.
(10M)
6) Convert the following Push down Automata to Context Free Grammar (10M)
OR
7) Convert the following grammar to Greibach Normal Form G = ({A1, A2,
A3}, {a,b},P,S) Where P consists of the following
(10M)
8) Design Turing Machine to increment the value of any binary number by one. The output should also
be a binary number with value one more the number given. (10M)
(OR)
9) Explain counter machine (10M)
10) What are the various variations of TM? How to achieve complex tasks using TM (10M)
(OR)
11) a) Explain correspondence problem? (5M)
b) Explain P and NP problems?(5M)
R 13
Code No: XXXXX
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY,
HYDERABAD B.Tech II Year II Semester Examinations
FORMAL LANGUAGES AND AUTOMATA THEORY
Time: 3 hours Max Marks: 75
Note: This question paper contains two parts A and B.
Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B consists of 5
Units. Answer any one full question from each unit. Each question carries 10 marks and may
have a, b, c as sub questions.
PART-A
1) a) Give a description about FA with empty moves (2M)
b) Define regular grammar with example. (3M)
c) Give the set and explain in English the sets denoted by following regular expressions.(3M)
i) (11+0) (00+1)
ii) (1+01+001)(0+00)
iii) (0+1)00(0+1)
iv) 0 1 2
v) 00 11 22
d) Explain dependency graph & its applications in CFG.(2M)
e) Prove the substitution rule of context free grammar?(3M)
f) Give a CFG generating the following set that is the set of palindromes over
alphabet{a,b}(2M)
g) Let G be the grammar S->aS | aSbS | epsilon. prove that L(G)={x| each prefix of x has atleast
as many a’s and b’s} (3M)
h) Define Chomsky Normal form and Greibach Normal form? (3M)
i)Give the formal definition of TM? What are the different types of TMs?(2M)
j)What is left recursion? How to eliminate the left recursion?(2M)
PART-B
2) Design a Moore machine to determine the residue mod 5 for each binary string treated
as integer.(10M)
(OR)
3) Draw the transition table, transition diagram, transition function of DFA
a) Which accepts strings which have odd number of a’s and b’s over the alphabet {a,b}
b) Which accepts string which have even number of a’s and b’s over the alphabet {a,b}
c) Which accepts all strings ending in 00 over alphabet {0, 1}
d) Which accepts all strings having 3 consecutive zeros?
e) Which accepts all strings having 5 consecutive ones?
f) Which accepts all strings having even number of symbols?(10M)
4) Convert the following finite automata to regular expressions:(10M)
(OR)
5) Find a Regular expression corresponding to each of the following subsets over {0,1}*.
a) The set of all strings containing no three consecutive 0’s.
b) The set of all strings where the 10th symbol from right end is a 1.
c) The set of all strings over {0,1} having even number of 0’s & odd number of 1’s.
d) The set of all strings over {0,1} in which the number of occurrences of is divisible by 3
(10M)
S->aAD
A->aB-B>bAB
D->d (10M)
M)
7) Prove that the following language is not context-free
language L={www|w€{a,b}*} is not context free.(10M)
8) a) Describe the TM that accepts the language
L = {w a{a,b,c}_ | w contains equal number of a’s, b’s, an
c’s}. (5M)
b) Explain in detail Church’s hypothesis.(5M)
(OR)
9) a) Design a Turing Machine that accepts the set of all even palindromes
over {0,1}.(5M)
b) Given _ = {0,1}, design a Turing machine that accepts the language
denoted by the regular expressions 00*(5M)
10) a) What is decidability? Explain any two undecidable problems.(5M)
b) Show that the following post correspondence problem has a solution and give the
solution(5M).
List
I List A B
1 11 11
2 100 001
3 111 11
(OR)
11) a) Find whether the post correspondence problem P={(10,101),(011,11),(101,011)} has
a match. Give the solution.
b) Explain Turing reducibility machines.
c) Show that if L and L? Are recursively enumerable, and then L is recursive.
(10M)
R 13
Code No: XXXXX
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY,
HYDERABAD B.Tech II Year II Semester Examinations
FORMAL LANGUAGES AND AUTOMATA THEORY
Time: 3 hours Max Marks: 75
Note: This question paper contains two parts A and B.
Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B
consists of 5 Units. Answer any one full question from each unit. Each question carries 10
marks and may have a, b, c as sub questions.
PART-A
1) a) Find the DFA that recognizes the set of all string on Σ={a,b} starting with the prefix “ab” (2M)
b) Construct a DFA & NFA to accept all string in {a,b} such that every “a” has one “b”
immediately 8 to its right ?(2M)
c) Find all strings in L ((a+b)*b(a+ab)*) of length less than four(3M)
d) Prove the following identities for regular expression r,s and t here r=s means 6
L(r)=L(s) r+s=s+r, (rs)t=r(st),(r+s)t=rt+st(3M)
e) Find the NFA that accepts the language L{ab*aa+bba*ab)(2M)
f) What are CFG’s Give CFG for the language L= {an b2n | n>0}(2M)
g) Define context free grammars formally. Give some examples .(3M)
h) Why FAs are less powerful than the PDA’s (2M)
I)What is Unit Production? If you eliminate the unit productions from the given
CFG, what will be the effect on the language by the resultant grammar (3M)
J) Give a CFG generating the following set that is the set of palindromes
over alphabet{a,b}(2M)
PART-B
2) a) Construct DFA and NFA accepting the set of all strings not containing 101 as a substring.
b) Draw the transition diagram of a FA which accepts all strings of 1's and 0's in which both the
number of 0's and 1's are even.
c) Define NFA with an example.(5M)
(OR)
3) a) Draw the transition diagram of a FA which accepts all strings of 1's and 0's in which both the
number of 0's and 1's are even.
b) Construct NFA which accepts the set of all strings over f0; 1g in which there are at
least two occurrences of 1 between any two occurrences of 0. Construct DFA for the
same set.(5M)
4) Represent the following sets by regular expressions(5M)
(OR)
5) Discuss about (5M)
a) Context Free Grammar
b) Left most derivation
c) Right most derivation
d) Derivation tree.
6) Which of the following are CFL's? Explain (5M)
(OR)
7) a) Eliminate epsilon productions from the grammar `G' given as (5M)
PART –B (Marks:5*10=50)
6. Write in detail about the job sequencing with deadlines problem with example.
OR
7. Enumerate about algorithms for minimum cost spanning tree and describe any one algorithm.
8. Describe subset-sum problem and describe the possible solution strategies using backtracking.
OR
9. Express the solution for Travelling salesman problem using branch and bound .
OR
8. Describe graph coloring problem and write an algorithm for m-coloring problem
OR
9. Explain the principle of FIFO branch and bound
OR
11 What is chromatic number decision problem and clique decision problem
R15A0509
DATA BASE MANAGEMENT SYSTEMS
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF INFORMATION TECHNOLOGY
Data Base Management System
Model Paper – 1 (R15)
II B.TECH II-SEM Semester
Duration: 3hrs Max Marks: 75
Part B - Answer all the questions choosing one from each section. Marks: 10x5=50
3. What is the significance and characteristics of SRS? Write the template for it.
OR
How is Requirements Management done? Explain with relevant tables.
4. What are the various design model elements? Write about them.
OR
Explain the process of User Interface Analysis and Design.
6. a. Explain about the ISO 9000 quality standards. Who is the certifying authority?
b. How is a formal technical review performed?
OR
What are the various SQA activities? Write about the SQA plan.
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF INFORMATION TECHNOLOGY
Software Engineering
Model Paper – 2 (R15)
II IT - II Semester
Duration: 3hrs Max Marks: 75
Part B - Answer all the questions choosing one from each section. Marks: 10x5=50
2. How do evolutionary process models differ from other models? Explain the Spiral model.
OR
Why is S/E treated as a layered technology? Explain the software process framework.
6.Explain the different types of markets and also discuss about the features of perfect market
OR
7.What is joint stock company and its advantages and disadvantages?
OR
11.Discuss about different types of ratios?
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF INFORMATION TECHNOLOGY
MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS
Model Paper – 2 (R15)
II B.TECH IT II Semester Duration: 3hrs
Max Marks: 75
OR
5. i) Break-even point in terms of sales value and in units.
(ii) Number of units that must be sold to earn a profit of Rs. 90,000.
11.From the following information, calculate: (i) Gross Profit Ratio; (ii) Net Profit Ratio (iii) Inventory
Turnover Ratio; (iv) Net worth to Debt Ratio.
Particulars amount
Sales 25,20,000
Cost of Goods Sold 19,20,000
Net Profit 3,60,000
Stock 8,00,000
Current Assets 7,60,000
Fixed Assets 14,40,000
Net worth 15,00,000
Debt 19,00,000
Current Liabilities 6,00,000