ASSIGNMENT-1

GROUP-1

1. Consider an algebraic system (G,*), where G is the set of all non-zero real numbers and
* is a binary operation defined by a * b =a+b-1. Check if (G,*) is an abelian group?

2. Let R and S be relation on A={1,3,5} be defined by xRy iff y= x+2 and xRy iff x≤y . Find
(a) R° S (b) S° R (c) Is R° S = S° R?

3. State and prove De Morgan’s Law for Union and Intersection.

4. Let H be a subgroup of a group G. If x, y ∈ G show that either xH ∩ yH = φ or xH = Yh.

5. Show that the relation R in the set of integers Z given by R= {(a, b): 2 divides a-b} is an
equivalence relation.
6. Consider the following collection of subsets of a set S = {1,2,3,4,5,6,7,8,9}
(i) { {1 , 2 ,3 } , { 4 , 5 ,6 } ,{6 ,7 ,8 ,9 }}
(ii) { {1 , 2 ,3 } , { 4 , 5 ,6 ,7 } , {8 ,9 }}
(iii) { {1 , 2 ,3 , 4 } , { 5 ,6 } ,{6 ,7 }, {8 , 9 }}
(iv) { {1 , 2 ,3 } , { 4 , 5 } ,{6 , 7 , 8}, {8 , 9 }}

Which of above is not partition of S and why?

7. Consider the set X = .then proves that X is an abelian group under

addition modulo 6.

ASSIGNMENT - II
Group-1

1. Solve the recurrence relation a n−8 an−1+ 16 an−2=n.5 n, with initial condition a 0=1 , a1=−2
2. Find the generating function from the recurrence relation
S(n -2) = S(n – 1) + S(n), where S(0) = 1, S(1) = 1 , n ≥ 0.
3. Prove by Mathematical induction that x- y divides xn – yn for n ≥1.
4. Prove the validity of following arguments using truth tables
“If the market is free then there is no inflation. If there is no inflation then there are price controls.
Since, there are price controls, therefore the market is free.”
 GROUP-2
2
1. Solve the recurrence relation a n+2−an+1−an=n
2. Find the generating function from the recurrence relation given by
S(K) – 6 S( K – 1) + 5 S(K – 2) = 0, where S(0) = 1, S(1) = 2.

3. Which of the following expressions are not tautologies

(i) ((a→b) ʌ (b →c))→(a→c)

(ii) (a↔c) → (∼b→ (a ʌ c))
(iii) (a ʌ b ʌ c)→(a∨c)
(iv) a→(b→a)
4. Show by Mathematical induction that is divisible by 43 for each positive
integer

GROUP-3

1. Prove that ( p ⋀ ( p → q ) )→ q is tautology

2. Show that 12 + 32 + 52 +………+ (2n – 1)2 = , by mathematical induction.

3. Solve S(k) – S(k – 1) - 12 S(k – 2) = (1+ k)(4)k

4. Consider the following argument and determine whether it is valid

“Either I will get good marks or I will not graduate. If I will not graduate I will go to Canada. I get good
marks. Thus I would not go to Canada.

5.
Solve the following recurrence relation Q(J) – Q(J – 1) – 12Q(J – 2) = ( -3)J + 6 . 4J

ASSIGNMENT - III

Group -1
Q.1. State and Prove Euler’s Formula.

Q.2 Prove that following are equivalent for graph G:

(i) G is 2 colorable
(ii) G is Bipartite
(iii) Every cycle of G has even length
Q.3 Determine the minimum spanning tree of the weighted graph by using Kruskal’s
algorithm

Q.4 Find the length of shortest path from A to F using Dijkstra’s Algorithm

Group -2

1. Determine the minimum spanning tree of the weighted graph by using Kruskal’s algorithm
4. Explain proper coloring and chromatic number with example.

GROUP - 3

1. Impliment Dijkstra Algorithm to find shortest path from node 0 to 5. Also label all the nodes.

3. Write the steps of preorder traversal, postorder traversal and inorder traversal and determine the
preorder ,postorder and inorder traversal of the binary tree.

2 3

5 7 8

6
 9 10

11

4.

Explain the following with examples

(i) Connected and Complete graph
(ii) Simple graph, Multi graph, Pseudo graph
(iii) Bipartite graph and Regular graph

GROUP – 4

1. Explain colouring and chromatic number in the graph. Give example also.

2. Discuss the Hamiltonian path and circuit. Find the Hamiltonian circuit in the given graph
below

b c

e d

3. Use Dijkstra Algorithm to determine distance from A to all the vertices of the weighted graph. Find
shortest path from A to Z by labeling all the nodes.

4. Define level of a node and height of a tree with example.

 GROUP - 5

1. Draw undirected graph of k 3∧k 5. Verify whether they are planar or not by using properties.
2. Prove that any graph with n vertices and n-1 edges is a tree.
3. Give an example of a graph that has neither an Eulers circuit nor Hamiltonian circuit
4. Find the minimum spanning tree of the leveled connected graph as shown