www.android.universityupdates.in | www.universityupdates.in | https://telegram.

me/jntuh

QUESTION BANK: (JNTUH)

DESCRIPTIVE QUESTIONS:
UNIT-I
Short Answer – Questions
S.No Question Blooms Course
taxonomy outcome
level
1 State which of the following sentences are propositions:
i) A triangle contains three lines Analyze 4
ii) x+2 is a positive integer
2 Prove that {(p→q) →r}↔{(~pVq)→r} is a tautology. Analyze 4
3 Define Principal disjunctive normal form & Principal conjunctive
Evaluate 5
normal form
4 Write down the following prepositions in symbolic form and find its
negation:
Understand 2
“All integers are rational numbers and some rational numbers
are not integers”
5 Give an indirect proof for each of the following statements:
i)If m is an even integer,then m+7 is an odd integer Apply 3
ii)If x& y are integers such that xy is odd,then x & y are both odd

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

Long Answer Questions-

S.N Questions Blooms Course

o taxonomy outcome
level
1 Translate the given statements into propositional logic using the
propositions provided:
P: “The message is scanned for viruses”
Q:”The message was sent from an unknown system” Evaluate
5
i) “The message is scanned for viruses whenever the message
was sent from an unknown system.”
ii) “It is necessary to scan the message for viruses whenever it
was sent from an unknown system.”
2 Construct the truth table for the following
a) q↔{(~p) V (~q)} b) [(p Λ q) V(~r)]↔p. Evaluate 5
3 Find the disjunctive normal forms of the following
Find 4
a) (p V q V~q) Λ(p V~p) b) (~p→r) Λ(p↔q)
4 Give a) A direct proof b) An indirect proof and c) Proof by contradiction
for the following statement “ If ‘n’ is an odd integer then n+11 is an even Evaluate 5
integer
5 Prove that [ x,p(x) V x,q(x)] → x,[p(x) Vq(x)] through a counter
Evaluate 4
example. Show that the converse of this is not true.

Unit 2
Short answer questions
S.No Question Blooms Course
taxonomy outcome
level
1 Define Poset and distributive lattice. Analyze 4
2 Consider the following relations on the A={1,2,3}, f={(1,3),(2,3),(3,1)}
Create 6
g={(1,2),(3,1)},h={(1,3),(2,1),(1,2),(3,1)} which of these are functions?
3 Define Homomorphism & Isomorphism Analyze 4
4 Let f & g be functions from R to R defined by f(x)=ax+b and g(x)=1-x+x . 2
Understand 2
If (gof) (x)=9x2-9x+3 , determine a.b
5 5.Consider the sets A={a,b,c} and B={1,2,3} and the relations.
R={(a,1),(b,1),(c,2),(c,3)} and S={(a,1),(a,2),(b,1),(b,2)} from A to Remember 1
B.Determine R͞ ,S͞ ,R∧S,R∧S,R ,Sc c

Long Answer Questions

Blooms
Course
S.No Question taxonomy
outcome
level

1 Let A={1,2,3,4,6} and R be a relation on A defined by aRb if and only

if”a” is a multiple of “b”. Represent the relation R as a matrix and draw its Evaluate 5
digraph.

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

2 Apply 3
Let A={a,b,c,d} R be a relation on A that has the matrix Mr =

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

. Construct the digraph of R and list the in-degrees and out-

degrees of all vertices.

3
Let A={1,2,3} and R={(1,1),(2,2),(3,3)}. Verify that R is an equivalence Evaluate 5
relation.

4
Let A={1,2,3,4,6,8,12} on An define the partial ordering relation R by aRb
iff a/b.
Analyze 4
a) Draw the Hasse diagram for R. b) Write down the relation matrix for
R.

5
Let A ={1,2,3,4,5} and
R={(1,1),(2,2),(3,3),(1,3),(3,4),(3,5),(1,4),(4,4),(1,5),(2,3),(2,4),(2,5),(5,5)}. Analyze 4
Draw the Hasse diagram for R.

6
If A={1,2,3,5,30} and R is the divisibility relation, Prove that (A,R) is a Analyze 5
lattice but not a distributive lattice.

7
For integers m and k ,the Eulerian function E(m,k)=am,k is defined
recursively as follows:

a0,0=1,

