Answer Posted / karthik raja

I AM KARTHIK, i have completed DCE COMPUTER in MURUGA
POLYTECHNIC COLLEGE in KALAKURICHI.I have done my 12th
standard in Govt Higher Se-country School in Sankarapuram.My
Father Mr. Rajaendran, He is a Former My Mother R.
Periyanayagam, She IS a Home Maker. My Elder Sister Working
in Teacher,I have a younger brother He is Doing ECE in
krishnagiri.My Hobbies Plying Cricket kapadi and Watching TV
and Reading Books. I am very self postitive passion. I am a
Hard worker.

write a program to find 2 power of a 5digit number with out using big int and exponent ?

2388

---

What is abstraction in oops with example?

1300

---

What is a class oop?

1019

---

write knight tour problem which is present in datastructure

2659

---

What are the important components of cohesion?

1026

---

Are polymorphisms mutations?

1169

---

What is overriding vs overloading?

1070

---

Get me a number puzzle game-program

2254

---

What are benefits of oop?

1138

---

What is class and object in oops?

1150

---

What is overriding in oop?

1047

---

What is purpose of inheritance?

1114

---

What are the 4 main oop principles?

1228

---

#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.

3771

---

write a program that takes input in digits and display the result in words from 1 to 1000

2434

---