Register
Filter

Questions by LavTheRawkstar

0 votes
0 answers
241
Gate Discrete Mathematics
Find the number of sub algebra of the Boolean algebra D110.
Find the number of sub algebra of the Boolean algebra D110.
0 votes
1 answer
242
Gate Discrete Mathematics
Using Generating function , solve the recurrence relation an+2 - 2an+1 + an = 2n , n>=0 , a0=2 , a1=1
Using Generating function , solve the recurrence relation an+2 - 2an+1 + an = 2n , n>=0 , a0=2 , a1=1
0 votes
1 answer
243
Gate Discrete Mathematics
If f : R - > R defined by , Show that f is invertible.
If f : R - R defined by , Show that f is invertible.
0 votes
0 answers
244
GATE DIscrete MATHs
Prove that if a and b are the elements in a bounded,distributive lattice and if a has a compliment a' then a ∨ (a' ∧ b) = a ∨ b, a ∧ (a' ∨ b ) = a ∧ b .
Prove that if a and b are the elements in a bounded,distributive lattice and if a has a compliment a' thena ∨ (a' ∧ b) = a ∨ b, a ∧ (a' ∨ b ) = a ∧ ...
0 votes
1 answer
245
gate Discrete
Let A = {1,2,3,4} and let S= A x A . Define the Relation R on S as(a,b) R (c,d) iff a+b=c+d. Show that R is an Equivalence Relation and find S/R.
Let A = {1,2,3,4} and let S= A x A .Define the Relation R on S as(a,b) R (c,d) iff a+b=c+d.Show that R is an Equivalence Relation and find S/R.
0 votes
0 answers
246
Gate Discrete MAths
Solve the recurrence relation an - 4 an-1 - 11 an-2 + an-3 = 0 , a0 = 0 , a1 = -35 , a2=-85.
Solve the recurrence relationan - 4 an-1 - 11 an-2 + an-3 = 0 , a0 = 0 , a1 = -35 , a2=-85.
0 votes
1 answer
247
GATE DISCRETE MATHS
Prove that for all n>=1 , n! >= 2n-1 using principle of mathematical induction.
Prove that for all n>=1 , n! >= 2n-1 using principle of mathematical induction.
0 votes
0 answers
248
Discrete GATE
How to prove that Power set (P(S) , <= ) is a lattice, where symbols have their usual meanings.
How to prove that Power set (P(S) , <= ) is a lattice, where symbols have their usual meanings.
0 votes
1 answer
249
GATE DISCRETE MATHS
The matrix of a relation R: A->A is given by MR = Determine R-1 and compliment of R.
The matrix of a relation R: A->A is given by MR = Determine R-1 and compliment of R.
1 votes
2 answers
250
GATE DIscrete MAths
Show that the function f, g :R ->R defined as : , &forall; x &isin; &#8477; are inverses of each other.
Show that the function f, g :R ->R defined as : , &forall; x &isin; &#8477; are inverses of each other.
3 votes
2 answers
251
Discrete
Draw the Hasse diagram of the set A={1,2,3,4} under the partial ordering relation "<=" i.e., "less than or equal to"?
Draw the Hasse diagram of the set A={1,2,3,4} under the partial ordering relation "<=" i.e., "less than or equal to"?
1 votes
2 answers
252
GATE Discrete Obtain the disjunctive normal form and conjuctive normal form of
Obtain the disjunctive normal form and conjuctive normal form of E(x1,x2,x3) = [ (x1 - x2)` + (x1`.x3) ] ' .
Obtain the disjunctive normal form and conjuctive normal form of E(x1,x2,x3) = [ (x1 - x2) + (x1 .x3) ] ' .
1 votes
1 answer
253
Discrete Mathematics one to one and onto function
Prove that the function f : R -> R defined as f(x) = 2x + 3 for all x &epsilon; R is both one to one and onto.
Prove that the function f : R - R defined as f(x) = 2x + 3 for all x &epsilon; R is both one to one and onto.
1 votes
2 answers
254
GATE DISCRETE MATHEMATICS
Show without using a truth table that p V q ~ p ---------------------------------------------------------------- &there4; q
Show without using a truth table that p V q ~ p &there4; q
1 votes
0 answers
255
GATE common Question Construct the DAG
Construct the DAG for the following code: a[i] = b *p = c d = a[j] e = *p *p = a[i]
Construct the DAG for the following code:a[i] = b*p = cd = a[j]e = *p*p = a[i]
0 votes
0 answers
257
Generate TAC :
Generate TAC for: int c; int p ; int n int i =1; n=100; c=i; p=n; while(c<p) { for(i=2;i=n;i++) { c=c+p; p=c-p; } } b) Also Construct basic block for above TAC and perform Optimization for it.
Generate TAC for: int c; int p ; int n int i =1; n=100; c=i; p=n; while(c<p) { for(i=2;i=n;i++) { c=c+p; p=c-p; } }b) Also Construct basic block for above TAC and perform...
1 votes
0 answers
259
Construct the LALR(1) parsing table for this grammar.
Consider the following Grammar S - > V = E E - > F | E+F F - > V | int | (E) V - > id Construct the LALR(1) parsing table for this Grammar.
Consider the following GrammarS - V = EE - F | E+F F - V | int | (E)V - idConstruct the LALR(1) parsing table for this Grammar.
2 votes
2 answers
260
Write Quadruples,Triples, and indirect Triples for the expression
Write Quadruples,Triples, and indirect Triples for the expression : (a+b) * (c+d) - (a+b+c)
Write Quadruples,Triples, and indirect Triples for the expression : (a+b) * (c+d) - (a+b+c)
Page: