Question bank

Long Answer Question

Unit 1

1) Show that p∨(q ∧r) and (p∨q)∧(p∨r) are logically equivalent.

2) Show that¬(p∨q) and ¬p∧¬q are logically equivalent

3) Prove that if n is an integer and 3n+2 is odd, then n is odd.

4) prove that “If n is an odd integer, then n2 is odd.”
5) Build a digital circuit that produces the output (p∨¬r)∧(¬p∨(q ∨¬r))when given input bits p, q,
and r.
6) Show that ¬(p∨(¬p∧q)) and ¬p∧¬q are logically equivalent by developing a series of logical
equivalences
7) Prove that (n+1)3 ≥3n if n is a positive integer with n ≤4.

Unit 2

1) Find the transitive closure of the relation R = {(1, 3), (1, 4), (2, 1), (3,2)} on the set A = {1,
2, 3, 4}.
2) Show that the inclusion relation (⊆) is a partial ordering on the power set of a set S.

3) Let m be an integer with m > 1. Show that the relation

R = {(a,b) | a ≡ b (mod m)} is an equivalence relation on the set of integers.

4) Show that the divisibility relation (∣) is a partial ordering on the set of integers.

5) Let f be the function from{a,b,c,d}to{1,2,3,4}with f(a)=4, f(b)=2, f(c)=1, and f(d)=3. Is f a bijection?

Unit3:

1) Construct a recursive version of a binary search algorithm.

2) Give a big-O estimate for f(n) = n2 log(n3 + 1) + (n3 + 4n2 + 5), where n is a positive integer
3) Construct a recursive merge sort algorithm

4) Let f(x)=anxn + an-1xn-1 + … + a1x + a0, where an, an-1, …, a1, a0 are real numbers. Show f(x)
is O(xn).
5) Write a recursive algorithm for Fibonacci series
 Mid 2 syllabus
Unit 3 (part II)

1) Use mathematical induction to show that 1+2+22 +···+2n =2n+1−1 for all nonnegative integers n.

2) Show that if n is an integer greater than 1, then n can be written as the product of primes

3) prove the theorem If T is a full binary tree T, then n(T ) ≤2h(T )+1−1.

4) Prove that A(m,n+1) > A(m,n) when ever m and n are nonnegative integers.

5) Construct a recursive version of a binary search algorithm

Unit 4
1) prove the theorem Let E1 and E2 be events in the sample space S. Then p(E1∪E2) =
p(E1)+p(E2)−p(E1∩E2).

2) prove

3) What is the expected value of the sum of the numbers that appear when a pair of fair dice is rolled?

4) What is the solution of the recurrence relation an = an−1+2an−2 with a0 =2 and a1 =7?

5) prove the theorem

Unit 5
1) Prove that An undirected graph has an even number of vertices of odd degree.
 2) Prove the HALL’S MARRIAGE THEOREM (or)
The bipartite graph G = (V,E) with bipartition (V1,V2) has a complete matching from V1 to V2 if
and only if|N(A)|≥|A|for all subsets A of V1.
3) a) How many edges does a graph have if its degree sequence is 4, 3, 3, 2, 2? Draw such a
graph.
b) How many vertices does a regular graph of degree four with 10 edges have?

4) Show that if G is a bipartite simple graph with v vertices and e edges, then e ≤v2/4

5) Determine whether the graphs G and H displayed in Figure are isomorphic.

6) Show that a simple graph G with n vertices is connected if it has more than (n−1)(n−2)/2 edges.
7) ORE’S THEOREM If G is a simple graph with n vertices with n ≥3 such that deg(u)+deg(v) ≥ n for
every pair of nonadjacent vertices u and v in G, then G has a Hamilton circuit.
8) Is K3,3, shown in Figure , planar?

9)write the algorithms for inorder,preorder,post order tree traversal techniques

10) use kruskals algorithm to find a minimum spanning tree for the given weighted graph.
B
Sort Answer Questions

MID2 Syllabus(last 2and ½ units)

1)define PRINCIPLE OF MATHEMATICAL INDUCTION

