Answer Posted / sujai cn

#include <iostream>
#include <math.h>
#include<conio.h>
using namespace std;

void main()
{
int num = 0;
int ReverseNumber(int num);
int RemoveDuplicateDigits(int num);
int ReverseOfInput = 0;
cout<<"Please enter the number\n";
cin >> num;
ReverseOfInput = ReverseNumber(num);
cout<<"The number after removing duplicate digits is "
<< ReverseNumber(RemoveDuplicateDigits(ReverseOfInput)) ;
getch();
}

int ReverseNumber(int num)
{
int revnum = num;
int nodigits = 0;
int rem = 0;
while(revnum > 0)
{
nodigits ++;
revnum = revnum / 10;
}

revnum = 0;
nodigits --;
while(num > 0)
{
rem = num % 10 ;
revnum = revnum + rem * (int) (pow (10 ,nodigits));
nodigits --;
num = num / 10;
}

return revnum;
}

int RemoveDuplicateDigits(int num)
{

int resnum = 0;
bool digis[10] = {false , false ,false ,
false ,false , false ,false , false , false , false};
int power = 0;
int rem = 0;

while (num > 0)
{
rem = num % 10 ;
if(digis[rem] == false)
{
resnum = (int)(resnum + rem * pow(10 , power));
power++;
digis[rem] = true;
}
num = num / 10 ;
}

return resnum;
}

What does and I oop and sksksk mean?

1109

---

What is difference between data abstraction and encapsulation?

1035

---

What is oops concept with example?

971

---

What is class and example?

1093

---

What is abstraction in oop with example?

1064

---

What is a class in oop?

1048

---

Why do we use class?

1027

---

Which language is not a true object oriented programming language?

1063

---

What type of loop is a for loop?

1051

---

Can private class be inherited?

1122

---

What does <> mean pseudocode?

1116

---

What is the benefit of oop?

999

---

What are functions in oop?

999

---

#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

2496

---

How is polymorphism achieved?

1002

---