MindTree

Mindtree is an Indian information technology company headquartered in Bangalore, India and a corporate office in New Jersey, USA. Founded in 1999, the company employs over 12,900+ employees with annual revenue of USD 500+ million. The company serves over 207 clients worldwide. It has around 40+ Fortune 500 companies as its clients. Mindtree is a CMMI level 5(Development) company. It is certified with ISO 14000, ISO 20000 and ISO 27000 to deliver predictably with high quality.

Selection Process

The Selection Process and Test Pattern is as follows:

The selection process of the company consists of 4 rounds. These rounds are as follows:

• Written Exam (AMCAT)
• Coding Test
• Technical Interview
• HR Interview

Pattern of Written Exam:

Section Number of Questions Time (in minutes)

Quantitative Ability 25 35 mins

English 25 25 mins

Logical Ability 24 35 mins

Coding 02 45 mins

Total 76 140 mins

• Quantitative Aptitude section consists of maths questions from the topics like algebra, time & work, time, speed & distance, arithmetic, percentages, profit & loss, geometry, etc. This section is of moderate level.
• Logical Ability section consists of reasoning based questions from common topics of reasoning skills.
• English section consists of basic questions from English language like synonyms, antonyms, sentence completion and correction etc.
• Coding section consists of 2 questions from coding , wherein the student is required to code in any language of their choice.Overall the level of the paper is easy to moderate. Only those candidates who clear the written exam will qualify for the next round.

Study Material

Coding: Students has to code in any programming language and should execute their code through online compiler.

The following are the model problems which are helpful to crack this section.

1. Print prime numbers upto n each separated by a comma except the last one.

Ex1: Input 7. Ex2: Input 15.

Output: 1,2,3,5,7 Output: 1,2,3,5,7,11,13

2. GCD of array of numbers

#include<stdio.h>

#include<stdlib.h>

int main()

{

          int n,g,*a,i;

          scanf("%d",&n);

          a=(int *)malloc(n*sizeof(int));

          for(i=0;i<n;i++)

          scanf("%d",(a+i));

          g=*a;

          for(i=1;i<n;i++)

          g=gcd(g,*(a+i));

          printf("%d",g);

          return 0;

}

int gcd(int x,int y)

{

          if(y==0)

          return x;

          else

          gcd(y,x%y);

}

3. Eliminate repeated letters in Array.

#include<stdio.h>

#include<string.h>

int main()

{

char a[100],b[100];

int i,j,k=0,count=0;

printf("Enter the string\n");

gets(a);

for(i=0;i<strlen(a);i++)

{

for(j=0;j<i;j++)

{

if(a[i]==b[j])

count=1;

}

if(count==0)

b[k++]=a[i];

count=0;

}

b[k]=NULL;

for(j=0;j<strlen(b);j++)

printf("%c",b[j]);

return 0;

}

4. 

4. Determine a string is palindrome or not

#include<stdio.h>

void stringpalindrome(char *);

int main()

{

    char str[20];

    int i, len=0,flag=0;

    printf("Enter a string:");

    scanf("%s",str);

    stringplaindrome(str);

return 0;

}

void stringpalindrome(char *s)

{

for(i=0;s[i]!='\0';i++)

            len++;

   for(i=0;i<len;i++)

   {

        if(s[i] != s[len-i-1])

          {

            flag = 1;

            break;

                }

  }

           if (flag)

        printf("%s is not a palindrome", *str);

        else

            printf("%s is a palindrome", *str);

    return;

}