Answer Posted / harish saini

verification means are we building right product. for
example at evry stage of product building some constraints
are applied so one can verify that product is building
right.
Validation means the finished product is right i.e its full
filling the user requirement. validation defines that
result producing by system is right.

Get me an image implementation program.

1559

---

Why do while loop is used?

577

---

Write a program to reverse a string using recursive function?

1792

---

Why do we use encapsulation in oops?

522

---

How do you achieve runtime polymorphism?

571

---

---

What does it mean when someone says I oop?

587

---

Write a program to compute for numeric grades for a course. The course records are in a file that will serve as the input file. The input file is in exactly the following format: Each line contains a student's first name, then one space, then ten quiz scores all on one line. The quiz scores are in whole number and are separated by one space. Your program will take it input from this file and sends it output to a second file. The data in the output file will be exactly the same as the data in the input file except that there will be one additional number (of type double) at the end of each line. This number will be the average of the student's ten quiz scores. Use at least one function that has file streams as all or some of its arguments.

2575

---

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

3250

---

Explain virtual inheritance?

682

---

What is polymorphism programming?

605

---

What does and I oop mean in text?

625

---

Is abstract thinking intelligence?

594

---

hi all..i want to know oops concepts clearly can any1 explain??

1681

---

write knight tour problem which is present in datastructure

2164

---

How do you define a class in oop?

628

---