Answer Posted / sujan

#include<iostream>
#define bit 32
using namespace std;

int array[bit];

int bitConvert(int n)
{
int a,j=0;

a=n%2;
for(int i=bit;i>=0;i--)
{
n=n/2;
array[i]=a;
a=n%2;
}
for(int i=0;i<=bit;i++)
{
cout<<array[i];

}
}
int countBit(int a[])
{
int *ptr;
ptr=a;
int j=0;
for(int i=0;i<=bit;i++)
{

if(*ptr==1)
{
j++;
}
ptr++;
}
cout<< j;
}

int main()
{
int n;
cout<<"Enter the no:";
cin>>n;
cout<<"\n"<<"BitConversion of "<<n<< "is:";
bitConvert(n);
cout<<endl<<endl;
cout<<"\n"<<"No. of bit:";
countBit(array);
system("pause");
}

program explaining feautures of c++

2496

---

What is the disadvantage of using a macro?

1177

---

Differentiate between realloc() and free().

1102

---

Write about all the implicit member functions of a class?

1120

---

What is the use of dot in c++?

1130

---

What is function overriding in c++?

1112

---

What are enumerations?

1148

---

What is the use of endl?

1032

---

Explain selection sorting?

1130

---

Explain the static storage classes in c++.

1328

---

Does c++ have a hash table?

1048

---

What is friend class in c++ with example?

1119

---

What is recursion?

2380

---

What data structure is fastest, on average, for retrieving data: a) Binary Tree b) Hash Table c) Stack

1127

---

Write about the stack unwinding?

1119

---