Scribd
Upload
7 views7 pages

Question Bank (COMP)

Uploaded by

aquaruhoshino
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views7 pages

Question Bank (COMP)

Uploaded by

aquaruhoshino
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Unit 1

1. Prove by Induction n>=0


1+a+𝑎2 + ................+ an = (1-𝑎𝑛+1 )/(1- an)
2. Prove that [(p→q) ^ (r→s) ^ (p v r)]→(q v s) is Tautology.
3. Obtain the conjunctive normal form of each of the following:
i) P∧(P→Q)
ii) ~(P ∨ Q)↔(P ∧ Q)
iii) Q ∨ (P∧ ~ Q)∨ (~ P∧~ Q)

4. (i) Given that the value of p-> q is false. Determine the value of (~p ∨ ~q) ∧q.
(ii) Given that the value of p-> q is true. Determine value of ~p∨ (p↔q).
5. Make use of developing a series of logical equivalences to show ~(p V(~p ^ q)) and ~p ^
~q are logically equivalent.
6. Make use of truth table to show (p → r) ∧ (q → r) and (p ∨ q) → r are logically
equivalent.

Unit 2
1. Prove Let X = {1, 2, .... 7} and R = {(x, y) / x–y, is divisible by 3}. Show that R is
equivalence relation. Draw graph of R.

2. Draw Hasse diagram for ({1, 2, 3, 4},≤)


3. Let R be the relation on the set A={a,b,c,d,e,f} and
R={(a,c),(b,d),(c,a),(c,e),(d,b),(d,f),(e,c),(f,d)}. Find the transitive closure of R using
Warshall’s algorithm.
4. Construct the Hasse diagram representing the partial ordering {(a, b) | a divides b} on
{1, 2, 3, 4, 6, 8, 12}.
5. Let A = {a,b,c,d} B = {1,2,3} . Determine whether the relation from A to B is
function. Justify. If it is a function give the range.
1. R= {(a,1), (b,2),(c,1),(d,2)}
2. R = {(a,1),(b,2),(a,2),(c,1),(d,2)}
6. If x={1,2,3,4,5,6,7} and R ={(x,y) | x-y is divisible by 3}. Show that R is an
equivalence relation. Draw the diagraph of R
7. Construct the Hasse diagram representing the partial ordering {(a, b) | a divides b} on
{1, 2, 3, 4, 6,12, 24 }.

Unit 3
1. Find the shortest path between a to z for given graph using Dijkstra’s algorithm
2. Find the number of vertices, the number of edges, and the degree of each vertex in
the given undirected graph G and H. Identify all isolated and pendant vertices.

3. Find the length of a shortest path between a and z in the given weighted graph Using
Dijkstra’s Algorithm

4. Define the following terms


1. Complete graph
2. Bipartite graph
3. Euler path and Circuit
4. Hamalton path and Circuit
5. Planar graph

5. Justify your answer whether following graphs are bipartite graph or not?

6. Construct following graph and find whether graph is planar graph or not? If it is planar
graph then redraw it: i) K3,3 ii) K3,2 iii) K4,4 iv) K4,3 v)K2,3 vi)K3,2

7. Draw the following graph and write down the degree sequence of graph.
i) K5 ii)K4 iii) C4 iv) C5 v) W4 vi) W5 vii) K3,2 viii) K2,3 ix) Q3 x) Q2
8. Apply Dijkstra’s algorithm and find the length of a shortest path between a and z in the
given weighted graph.
9. Partition of the set V(G) into two disjoint sets v1(G) & v2(G) such that each edge of the
graph has its one end in v1(G) & other end in v2(G). Write down whether it is bipartite
graph or not?

10. Apply Dijkstra’s algorithm and find the length of a shortest path between 0 and 6 in the
given weighted graph.

11. Apply Dijkstra’s algorithm and find the length of a shortest path between a and z in the
given weighted graph.

12. Determine the maximum flow in the transport network shown in following figure
Unit 4
1. Explain following tree terminologies :

• Node

• Root

• Parent Node

• Leaf Node

• Children

• Internal node

• Degree of a node

• Degree of a tree

• Level of a tree

• Height of a tree

• Ancestors

• Descendants

• Sibling

2. Make use of concepts of tree and answer following questions with respect to tree shown
below

a) Which vertex is the root?


b) Which vertices are internal?
c) Which vertices are leaves?
d) Which vertices are children of j?
e) Which vertex is the parent of h?
f ) Which vertices are siblings of o?
g) Which vertices are ancestors of m?
h) Which vertices are descendants of b?
i) What is a level of the tree?
j) What is a height of the tree?
3. Construct the minimum spanning tree (MST) for the given graph using Prims and Kruskal’s
Algorithm
4. Construct Huffman tree to encode the following symbols with the frequencies listed: A:
0.08, B: 0.10, C: 0.12, D: 0.15, E: 0.20, F: 0.35. What is the average number of bits used to
encode a character?
5. Construct Huffman tree to encode the following symbols with the frequencies listed: A:
0.07, B: 0.09, C: 0.12, D: 0.22, E: 0.23, F: 0.27. What is the average number of bits used to
encode a character?
6.

7. Construct a binary search tree for input data J ,R ,D,G,W,E,M,H,P,A,F,Q. List a root node,
leaf nodes and interior nodes
8. shows the binary search tree that corresponds to the integer sequence {5, 3, 1, 9, 6,
4}. List a root node, leaf nodes and interior nodes
9. Construct a binary search tree for input data 200,100,300,50,150,250,400,10,75,125,175.
List a root node, leaf nodes and interior nodes.
10. Build the preorder, postorder and inorder traversal of the binary tree as
Unit 5

1. Check whether (Z, X5} is an abelian group where Z = {0,1,2,3,4}


2. Check whether (Z, +6} is an abelian group where Z = {0,1,2,3,4,5}
3. Identify whether (G, *) is an abelian group Consider G be the set of all non zero real
numbers and let a * b = ab / 4
4. Identify whether (G, *) is an abelian group Consider G be the set of all non zero real
numbers and let a * b = ab / 2
5. Explain the steps to identify the algebraic structure (Z,+,*) is a ring
6. Explain the steps to identify field with suitable example.
7. Explain the steps to identify integral domain with suitable example.
8. Explain the steps to identify ring with suitable example.
9. Explain homomorphism and normal subgroups.

10. Make use of (2,6) encoding function e, where e(00) =011010 e(01)= 010101 e(10) =
101101 e(11) = 101100 i) Find the minimum distance of e ii) How many errors will e detect?

11. Make use of (2,5) encoding function e, where e(00) =01000 e(01)= 01010 e(10) =
00101 e(11) = 11110 i) Find the minimum distance of e ii) How many errors will e detect?

12. 9. Make use of (2,6) encoding function e, where e(00) =011000 e(01)= 010110 e(10) =
101011 e(11) = 101000 i) Find the minimum distance of e ii) How many errors will e detect?

13. Make use of (2,5) encoding function e, where e(00) =00000 e(01)= 01110 e(10) =
00111 e(11) = 11111 i) Find the minimum distance of e ii) How many errors will e detect?

You might also like