Interested to Buy Any Domain ? << Click Here >> for more details...
What is data binding?
- 4 Answers
- 28006 Views
- Ittiam Systems, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / siva
data are wrapped in a single unit which is calld class.The
above process is calld data binding.There are two types of
bindings:1)static binding 2)dynamic binding.
| Is This Answer Correct ? | 42 Yes | 10 No |
Answer / dhananjay
in c++, data binding refers to make the data/variables and
functions which operate on these data into a single unit.
in c++ the unit is class.
| Is This Answer Correct ? | 23 Yes | 2 No |
Answer / sathiya
data's are grouped together is called data binding which is
binding the data
| Is This Answer Correct ? | 4 Yes | 20 No |
wht is ditch
What are virtual classes?
why in java first invoke public static void main(String args[]) method????Why not public static void method1(String args[])??
What is polymorphism in oops with example?
What is command routing in MFC
What is polymorphism oop?
Advantage and disadvantage of routing in telecom sector
oops concept is used for?
What is interface in oop?
#include <stdio.h> #include <alloc.h> #include <stdlib.h> #include <conio.h> 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.
What is abstract class in oops?
What type of loop is a for loop?
STL 
