Answer Posted / ayesha

#include <graphics.h>
#include <stdlib.h>
#include <stdio.h>
#include <conio.h>
#include<iostream.h>
class set
{
private:
int array1[5],array2[5],num1,num2,array3[11];
public:
set();
void manu();
void creatset();
void insert();
void deleteword();
void showelement();
void unionset();
void intersection();
void isequal();
};
set::set(){

for(int i=0;i<=10;i++){
array1[i]=0;
}
}
void set::manu(){
cout<<"---------------------------WELCOME TO INTEGER
SETCLASS--------------------------"<<endl;
cout<<"\t\t\t1.creat set"<<endl;
cout<<"\t\t\t2.insert element"<<endl;
cout<<"\t\t\t3.delete element"<<endl;
cout<<"\t\t\t4.show element"<<endl;
cout<<"\t\t\t5.union"<<endl;
cout<<"\t\t\t6.intersection"<<endl;
cout<<"\t\t\t7.is equql"<<endl;
cout<<"\t\t\t8.exit"<<endl;
}
void set::creatset(){
cout<<"enter 5 numbers set A"<<endl;
cin>>num1;
cout<<"SetA={";
for(int i=0;i<5;i++){

array1[i]=getche();

cout<<",";
}
cout<<"}" <<endl;

cout<<"enter 5 number of integers set B"<<endl;
cin>>num2;
cout<<"setB={";
for(int j=0;j<5;j++) {
array2[j]=getche();
cout<<",";
}
cout<<"}"<<endl;
} //end set input
void set::unionset(){
for(int i=0;i<5;i++){
array3[i]=array1[i];
}
for(int j=0;j<5;j++){
array3[j+5]=array2[j];
}
for(int k=0;k<=11;k++)
{

cout<<array3[k];
}

}
void main(){

clrscr();
set p;
char choice;
while (1){
p.manu();
cout << "Enter the option=";
cin >> choice;
switch (choice){
case '1':

p.creatset();
break;
/*
case 'S':

p.carParked();

break;*/
case '5':

p.unionset();
break;

case'8':
exit(0);
break;
default:
break;
}

}




getch();
}


kisi ny nhe help kii mai ny khud hi kar dia

What is cohesion in oop?

624

---

#include #include #include #include void select(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); select(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void select(char *items, int count) { register int a, b, c; int exchange; char t; for(a = 0; a < count-1; ++a) { exchange = 0; c = a; t = items[ a ]; for(b = a + 1; b < count; ++b) { if(items[ b ] < t) { c = b; t = items[ b ]; exchange = 1; } } if(exchange) { items[ c ] = items[ a ]; items[ a ] = t; } } } design an algorithm for Selection Sort

2068

---

How does polymorphism work?

635

---

What is overloading and its types?

615

---

Can we override main method?

607

---

---

What is inheritance in oop?

604

---

what type of question are asked in thoughtworks pair programming round ?

1762

---

what is the drawback of classical methods in oops?

2920

---

What is polymorphism in oop example?

515

---

What is abstraction example?

624

---

Why is encapsulation used?

577

---

What is a superclass in oop?

671

---

What are functions in oop?

586

---

What do you mean by Encapsulation?

642

---

Why can't we have instance(stack) of a class as a member of the same class like eg.Class A{A obj;} as we can have self refential pointer

1621

---