New Microsoft Word Document
New Microsoft Word Document
UNIT-I Mathematical Logic : Statements and notations, Connectives, Well formed formulas, Truth
Tables, tautology, equivalence implication, Normal forms, Quantifiers, universal quantifiers.
Predicates : Predicative logic, Free & Bound variables, Rules of inference, Consistency, proof of
contradiction, Automatic Theorem Proving.
UNIT-II Relations: Properties of Binary Relations, equivalence, transitive closure, compatibility and
partial ordering relations, Lattices, Hasse diagram. Functions: Inverse Function Compositionof
functions, recursive Functions, Lattice and its Properties, Algebraic structures : Algebraic systems
Examples and general properties, Semigroups and monads, groups sub groups’ homomorphism,
Isomorphism.
UNIT-V Graph Theory : Representation of Graph, DFS, BFS, Spanning Trees, planar Graphs. Graph
Theory and Applications, Basic Concepts Isomorphism and Sub graphs, Multi graphs and Euler
circuits, Hamiltonian graphs, Chromatic Numbers.
UNIT – 1
1. 1(a) Obtain POS of the following formulas (i) (P ΛQ ΛR) V (~P ΛRΛQ) V(~P Λ~Q Λ~R) (ii)
PV(~P→(QV(~Q→R))) [7M] (b) Show that ~p follows from the set of premises
(r→~q),rVs,s→~q, p→q using indirect method of proof
2. a) Use truth table to show that (˥P∧ (˥Q∧R)∨(Q∧R) ∨ (P∧R ) ⇔R (b) Obtain the Principal
Conjunctive Normal Form of the formula S given by (˥P→R) ∧ (Q⇄P) (c) Show that (x)(P(x) →
Q(x)) ∧ (x)(Q(x) →R(x)) ⇒ (x)(P(x) →R(x)) [5M] [5M] [4M
3. (a) Construct truth table for (P∨Q)∧((˥P)∨(˥R)) (b) Check whether the truth values of the
following formula is independent of their components ((P→Q) ∧ (Q∧ R)) → (P→R) (c) Prove
that ∃x(P(x)∧S(x), ∀x(P(x)→R(x) ⇒∃x(R(x)∧S(x))
4. (a) Explain different logical connectives in mathematical logic [4M] (b) Show that the
following implication without constructing truth table (i) (p→q) →q ⇒(pVq) (ii) p→q ⇒ p →
p Λq [10M] S
5. Using automatic theorem (PVQ)Λ(Q→R) Λ(P→M) ⇒(RVM)
6. 2(a) Define bound and free variable with one example [7M] (b) Define predicate with one
example
7. (a) Show that ‘t’ is a valid conclusion from the following premises p→q, q→r, r→s, ~s and
pΛt [10M] (b) Prove that (x)(P(x) ^ Q(x))=>(x)(P(x) ^ (x)(Q(x)
8. (a) Define Quantifiers and types of Quantifiers with examples. [7M] (b) Define Maxterms &
Minterms of P & Q & give their truth tables
9. 1(a) Show that S is a valid conclusion from the premises p -> q, p -> r,~(q ^ r)and(S v p) [7M]
(b) Show that (Э x) M(x) follows logically from the premises (∀ x)(H(x) -> M(x)) and
(Эx)H(x)
10. ).Obtain POS of the following formulas (i)(P ΛQ ΛR) V (~P ΛRΛQ) V(~P Λ~Q Λ~R) (ii)
PV(~P→(QV(~Q→R))) S
11. ) Show that ~p follows from the set of premises (r→~q),rVs,s→~q, p→q using indirect
method ofproof
12. (a) Use indirect method of proof to prove that (∀x)(P(x) vQ(x))=>( ∀x)P(x) v (Эx)Q(x)
[7M] (b) Show that R ^ (P vQ) is a valid conclusion from the premises P v Q,Q -> R,P-> M and
~M
13. ) Show that ~p follows from the set of premises (r→~q),rVs,s→~q, p→q using indirect
method ofproof
14. a). Define PDNF and find PDNF for (~P R) (Q P). (7M) b). Explain any five rules of
inference with examples . (7M)
15. a). Show that ~p follows from the set of premises (r→~q),rVs,s→~q, p→q using indirect
method of proof(7M)
16. . b). State and explain the rules that that can generate a well formed formula (7M
17. 2).Obtain POS of the following formulas (i)(P ΛQ ΛR) V (~P ΛRΛQ) V(~P Λ~Q Λ~R) (ii)
PV(~P→(QV(~Q→R)))
18. ) Using automatic theorem (PVQ)Λ(Q→R) Λ(P→M) ⇒(RVM)(14M)
19. Show that the following implication without constructing truth table (14M) (i)(p→q) →q
⇒(pVq) (ii) p→q ⇒ p → p Λq
20. (a)Use truth table to show that (˥P∧ (˥Q∧R)∨(Q∧R) ∨ (P∧R ) ⇔R (b) Obtain the Principal
Conjunctive Normal Form of the formula S given by (˥P→R) ∧ (Q⇄P) (c) Show that (x)(P(x) →
Q(x)) ∧ (x)(Q(x) →R(x)) ⇒ (x)(P(x) →R(x))
21. (a) Construct truth table for (P∨Q)∧((˥P)∨(˥R)) (b) Check whether the truth values of the
following formula is independent of their components ((P→Q) ∧ (Q∧ R)) → (P→R) (c) Prove
that ∃x(P(x)∧S(x), ∀x(P(x)→R(x) ⇒∃x(R(x)∧S(x))
22. 2). Show that the following implication without constructing truth table (14M) (i)(p→q) →q
⇒(pVq) (ii) p→q ⇒ p → p Λq
UNIT – 2
1. 3(a) Draw the Hasse diagram for X={2,3,6,24,36,48- and relation ≤ be such that x≤y, if x
divides y [7M] (b) Let X= ,1,2,3,4- Define a function f:X→X. such that f≠Ix and is One –
On.Find f 2 ,f3 ,f-1 ,fOf
2. (a) If A={α,β}, B={1,2,3}. Find out (AxB) U (BxA) and (AxB) ∩ (BxA) (b) If A={1,2,3,4} and
P={{1,2},{3},{4}} is a partition of A. Find the equivalence relation determined by P. (c) Let
A=(6,12,18,24,36,72), a ≤ b if and only if a divides b. Draw Hasse diagram for it and prove
that it is a lattice, but not a distributive lattice
3. (a)For any two sets A and B Prove the following Identity A-(A∩B) =A-B (b) Prove that if R is a
symmetric relation, then R ∩ R-1 = R (c) Prove that intersection of two subgroups of a group
(G,*) is a subgroup of a group (G,*)
4. (a) Explain Multinomial Theorem? Find the coefficient of X 2Y 2 Z 2 in (2X3Y+5Z)10 [7M] (b)
What is the coefficient of x3 y 7 in (a) (x+10)10 (b) (2x-9y)10
5. (a) Verify and Explain the following relation R on X={1,2,3,4} is equivalence relation or not
R={(1,1),(1,4)(4,1),(2,2),(3,4),(3,3),(3,2),(4,3),(4,4)} [7M] (b) Define Lattices and sub lattices.
Give an example for each.
6. 4(a) Let A= { 1,2,3,4,5,6,7 } .determine a relation R on A by aRb 3 divides ( a – b ) , show
that R is an equivalence relation ? [7M] (b) Define Bijective function with an 2 examples
7. 3(a) Let A be a given finite set and P(A) its power set . let be the inclusion relation on the
elements of P(A) .Draw the Hass diagram of ( P(A) , ) for i) A = { a } ii) ) A ={ a ,b} [7M] (b)
Define an equivalence relation ? If R be a relation in the set of integers Z defined by R = { (x ,
y ) : xє Z , y є Z , (x - y) is divisible by 6 } .then prove that R is an equivalence relation
8. 4(a) Discuss about types of functions with an example for each. [7M] (b) For f(x) = 2x + 3 and
g(x) = -x 2 + 1, find the composite function defined by (f o g)(x), fog(3), gof(x), gof(3).
9. (a) Define an equivalence relation? If R be a relation in the set of integers Z defined by R =
{(x, y): xє Z , y є Z , (x - y) is divisible by 6 } .then prove that R is an equivalence relation ? [7M]
(b) Let f: A->B,g:B->C, h: C->D then prove that ho(gof) = (ℎog)of
10. (a) Define Bijective function, inverse function with an 2 examples [7M] (b) Let A=
{1,2,3,4,5,6,7 } .determine a relation R on A by aRb 3 divides ( a – b ) , show that R is an
equivalence relation ?
11. (a) For any two sets A and B Prove the following Identity A-(A∩B) = A-B (b) Prove that if R is a
symmetric relation, then R ∩ R-1 = R (c) Prove that intersection of two subgroups of a group
(G,*) is a subgroup of a group (G,*)
12. (a) If A={α,β}, B={1,2,3}. Find out (AxB) U (BxA) and (AxB) ∩ (BxA) (b) If A={1,2,3,4} and
P={{1,2},{3},{4}} is a partition of A. Find the equivalence relation determined by P. (c) Let
A=(6,12,18,24,36,72), a ≤ b if and only if a divides b. Draw Hasse diagram for it and prove
that it is a lattice, but not a distributive lattice.
13. a) Define a semi group and Monoid. Give an example of a Monoid which is not group. Justify
your answer ( 7M) b) Let A= {2,4,6,8,10,12}, show that the relation ‘divides’ is a partial
ordering on A and draw Hasse diagram (7M)
14. 3) Define the following terms (i) Group (ii) Abelion Group (iii) Semi Group (iv) Sub Group
15. Find all the properties that satisfies for the following algebraic systems under the binary
operations ‘X’ and ‘+’. (a) Odd integer (b) All positive integers
16. Find all the properties that satisfies for the following algebraic systems under the binary
operations ‘X’ and ‘+’. (a) Odd integer (b) All positive integers)(14M)
17. a). Let G= {-1, 0, 1}, verify whether G forms a group under usual addition.( 7M) b). Define the
following terms (i) Group (ii)Abelion Group (iii) Ring (7M)
18. . Draw the Hasse diagram for X={2,3,6,24,36,48} and relation ≤ be such that x≤y, if x divides
y. (14M)
UNIT – 3
1. (a) Find all the properties that satisfies for the following algebraic systems under the binary
operations ‘X’ and ‘+’. (a) Odd integer (b) All positive integers
2. (b) Find the generating functions for ar= the number of non negative integral solutions of
e1+e2+e3=r where 0≤e1≤ 3, 2≤e2≤ 6, e3 is odd and 1≤e3≤ 9
3. (a) A group of 8 scientists is composed of 5-psychologists and 3-sociologists, In how many
ways can a committee of 5 be formed that has 3- psychologists and 2-sociologists. (b) How
many ways can we distribute 14 indistinguishable balls in 4 numbered boxes so that each
box is non empty (c) Define multinomial theorem. Find number of integers
4. (a) Find the number of arrangements of the letters of MISSISSIPPI (b) How many integral
solutions are there of x1 + x2 + x3 + x4 + x5 = 30 where for each i, xi ≥ 1 [4M] [5M] Page 1 of
2 (c) Find the coefficient of x3 y 7 in (2x – 9y)10
5. 6(a) Illustrate pigeon hole principle and its applications [7M] (b) How many different
arrangements of the word MISSIPPI, MATHEMATICS
6. (a) In how many ways can 23 different books be given to 5 students so that 2 of the students
will have 4 books each and other 3 will have 5 books each. [7M] (b) Using multinomial
theorem, expand (2X-3Y+4Z)3
7. 6(a) Define the following terms (i) Group (ii) Abelion Group (iii) Semi Group (iv) Sub Group
[7M] (b) Determine the number of integer between 1 and 10,000,000 have the sum of digits
equal to 18
8. (a) Find the coefficient of X10 in (X3 + X4 + …. ) 2 [4M] (b) Solve the following recurrence
relation using characteristic roots [4M] an +6an-1 + 8an-2 = 0 and a0 = 2, a1 = -7 (c) Solve the
recurrence relation a n – 9a n-1 + 20an-2 = 0 with a0 = -3,a1 = -10 [6M] using generating
functions
9. (a) Find the number of arrangements of the letters of MISSISSIPPI (b) How many integral
solutions are there of x1 + x2 + x3 + x4 + x5 = 30 where for each i, xi ≥ 1 [4M] [5M] Page 1 of
2 R18 (c) Find the coefficient of x3 y 7 in(2x– 9y)10
10. (a) A group of 8 scientists is composed of5-psychologists and 3-sociologists, In how many
ways can a committee of 5 be formed that has 3- psychologists and 2-sociologists. (b) How
many ways can we distribute 14 indistinguishable balls in 4 numbered boxes so that each
box is non empty (c) Define multinomial theorem. Find number of integers
11. 5(a) Show that every homomorphic image of an abelian group is abelian. [7M] (b) Prove that
the set Z of all integers with the binary operation *, defined as a *b = a + b+ 1, a,b€Z is
an abelian group
12. 6(a) Define product rule? State Binomial theorem? Define permutation? Find the coefficient
of (i) x3 y 2 z 2 in (2x – y+z)9 . (ii) x6 y 3 in (x - 3y)9 . [7M] (b) Out of 80 students in a class, 60
play foot ball, 53 play hockey, and 35 both the games . How many students (i) do not play of
these games. (ii) play only hockey but not foot ball
13. 5(a) A survey among 100 students shows that of the three ice cream flavors Vanilla,
chocolate, straw berry . 50 students like vanilla, 43 like chocolate, 28 like straw berry, 13 like
vanilla and chocolate, 11 like chocolate and straw berry, 12 like Straw berry and vanilla and 5
like all of them. Find the following. 1. Chocolate but not straw berry 2. Chocolate and straw
berry but not vanilla 3. Vanilla or Chocolate but not strawberry [7M] (b) Show that the
set={1,2,3,4,5} is not a group under addition & multiplication modulo 6
14. (a) Show that if 8 people are in a room, at least two of them have birthdays that occur on
the same day of the week. [7M] (b) Applying pigeon hole principle show that of any 14
integers are selected from the set S = {1,2,3,……..,25 } there are at least two whose seem is
26. Also write a statement that generalizes this result.
15. ) a) Find the number of non negative integral solutions to X1+X2+X3+X4+X5=10 b) Find the
number of arrangements of letters “MISSISSIPPI”.
16. a) In how many ways can 23 different books be given to 5 students so that 2 of the students
will have books each and other 3 will have 5 books each. b) Using multinomial theorem,
expand (2X-3Y+4Z)3
17. )What is the coefficient of x3y 7 in (a) (x+10)10 (b) (2x-9y)10)(14M)
18. a)Illustrate pigeon hole principle and its applications(7M) b) a). How many ways can the
letters of the word ALGORITHM be arranged in a row if A and L must remain together as a
unit?( 7M)
19. a). Use multinomial theorem to expand (x1+x2+x3+x4)4. (7M) b). a) Find the number of non
negative integral solutions to X1+X2+X3+X4+X5=10.
20. a). How many ways can the letters of the word MISSISSIPPI be arranged ( 7M) b). a) In how
many ways can 23 different books be given to 5 students so that 2 of the students will have
4 books each and other 3 will have 5 books each.(7M)
UNIT – 4
1. Solve the recurrence relation using generating function an-6an-1=0 for n≥1 where a0=1
2. Solve the recurrence relation of Fibonacci series
3. Solve the recurrence relation an-7an-1+12an-2 =0 for n≥2 where a0=1, a1=2
4. find the generating function of n2 +n
5. (a) Solve the following recurrence relation using generatingfunctions an -7an-1+10an-2=0, n
≥ 2 , a0 =10, a1 = 41
6. (a) Solve an - 4 an-1 + 4an-2 = ( n+ 1 )2 given a0 = 0 , a1 = 1. [7M] (b) Solve an - 5 an-1 + 6 an-
2 = 2n,n > 2 with condition the initial a0 = 1 , a1 = 1. Using generating function .
7. (a) Solve the recurrence relations a) dn=2dn-1-dn-2 with initial conditions d1=1.5 and d2 =3.
[5M] b)bn=3bn-1-bn-2 with initial conditions b1=-2 and b2 =4
8. 7(a) Solve the following y n+2 - yn+1 – 2 yn = n2 . [7M] R18 Page 8 of 8 (b) Solve an - 4 an-1 +
4an-2 = ( n+ 1 )2 given a0 = 0 , a1 = 1.
9. 8(a) Find the sequence generated by the following generating functions (i) (2x – 3)3 (ii)x4 /1-
x [7M] (b) Using generating function solve an = 3 an-1 +2 , a0= 1 .
10. (a) Find the coefficient of X10 in (X3 + X4 + …. )2 [4M] (b) Solve the following recurrence
relation using characteristic roots [4M] an +6an-1 + 8an-2 = 0 and a0 = 2, a1 = -7 (c) Solve the
recurrence relation a n – 9a n-1 + 20an-2 = 0 with a0 = -3, a1 = -10 [6M] using generating
functions
11. (a) Solve the following recurrence relation using generating functions an -7an-1+10an-2=0, n
≥ 2 , a0 =10, a1 = 41
12. Solve the recurrence relation an-7an-1+12an-2 =0 for n≥2 where a0=1, a1=2
13. Find the general expression for a solution to the recurrence relation an-5an-1+6an-2 =n(n-1)
forn≥2
14. Solve the recurrence relation using generating function an-6an-1=0 for n≥1 wherea0=1(14M)
15. Solve the recurrence relation of Fibonacci series(14)
16. Find the general expression for a solution to the recurrence relation an-5an-1+6an-2 =n(n-1)
for n≥2
17. a). Solve the recurrence relation an-7an-1+12an-2 =0 for n≥2 where a0=1, a1=2.(7M) b).
Explain Fibonacci relation with suitable examples and also solve it. (7M)
UNIT – 5
1. 9(a) Define Cycle? [7M] (b) Apply DFS algorithm to form the spanning tree by taking own
graph.
2. 9)(a) Define Cycle?(3M) (b) Apply DFS algorithm to form the spanning tree by taking own
graph.(11M)
3. Explain the following (a) Isomorphism and sub graphs (b) Hamilton Paths (c) Planar Graph (d)
Dual of a planar graph
4. ) Explain the following (14M) (a) Isomorphism and sub graphs (b) Hamilton Paths (c) Planar
Graph (d) Dual of a planar graph
5. (a) Draw the graphs K5, C5, W5, and P5 (b) State and prove Grinberg theorem for a simple
graph with n vertices. (c) Draw binary search tree for the list : 2,1,5,6,8,9,7,3,4
6. (a) Explain Breadth First Search Algorithm with an example (b) Find the chromatic number of
the following i) Cn ii) Kn iii) Km,n (c) State and prove Euler’s formula for a plane connected
graph
7. (a) State and prove Eulers formula [7M] (b) Prove K4 is planar.
8.
9.
10. (a) Suppose a graph has vertices of degree 0, 2, 2, 3 and 9 . How many edges does the graph
have? [7M] (b) Explain In degree and out degree of graph. Also explain about the adjacency
matrix representation of graphs. Illustrate with an example?
11. 9(a) Define the following graph with one suitable examples for each graphs (i) complement
graph (ii) sub graph (iii) induced sub graph (iv) spanning sub graph [7M] (b) Explain about
complete graph and planar graph with an example
12. (a) Show that in any graph the number of odd degree vertices is even . [7M] (b) Define Euler
circuit, Hamilton cycle, Wheel graph, Chromatic number. Find the chromatic number for
K3,3
13. Find the Chromatic number of the following graphs (a) Complete Graph (K3) (b) Complete
Bipartite Graph (K2,3) (c ) Regular Graphs (K3)
14. a). Write Kruskal’s Algorithm and explain it with an example. (7M) b). Prove that complete
graph of 5 vertices is non planar. (7M )
15. 10). Explain and illustrate BFS and DFS with examples?
16. (a) Draw the graphs K5, C5, W5, and P5 (b) State and prove Grinberg theorem for a simple
graph with n vertices. (c) Draw binary search tree for the list : 2,1,5,6,8,9,7,3,4
17. (a) Explain Breadth First Search Algorithm with an example (b) Find the chromatic number of
the following i) Cn ii) Kn iii) Km,n (c) State and prove Euler’s formula for a plane connected
graph
ACD
UNIT - I: Formal Language and Regular Expressions: Languages, Definition Languages regular
expressions, Finite Automata – DFA, NFA. Conversion of regular expression to NFA, NFA to DFA.
Context Free grammars and parsing, derivation, parse trees, Application of Finite Automata.
UNIT - II: Introduction To Compiler, Phases of Compilation, ambiguity LL(K) grammars and LL(1)
parsing Bottom up parsing handle pruning LR Grammar Parsing, LALR parsing, parsing ambiguous
grammars, YACC programming specification. Semantics: Syntax directed translation, S-attributed and
L-attributed grammars, Intermediate code – abstract syntax tree, translation of simple statements
and control flow statements.
UNIT - III: Context Sensitive features – Chomsky hierarchy of languages and recognizers, type
checking, type conversions, equivalence of type expressions, overloading of functions and
operations.
UNIT - IV: Run time storage: Storage organization, storage allocation strategies scope access to non
local names, parameters, language facilities for dynamics storage allocation. Code optimization:
Principal sources of optimization, optimization of basic blocks, peephole optimization, flow graphs,
Data flow analysis of flow graphs.
UNIT - V: Code generation: Machine dependent code generation, object code forms, generic code
generation algorithm, Register allocation and assignment. Using DAG representation of Block
UNIT – 1
1. a) Write the Regular Expression for the language L over {0, 1} such that every string must
contain at least “000” b) Define Regular Expression & Design a Regular expression set of all
starting with “a” and ending with “b
2. Explain left & right derivations and left & right derivation trees with examples? (14M)
3. a) Construct DFA and NFA accepting the set of all strings containing 10 as a substring. b)
Draw the transition diagram of a FA which accepts all strings of a's and b's in which both the
number of b's and a's are even. c) Define NFA with epsilon with an example. (14M)
4. a) Construct a DFA with reduced states equivalent to the regular expression 10 + (0 + 11)0*
(7M) b) Prove (a + b)* = a*(ba*)* (7M)
5. Draw the transition table, transition diagram, transition function ofDFA 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?(14M)
6.
7. 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 of1’s. d) The set of all strings over {0,1} in which the number of occurrences of
is divisible by 3 (14M)
8. 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.
9. ) 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 thesame set
10.
11. Discuss about (14M) a) Context Free Grammar b) Left most derivation c) Right most
derivation d) Derivation tree.
12. . a) Construct a DFA equivalent to the regular expression 10+(0+11)0*11+00 (
13.
14. 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 e) b+ba
15. a) Convert the R.E. = (a+b)* into DFA (5M) b) Explain the steps to construct a FA for a given
regular expression.
16. ) Construct right-linear and left-linear grammars for the following regular expression.
A0→aA1, A1→bA1, A1→a, A1→bA0 (5M) b) 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”. (
17. 1. Discuss the phases of a compiler indicating the inputs and outputs of each phase in
translating the statement “amount = principle + rate * 36.0 ”
18. . List out the functions of a Lexical Analyzer? State the reasons for the Separation of Analyses
programs into Lexical, Syntax, and Semantic Analyses.
19. a)What is LEX? [4M+10M] b)Discuss the usage of LEX in Lexical Analyzer generation
20. What is LEX? Discuss the usage of LEX in Lexical Analyzer generation.
21. State the various phases of a compiler and explain them in detai
UNIT – 2
1. . Define an LL(1) grammar. Is the following grammar LL(1). G:S → iEtS | iEtSes |a , E → b.
Also write the rules for computing FIRST() and FOLLOW().
2. 3. What is an LALR(1) grammar?. Construct LALR parsing table for the following grammar:
S→ CC, C → cC , C → c|d .
3. Explain the usage of YACC parser generator in construction of a Parser
4. Define a Parser. What is the role of grammars in Parser construction? Construct the
Predictive parsing table for the grammar G : E → E+T |T , E →T*F |F , F →(E) |id.
5. What is an LR(0) item? Construct an SLR parsing table for the grammar G: S→ L=R |R, L → *R
| id, R → L. Is it SLR(1) grammar?.
6. Construct SLR parsing table for the following grammar: R-> R’|’R|RR|R*|(R)|al b
7. .a) Write a note on the parse generator '_ YACC. [7M+7M] b) Write the YACC specification of
a simple desk calculator as given: E->E+T/T T->T*F /F F -> (E) | digit where digit between 0 to
9.
8. a) Obtain the directed acycJic graph for the expression : x+x*(y+ z)+(y+z)* w [7M+7M] . b)
Explain the following with example: i) Quadqaples ii) Triples iii) Indirect triple
9. Compare and contrast SLR with LALR. Define Kernel items and Non-kernel items. [14 M]
Show the following grammar is LALR(1) S-> Aa | bAc | dc | bda A-> d
10. Prepare a canonical parsing table for the given grammar: [14 M] S-> CC C-> cC / d
11. Compare and contrast SLR with LALR. Define Kernel items and Non-kernel items. [14 M]
Show the following grammar is LALR(1) S-> Aa | bAc | dc | bda A-> d
UNIT – 3
1. . What are different intermediate code forms? Discuss different Three Address code types
and implementations of Three Address statements.
2. What do you mean by attributed grammars? Discuss the a translation scheme for Converting
an infix expression to its equivalent postfix form.
3. With a neat diagram explain the format of the Symbol Table. And discuss the tree structures
representation of scope information.
4. 6.a) Define activation records. b)Explain how it is related with runtime storage allocation.
5. Generate the three address code for the following code fragment. [14 M] while(a>b) { if(c
6. . Explain the use of symbol table in compilation process. List out the various attributes for
implementing the symbol table.
UNIT – 4
1. Explain the following code optimization techniques with examples . [5M+4M+5M] a)
Constant propagation b) Strength reduction c) Code Motion
2. 8. a) What is an induction variable? Explain with an example. [7 M] b) Discuss how induction
variables can be detected and eliminated from the given [7 M] intermediate code B2: i:= i+1
t1:=4*j t2:=a[t1] if t2<10 goto B2
3. What is the role of code Optimizer in compiler? Is it a mandatory phase?
4. What is DAG and flow graph? Explain their role in compilation process.
5. 5. Generate the three address code for the following code fragment. [14 M] a = b + 1 x = y +
3y=a/ba=b+c
6. Write a note on simple type checker and list the different types of type checking
7. What is the role of code Optimizer in compiler? Is it a mandatory phase?
8. a) Construct a DAG for the expression: a+a*(b-c)+(b-c)*d [7M+7M] b) Explain various
machine independent code optimization techniques
9. 7. Explain the different storage allocation strategies.
10. Explain the role of DAG in optimization with example.
UNIT – 5
OOPS
UNIT‐I Java Programming‐ History of Java, comments, Data types, Variables, Constants, Scope and
Lifetime of variables, Operators, Type conversion and casting, Enumerated types, Control flow‐ block
scope, conditional statements, loops, break and continue statements, arrays, simple java stand alone
programs, class, object, and its methods constructors, methods, static fields and methods, access
control, this reference, overloading constructors, recursion, exploring string class, garbage collection
UNIT – II Inheritance – Inheritance types, super keyword, preventing inheritance: final classes and
methods.. Polymorphism – method overloading and method overriding, abstract classes and
methods. Interfaces‐ Interfaces Vs Abstract classes, defining an interface, implement interfaces,
accessing implementations through interface references, extending interface, inner class. Packages‐
Defining, creating and accessing a package, importing packages.
UNIT‐IV Collection Framework in Java – Introduction to java collections, Overview of java collection
framework, Commonly used collection classes‐ Array List, Vector, Hash table, Stack, Lambda
Expressions. Files‐ Streams‐ Byte streams, Character streams, Text input/output, Binary
input/output, File management using File class. Connecting to Database – JDBC Type 1 to 4 drivers,
Connecting to a database, querying a database and processing the results, updating data with
JDBC,Data Access Object (DAO).
UNIT‐V GUI Programming with Swing ‐ The AWT class hierarchy, Introduction to Swing, Swing Vs
AWT, Hierarchy for Swing components, Overview of some Swing components – Jbutton, JLabel,
JTextField, JTextArea, simple Swing applications, Layout management – Layout manager types –
border, grid and flow Event Handling‐ Events, Event sources, Event classes, Event Listeners,
Delegation event model, Examples: Handling Mouse and Key events, Adapter classes.
UNIT – 1
UNIT – 2
1. a)Explain different types of inheritances with example program? [7M] b)What is a package?
Explain User defined package with program?
2. . a)What is an Object class? Explain Object class methods? [7M] b) Explain super keyword
with program?
3. a)Explain Method overriding and Abstract class with example program? [7M] b)What is inner
class? Explain different types of inner classes?
4. . a)Difference between Interface and Abstract class? [7M] b) Explain final keyword with
method and class?
5. . Explain Constructor Overloading and Method Overloading with example program?
6. a)Explain Dynamic binding with example program? [7M] b)What is an interface? Explain how
to extend an interface with program?
7. . a)Explain different Access Specifiers in java? [7M] b) Explain about this keyword and built in
packages?
8. a)Explain Object class Methods with example? [7M] b)Explain difference between Abstract
class and Interface?
9. a)Explain about super keyword with example program? [7M] b) Explain how multiple
inheritance is supported in java? Justify
UNIT – 3
1. a) What is an Exception? Explain different types of Exceptions? [7M] b) Explain about try and
catch with example program?
2. a) Explain how to create a Thread with example program? [7M] b) Explain about Thread
Priority with example program?
3. a) What is user defined Exception? Explain user defined Exception with program? [7M] b)
Explain Multiple catch blocks with program?
4. a) What is a Thread? Explain Thread Life cycle with neat diagram? [7M] b) Explain Inter-
Thread Communication with Producer and Consumer problem?
5. a) Explain throw and throws keyword with example program? [7M] b)Explain nested try
block with example program?
6. 6 a) Explain Thread Synchronization with example program? [7M] b) Explain about
Interrupting thread with example program
7. a) Explain about Thread Synchronization with program? [7M] b) Explain Inter Thread
Communication with program?
8. a) What is Exception? Explain Built in Exceptions in java [7M] b)What is User defined
Exception? Explain User defined Exception with program
9. a) What is Exception? Explain Built in Exceptions in java [7M] b)What is User defined
Exception? Explain User defined Exception with program
10. a) Explain about checked and unchecked Exceptions in java? [7M] b) Explain finally block
with example program?
11. b) Explain about Creating a Thread with program ?
UNIT – 4
1. . a)Explain File class methods with program? [7M] b) Explain different types of Drivers in
JDBC?
2. b) Explain about Creating a Thread with program ?
3. b) Explain about Creating a Thread with program ?
4. Explain about Vector class and StringTokenizer class with example Program?
5. Explain Array List class, Vector class and Hash table class with example program?
6. a)Explain FileInputStream and FileOutputStream class with example program? [7M] b) Write
a program to update data in the database using JDBC?
7. . Explain Stack class, Random class and Scanner class with example program?
8. a)Explain RandomAccessFile methods with example program? [7M] b) Write a program to
insert data in to the database using JDBC?
9. Explain Calendar class and Random class with example program?
10. a) Explain different steps for creating JDBC? [7M] b) Write a program to delete data from the
database using JDBC?
11. Explain differences between Applet and Application?
12. 9. a) Explain Event classes and Event Listeners with example? [7M] b) Write a program for
handling Key Events?
13. Explain FileOutputStream with program?
14. a) Explain different types of applets in java [7M] b) Explain how to pass parameters to an
applet with program?
UNIT – 5
1. .a) Write a java program for handling Mouse Events and Key Events? [7M] b) Explain about
AWT and Swing?
2. a) Explain about Delegation Event Model? [7M] b) Difference between AWT and Swing
3. ) Explain AWT components [14M] i) Label ii) Button iii) Text Field iv) Checkbox
4. a) Differences between AWT and Swings? [7M] b) Difference between Applets and
Applications?
5. ) Explain about Layout Managers with program
6. Explain different types of Layouts with example program?
7. .a) Explain Applet life cycle with neat diagram? [7M] b) Explain any three Swing
components?
8. ) Write a program for Calculator using Swings?
9. .a) Explain Adapter class with example program? [7M] b) Difference between Applets and
Applications?
10. Explain Event classes and Event Listeners in Event handling Mechanism
11. a) Explain about Delegation Event Model? [7M] b) Explain how to pass parameters to an
applet with program
12. ) Explain Swing components [14M] i) JButton ii) JLabel iii) JTextfield iv) JTextArea
13. 0.a) Explain about Graphic class methods? [7M] b) Explain about Border, Grid, and Flow
Layouts in java?
14. ) Explain about AWT controls with program?
DBMS
UNIT I: Database System Applications, Purpose of Database Systems, View of Data – Data
Abstraction –Instances and Schemas – Data Models – the ER Model – Relational Model – Other
Models – Database Languages – DDL – DML – database Access for applications Programs – Database
Users and Administrator – Transaction Management – Database Architecture – Storage Manager –
the Query Processor. Introduction to the Relational Model – Structure – Database Schema, Keys –
Schema Diagrams. Database design and ER diagrams – ER Model - Entities, Attributes and Entity sets
–Relationships and Relationship sets – ER Design Issues – Concept Design – Conceptual Designwith
relevant Examples. Relational Query Languages, Relational Operations.
UNIT II: Relational Algebra – Selection and projection set operations – renaming – Joins – Division –
Examples of Algebra overviews – Relational calculus – Tuple Relational Calculus (TRC) – Domain
relational calculus (DRC). Overview of the SQL Query Language – Basic Structure of SQL Queries, Set
Operations, Aggregate Functions – GROUPBY – HAVING, Nested Sub queries, Views, Triggers,
Procedures.
UNIT III: Normalization – Introduction, Non loss decomposition and functional dependencies,
First,Second, and third normal forms – dependency preservation, Boyce/Codd normal form. Higher
Normal Forms - Introduction, Multi-valued dependencies and Fourth normal form, Joindependencies
and Fifth normal form
UNIT IV: Transaction Concept- Transaction State- Implementation of Atomicity and Durability –
Concurrent Executions – Serializability- Recoverability – Implementation of Isolation – Testing for
serializability- Lock –Based Protocols – Timestamp Based ProtocolsValidation- Based Protocols –
Multiple Granularity.
UNIT V: Recovery and Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions –
Check Points - Buffer Management – Failure with loss of nonvolatile storage.
UNIT – 1
UNIT – 2
UNIT – 3
1. Explain the following a) Lossless Join b) Lossless decomposition
2. What are the advantages of normalized relations over the unnormalized relations?
3. . Define BCNF? How does BCNF differ from 3NF? Explain with an example
4. What is Redundancy? What are the different problems encountered by redundancy? Explain
them
5. Explain FD and MVD with examples
6. What is Normalization? Discuss what are the types? Discuss the 1NF, 2NF, 3NF with
example? S
7. Explain about the fourth and fifth normal forms
8. Define Functional dependencies? How are primary keys related to functional dependencies?
9. b)Why normalization is required? And explain different types of normal forms[10M]
10. b) Define BCNF .How does it differ from 3NF
UNIT – 4
1. 7. a) How the use of 2PL would prevent interference between the two transactions. b)
Explain the difference between strict 2PL and rigorous 2PL?
2. (a) Explain Time stamp-Based Concurrency Control protocol [5M] (b) Explain remote backup
system [5M]
3. (a) Explain about validation based protocols. [5M] (b Discuss on strict, two-phase locking
protocol [5M]
4. Explain different recovery techniques used in transaction failure?
5. What are the transaction isolation levels in SQL?
6. Explain how concurrency execution of transactions improves overall system performance?
7. What are the types of failures of a system?
8. What are the two tables used in crash recovery along with log record? Explain with suitable
example?
9. Write the locking compatibility matrix used for multiple granularity? Explain with suitable
examples?
10. Define the concept of schedule for a set of concurrent transaction. Give a suitable example
11. a) Explain Time stamp-Based Concurrency Control protocol [8M] b) Explain remote backup
system
12. .a)What are the two tables used in crash recovery along with log record?Explain With
suitable example? [8M] b) Explain about validation based protocols. [6M
UNIT – 5
1. How the volatile and the nonvolatile storage device are differ from each other?
2. How the data will be recovered by concurrent transcations
3. How the data will be recovered by concurrent transcations?
4. What is Buffer Management? What is Log Based Recovery and recovery base Transactions?
5. What is Buffer Management??
6. Explain static and dynamic Hashing Techniques? [10M]
7. . Explain in detail insertion methods B+ tree index files with example.[10M]
8. What is Log Based Recovery and recovery base Transactions?
9. What is Log Based Recovery and recovery base Transactions?
10. How the volatile and the non volatile storage device are differ from each other?
11. 9.a)Explain about tertiary storage media in detail? [6M] b)Explain static and dynamic
Hashing Techniques?
12. . a) Explain Clustered Indexes b) Primary and Secondary Indexes [8M] b) Explain in detail
insertion methods B+ tree index files with example[6M]
CN
UNIT - I: Introduction: Network, Uses of Networks, Types of Networks, Reference Models: TCP/IP
Model, The OSI Model, Comparison of the OSI and TCP/IP reference model. Architecture of Internet.
Physical Layer: Guided transmission media, Wireless transmission media, Switching
UNIT - II: Data Link Layer - Design issues, Error Detection & Correction, Elementary Data Link Layer
Protocols, Sliding window protocols Multiple Access Protocols - ALOHA, CSMA, CSMA/CD, CSMA/CA,
Collision free protocols, Ethernet- Physical Layer, Ethernet Mac Sub layer
UNIT - III: Network Layer: Network Layer Design issues, store and forward packet switching
connection less and connection oriented networks-routing algorithms-optimality principle, shortest
path, flooding, Distance Vector Routing, Count to Infinity Problem, Link State Routing, Path Vector
Routing, Hierarchical Routing; Congestion control algorithms, IP addresses, CIDR, Subnetting,
SuperNetting, IPv4, Packet Fragmentation, IPv6 Protocol, Transition from IPv4 to IPv6, ARP, RARP.
UNIT - IV: Transport Layer: Services provided to the upper layers elements of transport protocol
addressing connection establishment, Connection release, Error Control & Flow Control, Crash
Recovery. The Internet Transport Protocols: UDP, Introduction to TCP, The TCP Service Model, The
TCP Segment Header, The Connection Establishment, The TCP Connection Release, The TCP Sliding
Window, The TCP Congestion Control Algorithm.
UNIT - V: Application Layer- Introduction, providing services, Applications layer paradigms: Client
server model, HTTP, E-mail, WWW, TELNET, DNS; RSA algorithm Components of LT Switchgear:
Switch Fuse Unit (SFU), MCB, ELCB, Types of wires and cables, Earthing. Elementary calculations for
energy consumption and battery backup. Transform.
UNIT – 1
7. (a)Compare and contrast a circuit-switched network and a packet-switched network [7] (b)
Explain OSI reference model and compare it with TCP/IP. ? [7]
8. (a)Explain different types of switching techniques along with their advantages and
disadvantages. [7M] b) Explain Guided media with neat diagrams.[7M]
9. (a) Write short notes on TCP/IP model. [7M] (b) Explain the OSI reference model. [7M]
10. A) What are the different types of error detection methods? Explain the CRC error detection
technique using generator polynomial x4+x3+1 and data 11100011 [7M] B) Explain about
various guided transmission media in physical layer with a neat sketch.[7]
11. A) Explain how are OSI and ISO related to each other. [5M] B) Suppose a computer sends a
frame to another computer on a bus topology LAN., the physical destination address of the
frame is corrupted during the transmission. what happens to the frame how can the sender
be informed about the situation [9M]
12. (a) Discuss about Internet standards [7M] (b) Compare and contrast the OSI and TCP/IP
reference models?
13. (a) Explain about Go Back ‘N’ Sliding Window Protocol? [7M] (b) Explain the algorithm for
CRC method of error checking [7M] SECTI
UNIT – 2
9. (a) What are the services provided to the Network Layer by Data Link Layer? Explain. [7] (b)
Given 1101011011 data frame and generator polynomial G(x) = x4 + x + 1. Derive the
transmitted frame. [7]
10. Describe the significance of error detection and error correction mechanisms in data link
layer. [14]
11. Compare various sliding window protocols of data link layer
12. What is the purpose of CSMA/CD? And also explain it. [
13. Write in detail about sliding window protocols. [14M]
14. A) What are the functions of medium access control layers protocol? Explain. [7M] B)
Compare and contrast a controlled access protocol with a channelizing protocol [7M
15.
UNIT – 3
1. Explain distance vector routing algorithm and what is count to infinity problem provide
solutions [14]
2. (a) Discuss the IP addressing methods. [7] (b) .Write short notes on ARP. [7] S
3. Explain the various congestion control mechanisms. [
4. 6 (a)What is Classless Inter Domain Routing. [7M] (b)Explain The Address Resolution
Protocol. [
5. A) Derive the optimality principle with a suitable example [6M] (B) Explain various
congestion control mechanisms in detail [
6. A) Describe Dijkstra shortest path algorithm. Also show working of Dijkstra algorithm with
the help of an example. [7M] B) Describe the problem and solutions associated with distance
vector routing. [7M
7. (a) What are the advantages of adaptive routing approach over non adaptive routing? [4M]
(b) Explain various congestion control mechanisms in detail.[10M]
8. Describe Dijkstra shortest path algorithm. Also show working of Dijkstra algorithm with the
help of an example. [14M]
UNIT – 4
UNIT – 5
IPR
UNIT – I: Introduction: Introduction to Intellectual Property Rights, types of intellectual property,
importance of intellectual property rights, Evolution of IP acts and treaties, Agencies responsible for
IPR registrations, Role and value of IP in international commerce, Issues affecting IP internationally.
UNIT – II Trade Marks: Purpose and function of trademarks, Acquisition of trade mark rights, transfer
of rights, Selecting and evaluating trademark, registration of trademarks, claims. Trade Secrets:
Trade secret law, determination of trade secret status, liability for misappropriation of trade secrets,
trade secret litigation. Geographical Indication of Goods: Basic aspects and need for the registration
UNIT – III Copyrights: Fundamentals of copyright law, originality of material, right of reproduction,
right to perform the work publicly, copyright ownership issues, notice of copyright. Patents:
Foundation of patent law, patent searching process, Basic Criteria of Patentability Industrial Designs:
Kind of protection provided in Industrial design
UNIT – IV: Managing IP Rights: Acquiring IP Rights: letters of instruction, joint collaboration
agreement, Protecting IP Rights: non disclosure agreement, cease and desist letter, settlement
memorandum. Transferring IP Rights: Assignment contract, license agreement, deed of assignment
UNIT- V Introduction to Cyber law: Information Technology Act, cyber crime and e-commerce, data
security, confidentiality, privacy, international aspects of computer and online crime.
UNIT – 1
UNIT – 2
UNIT – 3
1. What are publicity rights? What are the legal provisions pertaining to publicity rights? What
are the remedies available against the infringement of publicity rights?
2. What is copyright? What is originality of material in copyright works? What are the rights
granted under copyright law?
3. Explain about the right to perform the work publicly, copyright ownership issues and notice
of copyright
4. Explain how ownership of copy rights gained and how it can be transferred
5. Discuss various subject matters covered under copy rights Act
UNIT – 4
UNIT – 5
1. What are the types of cybercrimes committed in e-commerce and what are the measures to
be taken to prevent the cybercrimes in e-commerce and enhance ecommerce?
2. a)Explain in detail about E-commerce and cyber crime
b) Discuss international laws related to online crime
3.
UNKNOWN
1. Give an overview on international intellectual properties with a focus on trade mark law and
copyright law.
2. Explain the role of WTO in promoting IPR
3. Explain international aspects of IPR related to trademarks and trade secrets.
4.
QUESTION BANK INTELLECTUAL PROPERTY RIGHTS SUBJECT CODE: R17A0051 UNIT I 1] What
Intellectual Property Law? Give examples of same? 2] What are the Types of Intellectual Property
Rights? Explain in detail? 3] What is Importance of Intellectual Property Rights, write in details? 4]
What are Agencies responsible for Intellectual Property Rights registration? 5] What are Regulatory-
Compliance and liability issues? Explain in detail. UNIT II 1] What is Trade Marks? Explain in detail
with examples? 2] What is Purpose and function of Trade Marks? 3] What are Acquisition of Trade
Mark Rights? 4] What do you mean by Transfer of Rights? 5] What is Protectable matter? Give
examples of same. 6] What are the procedures for selecting and evaluating Trademark? 7] What is
Registration of Trade Marks and Claims? Explain in detail. 8] What is Trade Secret Law? Explain in
detail. 9] What is the procedure for Determination of Trade Secret status? 10] What is liability for
misappropriation of trade secrets? Explain in detail? 11] What is protection for submission of Trade
Secret? 12] What is Trade Secret Litigation? 13] What is Unfair Competition? Give examples of same.
14] What is Misappropriation right of publicity? 15] What is false advertising, give examples of that?
1] What are Fundamentals of copyright law? UNIT III 2] What is originality of material? Give
examples of that? 3] What is right of reproduction? 4] What is right to perform the work publicity?
5] What are copyright ownership issues? 6] What is notice of copyright? 7] What is Foundation of
patent law? 8] What is Patent searching process? 9] What is ownership right and transfer? UNIT IV 1]
What is Cyber law and Information Technology act? 2] What is Cyber Crime and e-commerce Issues?
3] What is data security? Give some examples of same? 4] What is confidentiality, privacy of cyber
law? 5] What are International aspects of computer and online crimes, explain in detail? UNIT V 1]
What is new development of intellectual property? 2] What are new developments in trade mark
law? 3] What is copyright law, patent law? Explain in detail? 4] Write notes on International
overview on intellectual property rights? 5] Explain the international trade mark law? 6] Explain the
copyright law and patent law on overview internationally?