Skip to main content

5 Important things to keep in mind for PPF and EPF








EPF deduction from salary comes under 80c section and there are limit of 1.5 lacks that you can show under 80c section and save tax. Most of the salaried employee invest in PPF account. These are the most important point we should keep in mind for better returns.

1) if you are thinking to invest lumpsum amount in PPF, try to invest in as early as possible after the start of new financial year. This will help you in getting rid of last moment hurdle and fetch more return.

2) Do invest before or by 5th of every month. Interest calculation happens for the month on the amount available on 5th of every months. In this case you will get interest for the month. If you deposit after 5th, you will loose interest for the remaining days of that month and interest calculation will only happen after next month on the deposited amount.

3) If you don't have UAN number for EPF account, ask employer and get it.

4) Once you have UAN number, go to EPFO website and activate it.

5) Add your required document like PAN number, Aadhar number under KYC section for being KYC compliant.


Labels:

Comments

Post a Comment

Popular posts from this blog

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                                  ...
Post a Comment
Read more

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.
Post a Comment
Read more

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...
Post a Comment
Read more