Answer Posted / akash dilwaria

#iclude<iostream.h>
#nclude<conio.h>
void main()
{
clrscr();
int n;
float sqrt;
cout<<"\n enter the number";
cin>>n;
sqrt=pow(n,0.5);
cout<<"\n square root of a number is="<<sqrt;
getch();
}

What is difference between data abstraction and encapsulation?

1035

---

What is abstraction in oop?

1088

---

What is an example of genetic polymorphism?

1119

---

program for insertion ,deletion,sorting in double link list

2641

---

What is inheritance write a program to show use of inheritance?

1091

---

write a program to find 2^n+1 ?

2019

---

What is encapsulation in oop?

990

---

What is a null tree?

1081

---

What is multilevel inheritance?

1155

---

What are constructors in oop?

1089

---

#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

3702

---

Can abstract class have normal methods?

994

---

What is polymorphism explain its types?

1103

---

what are the different types of qualifier in java?

2219

---

What is a function in oop?

1023

---