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

Optimal Binary Search using Dynamic Programming

An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum. If the probabilities of searching for elements of a set are known from accumulated data from past searches, then Binary Search Tree (BST) should be such that the average number of comparisons in a search should be minimum. eg. Lets the elements to be searched are A, B, C, D and probabilities of searching these items are 0.1, 0.2, 0.4 and 0.3 respectively. Lets consider 2 out of 14 possible BST containing these keys. Figure 1 Figure 2 Average number of comparison is calculated as sum of level*probability(key element) for each element of the tree. Lets the level of tree start from 1. Therefore, for figure 1 - Average number of comparison = 1*0.1 +2*0.2 +3*0.4 +4*0.3 = 2.9 ...

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.

Knapsack Problem and Solution using Dynamic Programming

The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible Given a knapsack of capacity m and number of items n of weight w1, w2, w3 ... , wn with profits p1, p2, p3..., pn. Let x1,x2,...,xn is an array that represents the items has been selected or not. If the item i is selected, then xi = 1 If the item i is not selected then x i = 0 In 0/1 knapsack, the item can be selected or completely rejected. The items are not allowed to be broken into smaller parts. The main objective is to place the items into the knapsack so that maximum profit is obtained or find the most valuable subset of items that fits into the knapsack. Constraints: The weight of the items chosen should not exceed the capacity of knapsack. Obj...

Refer My Notes

Search This Blog