am,k=0 for k m 0, Analyze 4

am,k=0 for k<0 ,

am,k=(m-k)am-1,k-1+(k+1)am-1,k for 0 k m-1,Determine the values of am,k

for 1 k m-1.

8
Draw the Hasse diagram for the poset (p(s), ), where s={1,2,3,4}
Analyze 5
i)an =5n ii) an=6n iii)3n+7 iv)an=n(n+2) v) an=n2

9
Obtain the recursive definition for the function f(n)=an in each of the Analyze 4
following cases.

10 Evaluate 5
In a distributive lattice, if a Λb=aΛc and a Vb=aVc , Prove that b=c.

UNIT-3
Short Answer Questions-

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

Blooms
S. Course
Question taxonomy
No outcome
level
1 Prove that if 30 dictionaries in a library contain a total of 61327 pages,
then at least one of the dictionaries must Prove have at least 2045 pages. Analyze 4
2 In how many ways can we distribute 10 identical marbles among 6
Create 6
distinct containers?
3 Find the number of arrangements of the letter TALLAHASSEE which
Evaluate 5
have no adjacent A’s
4 Find the no of positive integers solutions of the equation x1+x2+x3=17 Understan
2
d
5 In how many ways can 20 similar books be placed on 5 different shelves Analyze 4

Long Answer Questions-

S. Question Blooms Course

No taxonomy outcome
level
1 a) Find the value of n so that 2P(n,2)+50=P(2n,2) Evaluate 5
b)Prove that ,for all the integers n,r ,if n+1>r,then P(n+1,r)=( )
P(n,r).
2 Find the coefficient of Apply 3
(i) x9y3 in the expansion of (x+2y)12
(ii) x5y2 in the expansion of (2x-3y)7
3 State and prove The Principle of Inclusion-Exclusion. Evaluate 5
4 Find the number of integer solutions of the equation x1+x2+x3+x4+x5 = 30 Analyze 4
under the constraints x1 >=0 for i=1,2,3,4,5 and further x2 is even and x3 is
odd.
5 In how many ways can we distribute 10 identical marbles among 6 distinct Analyze 4
containers?
6 Solve the recurrence relation an+an-1-6an-2 =0 for n>=2, given that a0 = -1 Analyze 5
and a1 =8.
7 State and prove Pigeon hole principle. Analyze 4
8 State and Prove The Principle of Inclusion-Exclusion. Analyze 5
10 Determine the number of integers between 1 and 300(inclusive) which are Evaluate 5
(i) Divisible by exactly two of 5,6,8, and
(ii) Divisible by at least two of 5, 6, 8.

UNIT-4
Short answer questions

S.No Question Blooms Course

taxonomy outcome
level
1 Find the sequences generated by the following functions : Create 6
i) (3+x)3 ii) 3x3+
2 Find the generating functions for the sequences 12,22,32…….. Create 6
3 Solve the recurrence relation an+1=4an for n given that a0=3. Analyze 4

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

4 The number of virus affected files in a system is 1000 (to start with ) and Analyze 4
this increases 250% every 2 hours. Use a recurrence relation to determine
the no of virus affected files in the system after one day.
5 Tickets numbered 1 to 20 are mixed up and then a ticket is drawn at Analyze 4
random. What is the probability that the ticket drawn has a number which
is a multiple of 3 or 5?

Long answer questions

S.No Question Blooms Course

taxonomy outcome
level
1 .Find the sequence generated by the following functions: Evaluate 5
(i) (3+x)3 (ii) 2x2 (1-x)-1 (iii) (1-x)-1+2x3
(i) (1+3x)-1/3 (v) 3x3+e2x
2 Find the generating functions for the following sequences. Analyze 4
(i)1,2,3,4,------------- (ii) 1,-2,3,-4,---------- (iii) 0,1,2,3,-----------
3 Determine the coefficient of (i) x12 in x3(1-2x)10 (ii) x10 in (x3-5x)/ (1-x)3 Analyze 5
5
(iii) x in(1-2x) -7

4 Solve the recurrence relation an+3-3an+2+3an+1-an =3+5n for n>=0 Analyze 4

