14

The IT giant Tirnop has recently crossed a head count of
150000 and earnings of $7 billion. As one of the forerunners
in the technology front, Tirnop continues to lead the way in
products and services in India. At Tirnop, all programmers
are equal in every respect. They receive identical salaries
and also write code at the same rate. Suppose 14 such
programmers take 14 minutes to write 14 lines of code in
total. How long will in take 5 programmers to write 5 lines
of code in total ?

Question Posted / palash kumar saha

6 Answers
11242 Views
TCS, I also Faced
E-Mail Answers

Answer Posted / palash kumar saha

Is This Answer Correct ?

6 Yes

3 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

What is object in oops?

1066

Prepare me a program for the animation of train

2477

to find out the minimum of two integer number of two different classes using friend function

2139

What is the purpose of enum?

1011

What does sksksk mean in text slang?

2123

Why do while loop is used?

1037

which feature are not hold visual basic of oop?

2195

Advantage and disadvantage of routing in telecom sector

1307

What are the 4 pillars of oop?

1148

Can we create object of abstract class?

1097

What is oops and why we use oops?

1049

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

3761

What is overloading in oop?

1012

What are the 4 main oop principles?

1225

What is coupling in oop?

1032