i need answers for above mentioned questions in unit wise
Full explanation, worked examples & memory tricks in the app
Shared by a Veda learner · Generated with Veda AI
Full explanation, worked examples & memory tricks in the app
Every question in the paper gets a full exam-length answer in the app — organised by marks, the way a topper writes it.
Solve the following recurrence relations by the methods of characteristic roots: $a_n - 4a_{n-1} + 3a_{n-2} = 2^n, n \ge 2, a_0 = 1, a_1 = 11$.
Apply the characteristic equation and find the particular solution.
The full exam-length answer is in the app.
Solve the recurrence relation $a_{n+2} + 4a_{n+1} + 4a_n = 7, n \ge 0, a_0 = 1, a_1 = 2$. By Generating function.
Use generating functions to derive the closed form of the sequence.
The full exam-length answer is in the app.
Apply Prim's algorithm and Kruskal's Algorithm to find the minimum spanning tree (MST) of the graph with edges: (A-B, 4), (A-C, 2), (B-C,1), (B-D, 5), (C-D, 3). Also find the total weight of the minimal spanning tree.
MST weight is 6.
The full exam-length answer is in the app.
Construct the expression tree for the expression $((3+5)/2) - ((7*2)/7)$. Traverse the tree in preorder, in-order and post-order traversals. Also find prefix, infix and postfix notations of the given expression.
Prefix: - / + 3 5 2 / 7 14; Infix: ((3+5)/2) - ((7*2)/7); Postfix: 3 5 + 2 / 7 2 * 7 / -.
The full exam-length answer is in the app.
Solve $a_n - 3a_{n-1} + 2a_{n-2} = 0, a_0 = 1, a_1 = 2$.
The solution is $a_n = 2^n + n$.
The full exam-length answer is in the app.
Prove the validity of the following arguments: $\neg r \rightarrow (s \rightarrow \neg t)$, $\neg v \lor w$, $p \rightarrow s$, $\neg w$, $\therefore t \rightarrow p$.
Use truth tables or logical deduction to show the conclusion follows from the premises.
The full exam-length answer is in the app.
Define minimal spanning tree. Using Prim's algorithm, find a minimal spanning tree for the following weighted graph.
A minimal spanning tree connects all vertices with minimum total edge weight; apply Prim's algorithm step by step.
The full exam-length answer is in the app.
Explain the following with example. (i) complete graph (ii) Bipartite graph (iii) complete Bipartite graph.
Complete graph: all vertices connected; Bipartite: two sets of vertices; Complete Bipartite: every vertex of one set connected to all vertices of the other.
The full exam-length answer is in the app.
If G is a planar connected graph with n vertices, m edges and r regions then show that $r+n-m = 2$.
Use Euler's formula for planar graphs to derive the relationship.
The full exam-length answer is in the app.
Construct truth table if : $(P \rightarrow \neg R) \rightarrow (\neg Q \land R) \leftrightarrow (Q \rightarrow R)$.
Construct a truth table for all combinations of truth values for P, Q, and R.
The full exam-length answer is in the app.
Give an indirect proof for the following statement: If x and y are integers such that xy is odd, then x and y are both odd.
Assume x or y is even, leading to a contradiction since xy cannot be odd.
The full exam-length answer is in the app.
Obtain the Principal Disjunctive Normal Form for $(P \land Q) \lor (\neg P \land R) \lor (Q \land R)$.
The PDNF is $PQR + PQ + \neg PQR$.
The full exam-length answer is in the app.
In how many ways can the 26 letters of the English alphabets be permuted so that none of the patterns CAR, DOG, PUN, BYTE occur?
Calculate using the principle of inclusion-exclusion.
The full exam-length answer is in the app.
Let $X = \{1,2,5,10,20,40,60,120\}$ and the relation R defined by aRb if and only if a divides b. Check it is Lattice or not?
Check the properties of meet and join to verify if R forms a lattice.
The full exam-length answer is in the app.
Find the Identity and Inverse elements of the group with the operator * defined as (i) $(a, b) * (c, d) = \{ad-bc, ac+bd\}$ (ii) $a*b = (ab)/3$.
Identity for (i) is (0,0), and for (ii) is 1.
The full exam-length answer is in the app.
A drawer contains ten black and ten white socks. What is the least the least number of socks one must pull out to be sure to get a matched pair?
At least 3 socks must be pulled out.
The full exam-length answer is in the app.
Find the number of integral solutions to the equation $x_1 + x_2 + x_3 + x_4 + x_5 = 20$ where $x_1 \ge 3, x_2 \ge 2, x_3 \le 4, x_4 \ge 6, x_5 \ge 0$.
Use generating functions or combinatorial methods to find the solutions.
The full exam-length answer is in the app.
How many 2-digit or 3-digit numbers can be formed using the digits 1, 3, 4, 5, 6, 8 and 9 if no repetition is allowed?
Calculate the combinations for 2-digit and 3-digit separately.
The full exam-length answer is in the app.
In how many ways can a committee of five ladies and four gents be chosen from nine ladies and 15 gents, if a particular person A refuses to take part if lady B is on the committee?
Use combinatorial counting considering the restriction.
The full exam-length answer is in the app.
Find the 5-digit integers that contain the number 6 exactly once.
Count the valid placements of 6 in the 5-digit number.
The full exam-length answer is in the app.
State the Sum of degrees theorem and find N when a graph has N vertices of degree 1, 2 vertices of degree 2, 4 vertices of degree 3 and 3 vertices of degree 4.
The sum of degrees equals twice the number of edges; calculate N based on given degrees.
The full exam-length answer is in the app.
Show that $p \rightarrow q$ is equivalent to $\neg p \lor q$ using truth tables.
Truth tables confirm the equivalence.
The full exam-length answer is in the app.
Translate into predicate logic: (i) All students are intelligent. (ii) Some birds cannot fly.
i) ∀x (Student(x) → Intelligent(x)), ii) ∃y (Bird(y) ∧ ¬Fly(y)).
The full exam-length answer is in the app.
Out of 100 students, 60 like tea, 45 like coffee and 20 like both. How many like neither tea nor coffee?
20 students like neither.
The full exam-length answer is in the app.
Let $f(x)=x+2$ and $g(x)=2x$. Find $(f \circ g)(3)$ and $(g \circ f)(3)$.
(f \circ g)(3) = 8, (g \circ f)(3) = 10.
The full exam-length answer is in the app.
If $f(x)=3x+5$, find the inverse $f^{-1}(x)$.
The inverse is $f^{-1}(x) = \frac{x-5}{3}$.
The full exam-length answer is in the app.
Find the coefficient of $x^4$ in the expansion of $(1+x)^{12}$.
The coefficient is 495.
The full exam-length answer is in the app.
Using multinomial theorem, find the coefficient of $a^2 b^2 c^2$ in $(a+b+c)^6$.
The coefficient is 90.
The full exam-length answer is in the app.
Find the middle term(s) in the expansion of $(x+3)^{10}$.
The middle term is 945.
The full exam-length answer is in the app.
Show that $\sum_{k=0}^{n} \binom{n}{k} = 2^n$.
It follows from the binomial theorem.
The full exam-length answer is in the app.
Solve $a_n = a_{n-1} + n, a_0 = 0$.
a_n = \frac{n(n+1)}{2}.
The full exam-length answer is in the app.
Solve $a_n = a_{n-1} + 2n, a_0 = 1$.
a_n = n^2 + n + 1.
The full exam-length answer is in the app.
Distinguish between implication and equivalence with examples.
Implication is $p \rightarrow q$, equivalence is $p \leftrightarrow q$.
The full exam-length answer is in the app.
Test whether $(p \leftrightarrow q)$ is equivalent to $(p \rightarrow q) \land (q \rightarrow p)$.
Yes, they are equivalent.
The full exam-length answer is in the app.
Differentiate between universal quantifier ($\forall$) and existential quantifier ($\exists$) with examples.
Universal: ∀x P(x), Existential: ∃y Q(y).
The full exam-length answer is in the app.
Write the negation of the statement: $\forall x (P(x) \lor Q(x))$.
The negation is $\exists x (\neg P(x) \land \neg Q(x))$.
The full exam-length answer is in the app.
State and explain the principle of inclusion-exclusion.
It calculates the size of unions by subtracting intersections.
The full exam-length answer is in the app.
Find the number of integers between 1 and 200 divisible by 3 or 5.
The count is 66.
The full exam-length answer is in the app.
Define composition of functions with an example.
Composition: $(f \circ g)(x) = f(g(x)).
The full exam-length answer is in the app.
A committee of 6 is formed from a group of 8 men and 7 women. Find the number of ways of selecting the committee with 3 men, 3 women.
The number of ways is 280.
The full exam-length answer is in the app.
Give Truth table for the propositional formula $(p \rightarrow q) \rightarrow q$.
The truth table shows the output of the formula based on the truth values of p and q.
The full exam-length answer is in the app.
State the converse, opposite, and contrapositive to the following: If triangle ABC is a right-angled triangle, then $|AB|^2 + |BC|^2 = |AC|^2$.
Converse: If $|AB|^2 + |BC|^2 = |AC|^2$, then triangle ABC is a right-angled triangle.
The full exam-length answer is in the app.
Define equivalence relation.
An equivalence relation is a binary relation that is reflexive, symmetric, and transitive.
The full exam-length answer is in the app.
Find fog(x) if $f(x) = x^2 + 1$ and $g(x) = 2x – 1$.
fog(x) = (2x - 1)^2 + 1.
The full exam-length answer is in the app.
Find the number of all possible five letter words from the word “DADDY”.
There are 30 distinct five-letter words from 'DADDY'.
The full exam-length answer is in the app.
What is the coefficient of $x^3y$ in $(x+y)^{10}$?
The coefficient is 120.
The full exam-length answer is in the app.
Find the generating function for the sequence $0^2, 1^2, 2^2, 3^2, \ldots$.
The generating function is $\frac{x^2}{(1-x)^3}$.
The full exam-length answer is in the app.
A person deposits Rs: 1,000/- that yields interest compounded 9% yearly. Set up the recurrence relation for the amount in the account at the end of 'n' years.
The recurrence relation is $A_n = 1.09 A_{n-1}$, with $A_0 = 1000$.
The full exam-length answer is in the app.
Explain is there a simple graph corresponding to degree sequence (1,1,2,3).
Yes, a simple graph can be constructed with vertices of degrees 1, 1, 2, 3.
The full exam-length answer is in the app.
Define Hamiltonian graphs.
A Hamiltonian graph is a graph that contains a Hamiltonian cycle, visiting each vertex exactly once.
The full exam-length answer is in the app.
Check whether the statement $(p \lor eg p)$ is a tautology.
Yes, it is a tautology.
The full exam-length answer is in the app.
Translate the statement 'All humans are mortal' into predicate logic.
∀x (Human(x) → Mortal(x))
The full exam-length answer is in the app.
Define the recursive function: $f(0)=1, f(n)=2f(n-1)$. Find $f(3)$.
f(3) = 8.
The full exam-length answer is in the app.
Show that the set of natural numbers under addition is a monoid but not a group.
It has an identity (0) but lacks inverses.
The full exam-length answer is in the app.
In how many ways can the letters of the word MISSISSIPPI be arranged?
The arrangements = 34650.
The full exam-length answer is in the app.
Find the coefficient of $x^4$ in the expansion of $(1+x)^{10}$.
The coefficient is 210.
The full exam-length answer is in the app.
Solve the recurrence relation $a_n = 3a_{n-1}, a_0 = 2$.
a_n = 2 * 3^n.
The full exam-length answer is in the app.
If $a_n=2^n$, write its generating function.
The generating function is $\frac{1}{1-2x}$.
The full exam-length answer is in the app.
How many edges does a tree with 8 vertices have?
A tree with 8 vertices has 7 edges.
The full exam-length answer is in the app.
Construct a complete binary tree of height 3. How many leaf nodes does it have?
It has 8 leaf nodes.
The full exam-length answer is in the app.
The full Veda Bites deck, complete notes, spaced-repetition flashcards, leveled MCQs, tests and games for this kit — plus Daily Facts and the Arena, every day.