2
5 Find a generating function for recurrence relation an+1-an=n ,n>=0 and a0 Analyze 4
=1.Hence solve it.
6 Solve the system of recurrence relations an+1 = 2an+bn for n>= 0, Analyze 5
bn+1 = an+bn for n>= 0, given a0 =1, b0 =0
7 Find the generating functions for the recurrence relations cn =3Cn-1- 2Cn-2 Analyze 4
,n>=2 and C1=5 C2 = 3.
8 Find the generating function for the Fibonacci sequence <Fn> and hence Analyze 5
obtain an expression for Fn.
9 A random variable X has the following probability function Evaluate 6
x 0 1 2 3 4 5 6 7
P(X=x) 0 k 2k 2k 3k k 2 2 k 2 7 k 2 +k

Find (i) the probability that X lies between 0 and 5 (ii) mean of X.

10 A continuous random variable has the p.d.f Evaluate 4

Find mean and variance.

UNIT-5
Short Answer Questions-

S.N Question Blooms Cours

o taxonomy e
level outco
me
1 Define directed graph and directed edge set Apply 3
2 Draw a diagram of the graph G=(V,E) where V={A,B,C,D} , Apply 3
E={(A,B),(A,C),(A,D),(C,D)}

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

3 Define complete bipartite graph and kuratowski’s second graph. Apply 3

4 What is a planar graph? Give examples of planar and non-planar graphs. Apply 3
5 Define a spanning tree Apply 3

Long Answer Questions-

S.No Question Blooms Course

taxonomy outcome
level
1 Let D be the digraph whose vertex set is V={ v1 ,v2,v3, v4, v5 }and the Apply 3
directed edge set is E={(v1,v4),( v2,v3),( v3,v5),( v4,v2), ( v4,v4),( v4,v5),( v5,v1) }
write down a diagram of D and indicate the outdegrees and indegrees of all
vertices.

2 a)Let G be the non directed graph of order 9 such that each vertex has Understand 2
degree 5 or 6. Prove that atleast 5 vertices have degree 6 or atleast 6
vertices have degree 5.
b) Determine the number of edges in:
i) Kn ii) Km,n iii) Pn
3 How many vertices will the following graphs have if they caontain (i) 16 Apply 3
edges and all vertices of degree 4? (ii) 21 edges,3 vertices of degree 4 and
other vertices of degree 3 (iii) 12 edges , 6 vertices of degree 3, and other
vertices of degree <3 ?
4 What is a Hamiltonian Cycle? Draw bipartite graph K3,4 and prove that this Understand 2
graph does not have a Hamiltonian cycle.
5 Show that the compliment of a bipartite graph need not be a bipartite graph Apply 3
6 Let G be a simple graph of order n.if the size of G is 56 and the size of G is Apply 3
18 ,What is n?
7 Prove that a connected graph G remains connected after removing an edge Apply 3
“e” from G if and only if “e” is a part of some cycle in G
8 Show that the complete bipartite graph K3,3 [namely, the kuratowski’s second Apply 3
graph] is non planar
9 Apply 3

Show that the following two graphs shown in Figure 2 are not Isomorphic
10 a) Using depth first search method, determine the spanning tree T for Apply 3
the following graph with e as the root of T.

b) Give an example graph which is Hamiltonian but not Eulerian

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