a)To prove that P(n) is true for all positive integers n, where P(n) is a
propositional function, we complete two steps: BASIS STEP: We verify that
P(1) is true. INDUCTIVE STEP: We show that the conditional statement
P(k)→ P(k+1) is true for all positive integers k.

2) what is strong induction?

STRONG INDUCTION To prove that P(n) is true for all positive integers n,
where P(n) is a propositional function, we complete two steps: BASIS
STEP: We verify that the proposition P(1) is true. INDUCTIVE STEP: We
show that the conditional statement [P(1)∧P(2)∧···∧ P(k)]→P(k+1) is true
for all positive integers k.

3) if n is an integer greater than 1, then n can be written as the product of

primes.

4) A simple polygon with n sides, where n is an integer with n ≥3, can be

triangulated into n−2 triangles.
5) define recursive or inductive

a) two steps to define a function with the set of nonnegative integers as its
domain: BASIS STEP: Specify the value of the function at zero.
RECURSIVE STEP: Give a rule for finding its value at an integer from its
values at smaller integers. Such a definition is called a recursive or inductive
definition

6) recursive definitions of sets have two parts, a basis step and a --------------
a) recursive definitions of sets have two parts, a basis step and a recursive
step

7) If T is a full binary tree T, then n(T ) ≤2h(T )+1−1.

8) The reversal of a string is the string consisting of the symbols of the string
in reverse order. The reversal of the string w is denoted by wR.

9) An algorithm is called recursive if it solves a problem by reducing it to an

instance of the same problem with smaller input.

10) If S is a finite nonempty sample space of equally likely outcomes, and E

is an event, that is, a subset of S, then the probability of E is p(E)= |E| |S| .

11) Let E be an event in a sample space S.The probability of the event E = S

−E, the complementary event of E, is given by p(E)=1−p(E).

12) Let E1 and E2 be events in the sample space S. Then p(E1∪E2) =

p(E1)+p(E2)−p(E1∩E2).

13) Let E and F be events with p(F) > 0. The conditional probability of E
given F, denoted by p(E | F), is defined as p(E | F)= p(E∩F)/p(F) .

14) The probability of exactly k successes in n independent Bernoulli trials,

with probability of success p and probability of failure q =1−p, is
C(n,k)pkqn−k.
 15) A random variable is a function from the sample space of an experiment
to the set of real numbers. That is, a random variable assigns a real number
to each possible outcome

16) If k is an integer with k ≥2, then R(k,k)≥2k/2.

17) A directed graph (or digraph) (V,E) consists of a nonempty set of

vertices V and a set of directed edges

18) Two vertices u and v in an undirected graph G are called adjacent (or
neighbors) inG if u and v are endpoints of an edge e of G.

19) An undirected graph has an even number of vertices of odd degree.

20) A complete graph on n vertices, denoted by Kn,

21) A simple graph is bipartite if and only if it is possible to assign one of two different

colors to each vertex of the graph so that no two adjacent vertices are assigned the same

color.

22) HALL’S MARRIAGE THEOREM

Mid1 Syllabus (first 2 and ½ units)

Short answer Questions

A ---------is a declarative sentence that is either true or false, but not both.

------ is a compound proposition that is always true

DeMorgan’s first Law ----------- and second Law--------

---------- is the Modus Pones Rule of inference

Given a set S, the ------- of S is the set of all subsets of the set S.

Idempotent Laws--------,-------------
Cartesian product of A={1,2} and B={a,b,c}is AXB= -----------

A-------consists of a set V of vertices (or nodes) together with a set E of ordered pairs of elements of V
called edges (or arcs)

the recursive definition of the factorial function: n! =-------

------- are used to estimate the number of steps an algorithm uses as its input grows.

The proposition “p if and only if q.” can be represented as ---------------

-------is a compound proposition that is neither a tautology

nor a contradiction

P ٨ (Q V R) <=> (P ٨ Q) V (P ٨ R)-----------law

------is a disjunctive syllogism

Two sets are called -------if their intersection is the empty set.

Absorption Laws--------,-------------

A function is said to be-------if and only if f(a)= f(b) implies that a = b for all a and b in the domain of f.

A relation on a set A is called an ---------relation if it is reflexive, symmetric, and transitive.

Complexity of merge sort is----------

--------provides upper bound for functions