You are on page 1of 4

Institute of Technology, Korba

Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Unit-1 Que1. What is monoid? Que2. Let (A,*) be a semi group. Furthermore, for every a and b in a A , if a!=b then a*b!=b*a (a) Show that for every a in A a*a=a (b) Show that for every a,b in A a*b*a=a (c) Show that for every a,b,c in A a*b*c=a*c Que3. Determine whether a semi group with more than one idempotent element can be group. Que4. Let S={0,1,2,3,4,5,6,7} and multiplication modulo 8, that is xy=(xy)Mod8 (1) prove that ({0,1},) is not a group (2) Write three distinct groups (G,)where GS and G has 2 elements. 4 8

Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Unit-1 Que1. What is monoid? Que2. Let (A,*) be a semi group. Furthermore, for every a and b in a A , if a!=b then a*b!=b*a (d) Show that for every a in A a*a=a (e) Show that for every a,b in A a*b*a=a (f) Show that for every a,b,c in A a*b*c=a*c Que3. Determine whether a semi group with more than one idempotent element can be group. Que4. Let S={0,1,2,3,4,5,6,7} and multiplication modulo 8, that is xy=(xy)Mod8 (1) prove that ({0,1},) is not a group (2) Write three distinct groups (G,)where GS and G has 2 elements. 4 8

8 8

8 8

Institute of Technology, Korba Institute of Technology, Korba


Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Unit-1 Que1. What is monoid? Que2. Let (A,*) be a semi group. Furthermore, for every a and b in a A , if a!=b then a*b!=b*a (a) Show that for every a in A a*a=a (b) Show that for every a,b in A a*b*a=a (c) Show that for every a,b,c in A a*b*c=a*c Que3. Determine whether a semi group with more than one idempotent element can be group. Que4. Let S={0,1,2,3,4,5,6,7} and multiplication modulo 8, that is xy=(xy)Mod8 (1) prove that ({0,1},) is not a group (2) Write three distinct groups (G,)where GS and G has 2 elements. 4 8

Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Unit-1 Que1. What is monoid? Que2. Let (A,*) be a semi group. Furthermore, for every a and b in a A , if a!=b then a*b!=b*a (d) Show that for every a in A a*a=a (e) Show that for every a,b in A a*b*a=a (f) Show that for every a,b,c in A a*b*c=a*c Que3. Determine whether a semi group with more than one idempotent element can be group. Que4. Let S={0,1,2,3,4,5,6,7} and multiplication modulo 8, that is xy=(xy)Mod8 (1) prove that ({0,1},) is not a group (2) Write three distinct groups (G,)where GS and G has 2 elements. 4 8

8 8

8 8

Institute of Technology, Korba

Unit-2
Que1. What is a graph? 2

Que2.

Que2.

Find shortest path between a to z in the graph Que3. Prove that the maximum nuber of nodes on level n of a binary tree is 2n where n>0 Que4. Prove that in a binary tree, if nE is the number of external nodes of leaves and n1 is the no. of internal nodes then nE = n1+1

8 8

Find shortest path between a to z in the graph Que3. Prove that the maximum nuber of nodes on level n of a binary tree is 2n where n>0 Que4. Prove that in a binary tree, if nE is the number of external nodes of leaves and n1 is the no. of internal nodes then nE = n1+1

8 8

Unit-2
Que1. What is a graph? Que2. 2 8 Que1. What is a graph? Que2.

Unit-2
2 8

Find shortest path between a to z in the graph Que3. Prove that the maximum nuber of nodes on level n of a binary tree is 2n where n>0 Que4. Prove that in a binary tree, if nE is the number of external nodes of leaves and n1 is the no. of internal nodes then nE = n1+1

8 8

Find shortest path between a to z in the graph Que3. Prove that the maximum nuber of nodes on level n of a binary tree is 2n where n>0 Que4. Prove that in a binary tree, if nE is the number of external nodes of leaves and n1 is the no. of internal nodes then nE = n1+1

8 8

Unit-2
Que1. What is a graph? 2

Institute of Technology, Korba


Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Que1. Que2. Que3. Que4. Que5 Unit-1 What is a constructor?. Explain function overloading with example Explain different constructors. Explain operator overloading with example What is destructor function? How does it work ? 2 9 9 9 9

Institute of Technology, Korba


Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Que1. Que2. Que3. Que4. Que5 Unit-1 What is a constructor?. Explain function overloading with example Explain different constructors. Explain operator overloading with example What is destructor function? How does it work ? 2 9 9 9 9

Institute of Technology, Korba


Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Que1. Que2. Que3. Que4. Que5 Unit-1 What is a constructor?. Explain function overloading with example Explain different constructors. Explain operator overloading with example What is destructor function? How does it work ? 2 9 9 9 9

Institute of Technology, Korba


Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Que1. Que2. Que3. Que4. Que5 Unit-1 What is a constructor?. Explain function overloading with example Explain different constructors. Explain operator overloading with example What is destructor function? How does it work ? 2 9 9 9 9

Institute of Technology, Korba


Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Que1. Que2. Que3. Que4. Que5 Unit-1 What is a constructor?. Explain function overloading with example Explain different constructors. Explain operator overloading with example What is destructor function? How does it work ? 2 9 9 9 9

Institute of Technology, Korba


Mid Term Examination-2012-II Note:- 1. Que 1 is compulsory attempt any two from remaining question of each unit. 2. No additional supplementary will be given.
Que1. Que2. Que3. Que4. Que5 Unit-1 What is a constructor?. Explain function overloading with example Explain different constructors. Explain operator overloading with example What is destructor function? How does it work ? 2 9 9 9 9

Unit-2
Que1. Que2. Que3. Que4. Que5. What is inheritance? Explain single inheritance with example. Explain this pointer. Explain the difference between multiple and multilevel inheritance. Discuss the concept of pointer to object. 2 9 9 9 9 Que1. Que2. Que3. Que4. Que5.

Unit-2
What is inheritance? Explain single inheritance with example. Explain this pointer. Explain the difference between multiple and multilevel inheritance. Discuss the concept of pointer to object. 2 9 9 9 9

. . Unit-2
Que1. Que2. Que3. Que4. Que5. What is inheritance? Explain single inheritance with example. Explain this pointer. Explain the difference between multiple and multilevel inheritance. Discuss the concept of pointer to object. 2 9 9 9 9

. . Unit-2
Que1. Que2. Que3. Que4. Que5. What is inheritance? Explain single inheritance with example. Explain this pointer. Explain the difference between multiple and multilevel inheritance. Discuss the concept of pointer to object. 2 9 9 9 9

. Unit-2
Que1. Que2. Que3. Que4. Que5. What is inheritance? Explain single inheritance with example. Explain this pointer. Explain the difference between multiple and multilevel inheritance. Discuss the concept of pointer to object. 2 9 9 9 9

. Unit-2
Que1. Que2. Que3. Que4. Que5. What is inheritance? Explain single inheritance with example. Explain this pointer. Explain the difference between multiple and multilevel inheritance. Discuss the concept of pointer to object. 2 9 9 9 9

You might also like