OBJECTIVE QUESTIONS:
JNTUH:
UNIT-1
Multiple Choice Questions:
1. The binary relation S = f(empty set) on set A = {1, 2, 3} is
i. Neither reflexive nor symmetric
ii. Symmetric and reflexive
iii. Transitive and reflexive
iv. Transitive and symmetric
2. Let A be a set of n(>0) elements. Let Nr be the number of binary relations on A and let Nf be the number
of functions from A to A.
i. Give the expression for Nr in terms of n.
ii. Give the expression for Nf in terms of n.
iii. Which is larger for all possible n, Nr or Nf?
3. Suppose X and Y are sets and |X| and |Y| are their respective cardinalities. It is given that there are exactly
97 functions from X and Y. from this one can conclude th
(GATE )
i. |X| =1, |Y|=97 ii. |X|=97, |Y| = 1 iii. |X|=97, |Y|=97 iv. none of the above
4. Identify the correct translation into logical notation of the following assertion.
Some boys in the class are taller than all the girls.
Note: taller (x,y) is true if x is taller than y.
i. ($x) (boy(x) ® (y) (girl(y) Ù taller (x,y)))
ii. ($x) (boy(x) Ù (y) (girl(y) Ù taller (x,y)))
iii. ($x) (boy(x) ® (y) (girl(y) ® taller (x,y)))
iv. ($x) (boy(x) Ú (y) (girl(y) Ú taller (x,y)))
5. What is the first order predicate calculus statement equivalent to the following ?
Every teacher is liked by some student
i. (x) [teacher(x) ® $(y) [student(y) ® likes (y,x)]]
ii. (x) [teacher(x) ® $(y) [student(y) Ù likes (y,x)]]
iii. $(x) (x) [teacher(x) ® [student(y) Ù likes (y,x)]]
iii. (x) [teacher(x) Ù $(y) [student(y) ® likes (y,x)]]
Fill in the blanks:
1. The contrapositive of p → q is the proposition of ____________
2. __________________ is the converse of the conditional statement “If it ices today, I will play ice
hockey tomorrow.”
3. A compound proposition that is always ___________ is called a contradiction.
4. A compound proposition that is neither a tautology nor a contradiction is called a ___________
5. (A ∧ ¬A) ∧ (q ∧ T) is a __________
6. The statement, “At least one of your friends is perfect”. Let P (x) be “x is perfect” and let F (x) be “x
is your friend” and let the domain be all people in symbolic form as ________
7. _______________ rule of inference is used here?
“It is cloudy and drizzling now. Therefore, it is cloudy now.”
8. The premises (p ∧ q) ∧ r and r → s imply ___________
9. When to proof P→Q true, we proof P false, that type of proof is known as ___________
10. A proof covering all the possible cases, such type of proofs are known as ___________

UNIT-2
Multiple Choice Questions:

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

1. Let X, Y, Z be sets of sizes x,y and z respectively.Let W= X*Y and E be the set of all subsets of W. The
number of functions from Z to E is:
i. Z2xy
ii. Z* 2xy
iii. Z2x+y
iv.2xyz
2. A relation R is defined on ordered pairs of integers as follows:(x,y) R (u,v) if x<u and y>v.Then R is
i. Neither a partial order nor an equivalence relation.
ii. A partial order but a total order
iii. A total order
iv. An equivalance relation
3. Let f : B o C and g: A o B be two functions let h = f o g. Given that h is an onto function which one of
the following is TRUE?
i. f and g should both be onto functions.
ii. f should be onto but g need to be onto
iii. g should be onto but f need not be onto
iv. both f and g need to be onto
4. Consider the binary relation :
S = {(x,y) | y = x + 1 and x, y Î {0, 1, 2}}
i. {(x,y) | y > x and x, y Î {0, 1, 2}}
ii. {(x,y) | y ³ x and x, y Î {0, 1, 2}}
iii. {(x,y) | y < x and x, y Î {0, 1, 2}}
iv. {(x,y) | y £ x and x, y Î {0, 1, 2}}
5. The number of binary relations on a set with n elements is:
i. n2 ii. 2n iii. 2n2 iv. None of the above
Fill in the blanks:
1. If A is {{Φ}, {Φ, {Φ}}}, then the power set of A has _____________ elements
2. Two sets A and B contains a and b elements respectively. If power set of A contains 16 more
elements than that of B, value of ‘b’ and ‘a’ are _______
3. If set A has 4 elements and B has 3 elements then set n(A X B) has ____________
4. 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.
5. Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) = 3x +
4. Then the composition of f and g is ____________
6. The inverse of function f(x) = x3 + 2 is ____________
7. Floor(2.4) + Ceil(2.9) is equal to __________
8. Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a divides b. Number of
edges in the Hasse diagram of is ______
9. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is __________
10. Suppose a relation R = {(3, 3), (5, 5), (5, 3), (5, 5), (6, 6)} on S = {3, 5, 6}. Here R is known as
_________

UNIT-3
Multiple Choice Questions:
1. A multiset is an unordered collection of elements where elements may repeat any number of times. The
size of a multiset is the number of elements in it counting repetitions.
i. What is the number of multisets of size 4 that can be constructed from n distinct
elements so that at least one element occurs exactly twice?
ii.How many multisets can be constructed from n distinct elements?
iii. None of the above

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

