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

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.

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 ...

Travel Sales Man Problem (TSP) and Solution using Dynamic Programming

Given a graph of n vertices, determine the minimum cost path to start at a given vertex and travel to each other vertex exactly once, returning to the starting vertex. In some versions, the starting and ending points are different and fixed, and all other points have to be visited exactly once from start to end. A standard way to solve these problems is to try all possible orders of visiting the n points, which results in a run-time of O(n!). To calculate cost using Dynamic Programming, we need to establish recursive relation in terms of sub-problems. Let us define a term C(S, i) be the cost of the minimum cost path visiting each vertex in set S exactly once, starting at 1 and ending at i. We start with all subsets of size 2 and calculate C(S, i) for all subsets where S is the subset, then we calculate C(S, i) for all subsets S of size 3 and so on. Note that 1 must be present in every subset. So the algorithm is like below - If size of S is 2, then S must be {1, i}, C(S, ...

Refer My Notes

Search This Blog