Skip to main content

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

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.