Answer Posted / kanishka sukumar

select 2 random groups of 3 balls and after weighing them
1.if equal
the one not weighed is heaviest
else
measure any 2 balls of the heavier group
2. if equal
the one not weighed is heaviest
else
the heavier one is the heaviest

Explain the concepts involved in Object Oriented programming.

618

---

What is oops in simple words?

570

---

What is encapsulation in oops?

527

---

What is super in oop?

586

---

if i have same function with same number of argument but defined in different files. Now i am adding these two files in a third file and calling this function . which will get called and wht decide the precedence?

2742

---

---

What does sksksk mean in text slang?

1494

---

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?

1625

---

Which method cannot be overridden?

568

---

What is ambiguity in inheritance?

615

---

What is Difference Between Inheritance and creating object and getting data? means Class A extends B{ B.getMethod();} (OR) Class A{ b obj=new B(); obj.getMethod(); }

1971

---

Can you explain polymorphism?

571

---

What is the fundamental idea of oop?

622

---

#include #include #include #include void select(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); select(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void select(char *items, int count) { register int a, b, c; int exchange; char t; for(a = 0; a < count-1; ++a) { exchange = 0; c = a; t = items[ a ]; for(b = a + 1; b < count; ++b) { if(items[ b ] < t) { c = b; t = items[ b ]; exchange = 1; } } if(exchange) { items[ c ] = items[ a ]; items[ a ] = t; } } } design an algorithm for Selection Sort

2055

---

What is polymorphism and why is it important?

548

---

what are the different types of qualifier in java?

1829

---