DIFFRENCE BETWEEN STRUCTURED PROGRAMING AND OBJCET ORIENTED
PROGRAMING.

Answer Posted / abhi

Procedure Oriented Programming
 Importance is given to the sequence of things to be
done i.e. algorithms
 larger programs are divided into functions
 most functions share global data i.e data move
freely around the system from function to function.
 there is no access specifier

 operator cannot be overloaded

 follows top to bottom approach

 Inheritence is not supported
Object Oriented Programming
 Importance is given to the data.

 larger programs are divided into objects
 mostly the data is private and only functions
inside the object can access the data.

 there are public, private and protected specifier.

 operator can be overloaded


 follows bottom to top approach


 Inheritence is supported

Is This Answer Correct ?    1 Yes 2 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

what's the basic's in dot net

1734


What is multilevel inheritance in oop?

552


What do you mean by Encapsulation?

637


program for insertion ,deletion,sorting in double link list

2276


How oops is better than procedural?

581






What is purpose of inheritance?

641


How do you define a class in oop?

624


What is destructor in oop?

617


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

3246


What does no cap mean?

590


Why polymorphism is used in oops?

578


How to improve object oriented design skills?

565


Write a program to reverse a string using recursive function?

1788


What is interface? When and where is it used?

1660


What is the difference between a constructor and a destructor?

608