Posts

Venture Capital Funds V/S Mutual Funds

Larger mutual funds and people having a lot of stable funding are a lot of probably to speculate in in private command startups called unicorns. Mutual funds are less concerned in company governance, particularly boards of administrators, however have a lot of protections once it involves liquidating their stakes.

What is 'Venture Capital Funds'?
Venture capital funds area unit investment that manage the cash of investors United Nations agency get non-public equity stakes in startup and small- to medium-sized enterprises with sturdy growth potential. These investments area unit typically characterised as high-risk/high-return opportunities.

What is 'Mutual Funds'?
A open-end investment company may be a professionally-managed investment theme, typically go by associate degree quality management company that brings along a gaggle of individuals and invests their cash in stocks, bonds and alternative securities.
Mutual Fund 'units', is basically represent your sh…

Merge Sort Algorithm in c/c++

Merge Sort Algorithm in c/c++

#include<stdio.h>
#include<conio.h>

int a[100],b[100];

void mergesort(int low,int mid, int high)
{
            int h=low,i=low,j=mid+1;

            while(h<=mid && j<=high)
            {
                        if(a[h]<a[j])
                        {
                                    b[i]=a[h];
                                    h=h+1;
                        }
                        else
                        {
                                    b[i]=a[j];
                                    j=j+1;
                        }
                        i=i+1;
            }
            if(h>mid)
            {
                        for(int k=j;k<=high;k++)
                        {
                                    b[i]=a[k];
                                    i=i+1;
                        }
            }
            else
            {
                        for(int k=h;k<=mid;k++)
                        {
  …

linked queue algorithm using c/c++

linked queue algorithm using c/c++

#include<stdio.h>
#include<conio.h>

int a[100],front=-1,rear=-1;

void main()
{
                clrscr();
                void iqueue();
                int dqueue();
                void diplayque();
                int n,ind;

                while(1)
                {
                                printf("\n\n\t Perform Task : \n\t 1. Push \n\t 2. Pop \n\t 3. Display \n\t 4. Exit");
                                printf("\n\tEnter your Choices ");
                                scanf("%d",&n);

                                if(n==4)
                                                break;
                                switch(n)
                                {
                                                case 1:
                                                                iqueue();
                                                                break;
                                         …

Link list using c++

Image
Link list using c++

Knowledge of linked lists is must for C programmers. This article explains the fundamentals of C linked list with an example C program.

Linked list is a dynamic data structure whose length can be increased or decreased at run time. How Linked lists are different from arrays? Consider the following points : An array is a static data structure. This means the length of array cannot be altered at run time. While, a linked list is a dynamic data structure.In an array, all the elements are kept at consecutive memory locations while in a linked list the elements (or nodes) may be kept at any location but still connected to each other.

#include<stdio.h>
#include<conio.h>
#include<alloc.h>
#include<process.h>

struct linklist
{
                int n;
                struct linklist *next;
};
typedef struct linklist node;

struct linklist *head,*head1;

void displayNode()
{
                node *temp;
                if(head!=NULL)
                {
     …

White Board Video

Image

Binary Search Algorithm using c/c++

Binary Search Algorithm using c/c++
Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.


Binary search Program

#include<stdio.h>
#include<conio.h>

void main()
{
                int a[100],n,i,x;
                void sorts(int [],int);
                int binser(int [],int,int,int);
                clrscr();
                printf("How many Element are insert? ");
                scanf("%d",&n);

                printf("Enter Element");
                for(i=0;i<n;i++)
                {
                                printf("\nEnter Element %dth : ",i);
                                scanf("%d",&a[i]);
                }