OOPS Interview Questions
Questions Answers Views Company eMail

What is OOPS and How it is different from Procedural Programming ?

Infosys, HP, Thyrocare,

23 55920

what is meant by files?

Infosys,

4 6625

is java purely oop Language?

HCL, Infosys, TCS,

49 34111


What is Object and Class? What are the differences between them?

5 6791

What is Inheritance, Multiple Inheritance, Shared and Repeatable Inheritance?

L&T, Accenture,

4 14936

What is Method overloading?

5 6310

Can we call a base class method without creating instance?

5 14776

In which cases you use override and new base?

2 5277

You have one base class virtual function how will call that function from derived class?

4 5868

In which Scenario you will go for Interface or Abstract Class?

InfoAxon Technologies,

1 8579

polymorphism means?

BFL,

6 9141

Describe the difference between a Thread and a Process?

Siebel Systems,

11 25222

Describe what an Interface is and how it?s different from a Class.

Spinsys,

7 17953

What is the difference between XML Web Services using ASMX and .NET Remoting using SOAP?

1 6776


Post New OOPS Questions






Un-Answered Questions { OOPS }

How do you achieve runtime polymorphism?

55


What is overriding in oop?

60


is there any choice in opting subjects like 4 out of 7

1224


What is difference between pop and oop?

39


What is stream in oop?

65






Can a varargs method be overloaded?

63


Write a program to implement OOPS concepts such as inheritance, polymorphism, friend function, operator overloading?

3731


Why is there no multiple inheritance?

57


Whats oop mean?

70


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

2044


What are classes oop?

63


What are properties in oop?

66


How is polymorphism achieved?

62


Can abstract class have normal methods?

67


How do you explain polymorphism?

58