Brief Answer Questions:
[10 × 1 = 10]Why do we need quantifier?
Define pseudorandom integer.
Give an example of recursively defined set.
When do you use sum rule?
Define simple graph.
What does prefix code mean?
Define logic.
How do you define hypothesis in strong induction?
Differentiate between homogeneous and non homogeneous recurrence relation.
Define binary search tree.
Short Answer Questions: (Attempt any FIVE Questions)
[5 × 3 = 15]Compute the value of 5 mod 6, -5 mod 6 and 2 mod 2.
Use the Extended Euclidean algorithm to find the GCD of 16 and 28.
What is chromatic number. Define graph coloring with its applications.
Find the minimum spanning tree from following graph using Prim's algorithm.
Create a BST from 6, 5, 8, 10, 2, 100 and traverse it in post order.
Solve the following linear congruence using Chinese Remainder Theorem.
x ≡ 1 (mod 5)
x ≡ 2 (mod 7)
Long Answer Questions: (Attempt any THREE Questions)
[3 × 5 = 15]Using mathematical induction prove that n! ≥ 2n for n ≥ 4.
Using proof by contradiction, show that the sum of odd integers is even.
Solve the recurrence relation aₙ = 3aₙ₋₁ - 2aₙ₋₂, with initial conditions a₀ = 1 and a₁ = 2.
Represent the following sentences using predicate.
a. Not all heroes are brave.
b. Employee who work overtime are awarded.
Comprehensive Answer / Case / Situation Analysis Questions:
[2 × 10 = 20]Define path, Hamilton path, Euler path and planar graph. Explain any two ways for representing graph with example.
(a) A company wants to hire a new team of five employees from a pool of 15 candidates. How many different possible teams can be formed if the company requires at least one male and two female?
(b) A group of 101 people attend a party. Show that there must be at least two people at the party who were born on the same day of the week.