Question Bank for SP/SS/2G/Additional/Special

NOTE: Each cycle test shall contain six questions and at most four of them
will be from the question bank and remaining questions will be asked from
the syllabus covered in the lectures taken before the corresponding cycle
test.
Cycle Test I (Question No. 1-20)

1. Prove the following p ∨ (q ∧ r ) ⇔ ( p ∨ q ) ∧ ( p ∨ r ) using truth table.

2. Prove the following ((p⇒q) ∧(q⇒r))⇒ (p ⇒ r) is a tautology.
3. Express the following statements using predicates and quantifiers:
a) All humming birds are richly colored.
b) No large birds live on honey.
c) Birds that do not live on honey are dull in color.
d) Humming birds are small.
4. Is the following argument valid?
Smoking is healthy.
If smoking is healthy, then cigarettes are prescribed by physicians.
5. Let n be an integer. Prove that if n2 is odd, then n is odd.
6. Show that 2 is irrational.
7. Prove that 5n + 2(11n) is a multiple of 3 for all positive integers n.
8. Prove the following using mathematical induction:
n(n + 1)(2n + 1)
12 + 22 + 32 + 42... + n2 = .
6
9. Let A1, A2, A3, …, An be any n sets. Show by the mathematical induction
n  n
 =
that  1   A1
A
i =1  i =1
10. Find the f(2), f(3), f(4) if f(n) is defined
recursively by f(0)=3 and for n=0, 1, 2,…
a) f(n+1) = 3 f (n) + 7.
b) f(n+1) = f(n)2 – 2 f(n) – 2.
11. Write the recursive algorithms for the
following problems:

1|Page
 a) Recursive algorithm for computing n!, where n is non-negative integer.
b) Recursive algorithm for computing the greatest common divisor of two
nonnegative integers a and b with a<b.
c) Recursive algorithm for binary search algorithm.
12. Write a short note on program correctness.
13. What is loop invariant? How is a loop
invariant used?
14. Define floor and ceiling functions with examples.
n(n + 1)(2n + 1)
∑ k2 using summation formula ∑ 1 k2 =
100 n
15. Find the value of .
50
6
16. Explain the various basic asymptotic
notations for measuring the complexity of an algorithm.
17. Explain the properties of the relations on a
set.
18. Determine whether the relation R on the set A is reflexive, symmetric, or
transitive, where set A = Z (set of integers); a R b if and only if a+b is
even.
19. Explain the following representations of the
relations:
a) Using Matrices
b) Using Digraphs
20. Explain Warshall’s algorithm.

2|Page
21. Draw the directed graph that represents the
relation {(a,a), (a,b), (b,c), (c,b), (c,d),(d,a),(d,b)}.
22. Find the matrix representing the relations S oR , Where the matrices
representing R and S are
1 0 1 0 1 0
M R = 1 1 0 and M S = 0 0 1 .
 
0 0 0 1 0 1

23. Find the matrix representing the relation R 3, where the matrix
representing R is
0 1 0
M R = 0 1 1
1 0 0

24. What is partial order? Explain with example.

25. Show that the “greater than or equal” relation ( ≥ ) is a partial ordering on
the set of integers.
26. If A = (1, 2, 3, 4). Find the transitive closure
of relation R,
1 0 0 1
1 1 0 0
where R =  .
0 0 1 0
 
0 0 0 1

27. Draw the Hasse diagram representing the

partial ordering {(a,b)|a divide b} on {1, 2, 3, 4, 6, 8, 12}.
28. What is bipartite graph? Explain with
example.
29. Prove that “An undirected graph has an even
number of vertices of odd degree”.
30. Find the adjacency matrix of the following
graph:

3|Page
31. Find the incidence matrix of the following
graph:

32. What do you mean by strongly & weakly

connected graph? Explain with example.
33. Explain the difference between Euler paths
and Hamilton paths with examples.
34. Using Dijkstra’s algorithm finds the path between A and F for the following
graph. Show the intermediate steps also.

35. How you do searching in binary tree? Explain.

36. Explain Huffman coding.
37. What is value of the following postfix
expression?
3 2 * 2 ↑ 5 3 − 8 4 / *−

4|Page
38. Explain the pre-order traversal with proper
example.
39. Explain the in-order traversal with proper
example.
40. Explain the post-order traversal with proper
example.

Assignment for Current Semester

Note:
1. Use A4 size paper only. Write your name, roll number, date of submission
on the front of the assignment file.
2. All work must be individual and in your handwriting.
3. Your must submit before the submission deadline. Late submissions will
not be awarded.
--------------------------------------------------------------------------------------------------------

Solve the final CP4101 two question papers of dated 16.06.2009,

and 23.06.2008 attached in previous years question paper
section.

5|Page
Deadline: 21-05-2011 Total
Marks: 5.0

Previous Years Question Papers

Please find previous years question papers next page

onwards.

6|Page