Define subset and power set. How do you prove correctness of recursive algorithm using Induction? Illustrate with an example. [5]
Counting and Discrete Probability
1.
State sum rule and product rule. If 26 integers are chosen from the set of consecutive integers {1,2,3,...,50}, prove that there are sure to be two numbers so that one is multiple of the other. [5]
2.
When do we use permutation rather than combination? How many 5-digit numbers can be generated using the digits 0 to 9, if each number starts with 98 and no digit appears more than once? [5]
Induction and Recursion
1.
Using mathematical induction show that $5 + 2 + 5 + 8 + ... + (3n-1) = \frac{n(3n+1)}{2}$ [5]
2.
Solve the recurrence relation $a_n = a_{n-1} + 2a_{n-2}$ with initial conditions $a_0 = 2$ and $a_1 = 7$. [5]
Integers and Matrices
1.
Determine whether the function f(x) = x-1 from set of integers to the set of integers is injective, surjective or bijective. Write the type of Fuzzy set operations with their definition. Give the floor and ceiling value of 1.2 and -1.2. [10]
2.
Find the GCD of 12 and 16 using Extended Euclidean Algorithm. [5]
3.
Discuss about meet and join operation between Boolean matrices. What are the values of 5 mod 75 and -5 mod 77? [5]
Logic and Proof Methods
1.
List any four rules of inference. Using direct and indirect proof show that, for any real number $x$, if $x^3 - 7x^2 + x - 7 = 0$, then $x = 7$ [10]
Relations and Graphs
1.
What are the necessary and sufficient conditions for graphs to have Euler path only and Euler circuit? Let $R$ be a relation defined on set of natural numbers $N$, such that $a,b \in N, aRb \leftrightarrow ab = 2k$, where $k \in \{0,1,2,...\}$. Show that $R$ is a partial ordering relation on $N$ [10]
2.
Define chromatic number. How does Kruskal's algorithm find Minimum Spanning Tree? [5]
3.
What is network flow? Give an example of saturated edge, unsaturated edge, and slack. [5]