DMGT MID-2 Exam Prep
Full explanation, worked examples & memory tricks in the app
🎯 Exam Preparation Kit
DMGT MID-2 Exam Prep
English 16 leveled MCQs Free
Shared by a Veda learner · Generated with Veda AI
Smart notes
1
What you'll study, topic by topic
Solved paper preview
Sample questions with model answers
Every question in the paper gets a full exam-length answer in the app — organised by marks, the way a topper writes it.
5 marks Long answer
How many four digit numbers can be formed using the digits 0, 1, 2, 3, 4, 5 if repetition of digits is allowed.
Show answer outline
There are 5,000 four-digit numbers.
The full exam-length answer is in the app.
5 marks Long answer
Find the no. of arrangements of the letters in the word ENGINEERING.
Show answer outline
The number of arrangements is 9,072.
The full exam-length answer is in the app.
5 marks Long answer
Find how many solutions are there for $x_1 + x_2 + x_3 = 17$, subject to the constraints $x_1 \geq 1$, $x_2 \geq 2$, $x_3 \geq 3$.
Show answer outline
There are 56 solutions.
The full exam-length answer is in the app.
5 marks Long answer
Find the coefficient of $x^3 y^2 z^2$ in $(2x - y + z)^7$.
Show answer outline
The coefficient is 840.
The full exam-length answer is in the app.
5 marks Long answer
Solve $a_n = a_{n-1} + f(n)$ for $n \geq 1$ by using substitution method.
Show answer outline
Use substitution to express $a_n$ in terms of $f(n)$.
The full exam-length answer is in the app.
5 marks Long answer
Solve the recurrence relation $a_n = 3a_{n-1} + 2^n$ where $a_0 = 1$ by generating function.
Show answer outline
The solution is $a_n = 2^{n+1} - 1$.
The full exam-length answer is in the app.
5 marks Long answer
Solve the recurrence relation $a_n - 4a_{n-1} + 3a_{n-2} = 2^n$, $n \geq 2$ with initial conditions $a_0 = 1$, $a_1 = 11$. Using characteristic roots.
Show answer outline
The solution is $a_n = C_1 \cdot 3^n + C_2 \cdot 1^n + 2^n$.
The full exam-length answer is in the app.
5 marks Long answer
Prove that a tree with $n$ vertices has $n-1$ edges.
Show answer outline
A tree is minimally connected, hence it has $n-1$ edges.
The full exam-length answer is in the app.
3 marks Medium answer
Define Euler's formula & problems.
Show answer outline
Euler's formula states $e^{ix} = \cos(x) + i\sin(x)$.
The full exam-length answer is in the app.
3 marks Medium answer
State Sum of degrees theorem (or) handshaking theorem and problems.
Show answer outline
The sum of degrees of all vertices in a graph equals twice the number of edges.
The full exam-length answer is in the app.
2 marks Short answer
Write Binomial theorem.
Show answer outline
The Binomial theorem states $(a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k$.
The full exam-length answer is in the app.
2 marks Short answer
Define minimal spanning tree.
Show answer outline
A minimal spanning tree is a tree that connects all vertices with the minimum total edge weight.
The full exam-length answer is in the app.
1 marks Short answer
Define Directed graph.
Show answer outline
A directed graph is a graph where edges have a direction.
The full exam-length answer is in the app.
1 marks Short answer
Define Complete graph.
Show answer outline
A complete graph is a graph where every pair of vertices is connected.
The full exam-length answer is in the app.
1 marks Short answer
Define Hamiltonian graph.
Show answer outline
A Hamiltonian graph contains a Hamiltonian cycle that visits every vertex exactly once.
The full exam-length answer is in the app.
1 marks Short answer
Define Eulerian graph.
Show answer outline
An Eulerian graph contains an Eulerian circuit that visits every edge exactly once.
The full exam-length answer is in the app.
Study it properly — free, 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.