2. The number of binary strings of n zeroes and k ones that no two ones are adjacent is
i. n-1Ck ii. nCk iii. nCk+1 iv. None of the above
3. How many 4 digit even numbers have all 4 digits distinct?
i. 2240 ii. 2296 iii. 2620 iv. 4536
4. How many substrings of different lengths(non zero) can be found formed from a character string of
length n?
i. n ii. n2 iii. 2n iv. None of the above
5. In a room containing 28 people, there are 18 people who speak English, 15 people who speak Hindi and
22 people who speak Kannada. 9 persons speak both English and Hindi, 11 persons speak both Hindi and
Kannada whereas 13 persons speak both Kannda and English. How many people speak all three languages?
i. 9 ii. 8 iii. 7 iv. 6
Fill in the blanks:
1. An algorithm is a _________ set of precise instructions for performing computation.
2. In ________ search each element is compared with x till not found.
3. An Algorithm is ___________
4. An algorithm which uses the past results and uses them to find the new results is _________
5. If for an algorithm time complexity is given by O(n) then the complexity of it is ___________
6. _______________ is the base case for the inequality 7n > n3, where n = 3
7. According to principle of mathematical induction, if P(k+1) = m(k+1) + 5 is true then _____ must be true.

UNIT -4
Fill in the blanks:
1. The solution to the recurrence equation T(2 k ) = 3 T(2 k-1 ) + 1, T(1) =1 is
i. 2 k ii. (3 k+1 -1)/2 iii. iv.
2. Express T(n) in terms of the harmonic number H n = , where T(n) satisfies the
recurrence relation, T(n) = , for n ³ 1 and T(1) = 1.-----------
3. Find a solution to the following recurrence equation: T(n) = 1.---------------
4. Solve the recurrence equations:T(n) = T(n) = 1. -------------
5. Solve the recurrence equations T(n) = T(n-1) + n, T(1) = 1. -----------
6. What is the generating function G(z) for the sequence of Fibonacci numbers?
7.A probability density function f(x) for the continuous random variable X is denoted as _______
8.A meeting has 12 employees. Given that 8 of the employees is a woman, the probability that all the
employees are women is ____________
9.____ is the sequence depicted by the generating series 4 + 15x2 + 10x3 + 25x5 + 16x6+∧
10.Generating function for the sequence 1, 6, 16, 216,…. Is _____________
11.Recurrence relation for the sequence 1, 3, 7, 15, 31, 63,…… is ____________
12.The numbers between 1 and 520, including both, are divisible by 2 or 6 is _______
13.In class, students want to join sports. 15 people will join football, 24 people will join basketball, and
7 people will join both. Number of students in the class are __________
14.Let us say that X is a normally distributed variable with mean(μ) of 43 and standard deviation (σ) of
6.4. The probability of X<32 is __________________.
UNIT -5
Multiple Choice Questions:
1. Level order traversal of a rooted tree can be done by starting from the root and performing
i. preorder traversal
ii. in-order traversal
iii depth first search
iv. breadth first search

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

2. How many perfect matchings are there in a complete graph of 6 vertices?

i. 15 ii. 24 iii. 30 iv. 60
3. Let S be a set of n elements {1,2…..,n} and G a graph with 2n vertices, each vertex corresponding to a
distinct subset of S. two vertices are adjacent iff the symmetric difference of the corresponding sets has
exactly 2 elements.
Note: The symmetric difference of two sets R1 and R2 defined as (R1|R2) È (R2|R1).
i. Every vertex in G has the same degree. What is the degree of a vertex in G?
ii.How many connected components does G have?
4. Let G be a connected undirected graph. A cut in G is a set of edges whose removal results in G being
broken into two or more components which are not connected with each other. The size of a cut is called in
cardinality. A min-cut of G is a cut in G of minimum cardinality. Consider the following graph.
(GATE)
5. A graph is planar if and only if,
i. it does not contain sub graphs homomorphic to K5 and K3,3
ii. it does not contain sub graphs isomorphic to K5 or K3,3
iii.it does not contain sub graphs isomorphic to K5 or K3,3
iv. it does not contain sub graphs homomorphic to K5 or K3,3
6. How many distinct binary search trees can be created out of 4 distinct keys?
i. 5 ii. 14 iii. 24 iv. 42

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh