Answer Posted / ankit samal

1. Procedural languages enforce sequential processing
of instructions. Object oriented languages may implement
event driven processing.
2. Procedural languages store all data as global while
OOPs languages support data encapsulation -- all related
data is stored inside one object and only relevant data is
shown to the user.

Procedure Oriented Language: It follows the a procedure
that is simply saying it will go line by line in the code
unless if u mentioned any goto are any code breaking
keywords.

Object Oriented Language: In this each and every program is
called as Object. that is simply saying we will breake the
code in to small pieces and we will call the code when we
want.

What is a class in oop?

1057

---

write knight tour problem which is present in datastructure

2606

---

String = "C++ is an object oriented programming language.An imp feature of oops is classes and objects".Write a pgm to count the repeated words from this scenario?

2345

---

write a code for this:trailer recordId contains a value other than 99, then the file must error with the reason ‘Invalid RECORD_ID’(User Defined Exception).

2108

---

Why do while loop is used?

985

---

• What are the desirable attributes for memory managment?

2174

---

What is polymorphism what is it for and how is it used?

978

---

Write A Program to find the ambiguities in Multiple Inheritance? How are they resolved.(Virtual Functions)

4092

---

Can we define a class within the interface?

991

---

What is coupling in oop?

978

---

Question: Write a program that prints a paycheck. Ask the program user for the name of the employee, the hourly rate, and the number of hours worked. If the number of hours exceeds 40, the employee is paid “time and a half”, that is, 150 percent of the hourly rate on the hours exceeding 40. Be sure to use stepwi se refine ment and break your solution into several functions. Use the int_name function to print the dollar amount of the check.

1177

---

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

3711

---

Are polymorphisms mutations?

1112

---

INSTANCE FIELDS DECLARED private ARE ACCESSIBLE BY THE METHODS ONLY.CAN WE CHANGE THE private FIELD OF AN OBJECT IN A METHOD OF SOME OTHER OBJECT OF THE SAME CLASS?

2155

---

Write a program to sort the number with different sorts in one program ??

2330

---