Answer / uma sankar pradhan

we use virtual functions to achive dynamic binding
Dynamic binding is establishing relation between the
function call and function definition at run time

Answer / bijal

The virtual function can be allowed in base classes only.
The functions markd Virtual will only be overridable in
derieved classes.
If i m having a function in base class that shud come in
derieved class but i want it to have different behaviour.
This can only be acheived only if base class function is
virtual function.

Answer / td

A pure virtual member function is a member function that the
base class forces derived classes to
provide. Normally these member functions have no
implementation. Pure virtual functions are
equated to zero.
class Shape { public: virtual void draw() = 0; };

Answer / mona kawale

when there are two same classes in derived and base class then at the tym of running programm compiler get confuse about which function should b call first so it call derived class function automatically....but if we wrote base class function as virtual function then compiler will not get confuse.....

What is this interview room ? Is it a class or an object.

3 Answers   CybAge, NSN, Wipro,

---

What is abstraction oop?

0 Answers  

---

Whatis the difference between oop and object based language

3 Answers  

---

what are abstract classes and how they impliment , with example

2 Answers  

---

what is namespace? what are the uses of namespace?

1 Answers  

---

WHEN A COPY CONSTER IS CALL ?

4 Answers  

---

given a set based questions and 5 questions based on it next data sufficiciency questions 2 and 2/3 english sentence completion with options very easy and 2 synononmys paragraph with 10 questions 10 minutes replace =,-,*,% with -,%,+,* type questions 5 3 questions lik following itssickhere itssickthere itssickhere istsickhere which is nt alike the others very easy

0 Answers   DELL,

---

What is oop in simple words?

1 Answers  

---

#include <string.h> #include <stdio.h> #include <stdlib.h> #include<conio.h> void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

0 Answers  

---

what is the use of classes in c++;

2 Answers   HCL,

---

Can destructor be overloaded?

0 Answers  

---

What is the point of oop?

0 Answers  

---