Skip to main content

Term plan vs Endowment plan insurance

Most people have in dilemma while deciding the insurance plan. It is bit confusing which one to choose. We need to know first what are these plans and what are their features.

We can understand these with below one line description-
Term plan = Pure insurance plan
Endowment plan = investment + insurance

Both have their advantages and disadvantage over one.

1) Premium and coverage: term plan have lesser premium than endowment plan and life cover amount is also too more than endowment plan. Endowment plan's premium cost more and it have lesser life coverage amount.

2) Maturity Benefit: The only benefit of endowment plan is that you get a certain guaranteed amount at the time of maturity that is why it is kind of investment. You will not get any maturity amount in case of term plan insurance but in case of unfortunate demise of insurgents, nominees will get a large amount cover.

Most people prefer term insurance plan over endowment plan. One can save and invest the remaining premium of endowment plan and earn more return.

Comments

Popular posts from this blog

StackOverFlowError and OutOfMemoryError in java

There are two area inside java virtual machine's memory the heap and the  stack . The  stack  memory is used to store local variables and function call while heap memory is used to store objects in  Java The most common cause of StackOverFlowError is too deep or infinite recursion or many local objects / variables creation inside function call in  Java.  According to the java source documentation,  Java throws  java.lang.StackOverflowError   when a stack overflow occurs because an application recurses too deeply. JVM has a given memory allocation for each stack of each thread, and if an attempt to call a method happens to fill this memory, JVM throws an error. Just like it would do if we try to write at index N of an array of length N.  The point to be noted here is that - These are errors not an exceptions. No memory corruption happens due to the error. Stack can not write into the heap space. A StackOverflowError i...

Job Sequencing with Deadlines

Given a set of n jobs Each job i has an integer deadlines di>=0 and a profit pi>0 All jobs requires only one unit time to complete Only one machine is available for processing jobs For job i the profit pi is earned if the job is completed by its deadline.