Answer Posted / svlsr2000

Functions are boud to there address so that they could be
executed. if the address of the functions are known durning
compile time the compiler binds it, this kind of binding is
known as compile time binding or early binding. Where as
when we dont know which function needs to be exucuted
during compile time (as in case of dynamic polymorphism),
compiler uses mechaninsm of virtual table and binds the
function address during runtime. this is known as runtime
binding or late binding.

What is polymorphism oop?

1008

---

write a program to enter a string like"sunil is a good boy and seeking for a job" not more than 10 characters including space in one line,rest characters should b in other line.if the next line starts from in between the previous word,then print whole word to next line.

2189

---

What is object and class in oops?

1004

---

They started with the brief introduction followed by few basic C++ questions on polumorphism, inheritance and then virtual functions. What is polymorphims? How you will access polymorphic functions in C? How virtual function mechanism works?

1864

---

What are different types of JVM's? for example we use dalvik jvm for android then what about the remaining operating systems?

2079

---

What is multilevel inheritance in oop?

971

---

why reinterpret cast is considered dangerous?

2336

---

Why do we use class in oops?

914

---

Is html an oop?

1000

---

What is difference between abstraction and encapsulation?

1019

---

officer say me - i am offered to a smoking , then what can you say

2044

---

What is meant by oops concept?

990

---

What is abstraction in oop with example?

1061

---

write a program that takes input in digits and display the result in words from 1 to 1000

2370

---

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

2564

---