Investing in Mutual Fund - Direct Buy option

You want to invest in mutual fund but confused by seeing the different types of varieties for same fund?

There are basically 2 types of mutual fund variance you can buy, one is direct and other is regular. Direct buy option doesn't involve adviser the expense ratio is less for direct option. Another is through adviser.

Before buying your PAN must be kyc compliant. You can get e-kyc done from different AMC sites or even mutual fund websites. There are option available to get your e-kyc from sitting from home which uses your video to have the IPV done.

once you are done with kyc, you can log-on to mutual fund website by creating your account with all the details required and start investing and will be able purchase the direct option.

Now a days there are different sites came up with the option which provides you an aggreegated view to purchase directly from mutual fund houses. example - zerodha coin, invezta etc.

Happy investing!!! Start you mutual fund investment online.

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