sir time bohat kam hai. please jaldi se solution de dain. thanks a lot of.
GDB Topic Dated: Jul 01, 11View more random threads:
- MCM515 GDB Idea Solution Spring 2011
- cs506 GDB IDEA SOLUTION Spring 2011
- MGMT603 Strategic Management GDB 2 on 26th May Spring 2011
- CS408 Human Computer Interaction GDB No. 1 Spring 2014 Last...
- need cs501 & cs502 gbd
- MTH101 - Calculus And Analytical Geometry GDB Announcement...
- CS615 Software Project Management GDB No. 1 Spring 2014...
- CS201 Introduction to Programming GDB No.1 Solutions and...
- MGT401 GDB 2 Spring 2011 idea Solution June 2011
- MGT502 Organizational Behavior GDB No.1 Solution Spring...
Dear Student,
Below is a topic for GDB.You are required to submit your discussion in a mentioned time and duration. Please make sure that your reply should be very precise and to the point.
GDB will remain open for two consecutive working days. For this you have choice to post your comments from 8th July to 11th July.
Sponsored Links
Topic is as follows:
You know that Polymorphism is an important feature of OOP. Let’s suppose you a programmer and you are given any particular task to code and that task demands more efficient usage of system resources. For this, you have a choice to implement this particular task by using “Static polymorphism” or Dynamic Polymorphism”.
Give your opinion in three to five concrete points in favor or against of anyone technique of Polymorphism that you will use.
sir time bohat kam hai. please jaldi se solution de dain. thanks a lot of.
Dynamic polymorphism refers to an entity changing its form depending on the circumstances.
A function is said to exhibit dynamic polymorphism when it exists in more than one form, and calls to its various forms are resolved dynamically when the program is executed.
The term late binding refers to the resolution of the functions at run-time instead of compile time. This feature increases the flexibility of the program by allowing the appropriate method to be invoked, depending on the context.
Static polymorphism is considered more efficient and dynamic polymorphism more flexible.
Statically bound methods are those methods that are bound to their calls at compile time. Dynamic function calls are bound to the functions during run-time. This involves the additional step of searching the functions during run-time. On the other hand, no run-time search is required for statically bound functions.
As applications are becoming larger and more complicated, the need for flexibility is increasing rapidly. Most users have to periodically upgrade their software, and this could become a very tedious task if static polymorphism is applied. This is because any change in requirements requires a major modification in the code. In the case of dynamic binding, the function calls are resolved at run-time, thereby giving the user the flexibility to alter the call without having to modify the code.
To the programmer, efficiency and performance would probably be a primary concern, but to the user, flexibility or maintainability may be much more important.
The decision is thus a trade-off between efficiency and flexibility.
There are currently 1 users browsing this thread. (0 members and 1 guests)