Mindtree is a premier Indian IT services company that was founded in 1999 with its headquarters located in Bangalore and a corporate office in New Jersey. With a strong workforce of over 12,900 highly skilled employees, the company boasts an impressive annual revenue of over $500 million. Mindtree serves over 207 clients worldwide, including some of the world's largest Fortune 500 companies. The company is a proud CMMI level 5 (Development) certified company, ensuring that its clients receive the highest quality services with predictable outcomes. Additionally, Mindtree holds prestigious certifications for ISO 14000, ISO 20000, and ISO 27000, further demonstrating its commitment to delivering exceptional results to its clients.
If you're looking to sit for the Mindtree placement exam, there are certain best practices and advice that can help you ace the exam. One of the most important things to do is to understand the exam pattern and syllabus thoroughly. You can find information about the exam pattern and syllabus on the official website or by talking to people who have already appeared for the exam.
To crack the placement exam, it's also crucial to practice with placement exam practice questions. This will give you an idea of the type of questions that you can expect and help you manage your time better during the exam.
Another crucial factor to consider is the registration process for the placement exam. Make sure to register well in advance and have all the necessary documents and information ready to avoid any last-minute hassles.
When it comes to cracking the exam, it's essential to have a solid understanding of the concepts and topics covered in the syllabus. You can refer to various study materials and online resources to get a better understanding of the topics.
It's important to note that cheating is never the right way to approach the placement exam. Not only is it unethical, but it can also have serious consequences, including being disqualified from future opportunities. Instead, focus on studying hard and practicing regularly to increase your chances of success.
In addition to preparing for the exam, it's also helpful to research the Mindtree company culture and interview questions to better understand what the company is looking for in its candidates. This can help you prepare better for the interview process and increase your chances of landing the job.
Eligibility criteria required to apply for the Junior Software Engineer job role:
The total time for the written exam is 140 minutes, with 76 questions to be answered.
Aptitude Test
Logical Reasoning:
English:
Coding:
The company conducts recruitment process every year to select new candidates. The selection process of the company consists of 4 rounds. These rounds are as follows:
#Coding Question1
Write a program to check whether the number is Armstrong.
#Solution:
```sh
#include <stdio.h>
#include <math.h>
int main()
{
int Number, Temp, Reminder, Times =0, Sum = 0;
printf("\nPlease Enter number to Check for Armstrong \n");
scanf("%d", &Number);
//Helps to prevent altering the original value
Temp = Number;
while (Temp != 0)
{
Times = Times + 1;
Temp = Temp / 10;
}
Temp = Number;
while( Temp > 0)
{
Reminder = Temp %10;
Sum = Sum + pow(Reminder, Times);
Temp = Temp /10;
}
printf("\n Sum of entered number is = %d\n", Sum);
if ( Number == Sum )
printf("\n %d is Armstrong Number.\n", Number);
else
printf("\n %d is not a Armstrong Number.\n", Number);
return 0;
}
```
#Popular Question1
Write a C program to print Floyd’s Triangle
#Output:
```sh
Enter the number of rows of Floyd's triangle to print
5
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
```
#Popular Question2
Write a code to find all the possible triplets from the array that can form the triangle.
#Coding Question2
Write a program to check a single number is prime or not in c
#Solution:
```sh
#include<stdio.h>
int main(){
int n,i,m=0,flag=0;
printf("Enter the number to check prime:");
scanf("%d",&n);
m=n/2;
for(i=2;i<=m;i++)
{
if(n%i==0)
{
printf("Number is not prime");
flag=1;
break;
}
}
if(flag==0)
printf("Number is prime");
return 0;
}
```
#Coding Question3
Write a C program to Reverse a Number
#Solution:
```sh
#include<stdio.h>
void main()
{
int no,rev=0,r,a;
printf("Enter any num: ");
scanf("%d",&no);
a=no;
for(;no>0;)
{
r=no%10;
rev=rev*10+r;
no=no/10;
}
printf("Reverse of %d is %d",a,rev);
}
```
#Popular Question3
Write a program to print the pattern if the input is 5.
#Coding Question4
Write a C Program to find roots of the quadratic equation
#Solution
```sh
#include <stdio.h>
#include<math.h>
int main()
{
float a, b, c;
float root1, root2, imaginary, discriminant;
printf("\n Please Enter values of a, b, c of Quadratic Equation :\n ");
scanf("\n%f\n%f\n%f", &a, &b, &c);
discriminant = (b * b) - (4 * a *c);
if(discriminant > 0)
{
root1 = (-b + sqrt(discriminant) / (2 * a));
root2 = (-b - sqrt(discriminant) / (2 * a));
printf("\n Two Distinct Real Roots Exists: \nroot1 = %.2f and\n root2 = %.2f", root1, root2);
}
else if(discriminant == 0)
{
root1 = root2 = -b / (2 * a);
printf("\n Two Equal and Real Roots Exists:\n root1 = %.2f and \nroot2 = %.2f", root1, root2);
}
else if(discriminant < 0)
{
root1 = root2 = -b / (2 * a);
imaginary = sqrt(-discriminant) / (2 * a);
printf("\n Two Distinct Complex Roots Exists:\n root1 = %.2f+%.2f and \nroot2 = %.2f-%.2f", root1, imaginary, root2, imaginary);
}
return 0;
}
```
#Coding Question5
Write a C Program for Palindrome pattern printing.
#Solution
```sh
#include <stdio.h>
int main()
{
int n, reversedN = 0, remainder, originalN;
printf("Enter an integer: ");
scanf("%d", &n);
originalN = n;
// reversed integer is stored in reversedN
while (n != 0) {
remainder = n % 10;
reversedN = reversedN * 10 + remainder;
n /= 10;
}
// palindrome if orignalN and reversedN are equal
if (originalN == reversedN)
printf("%d is a palindrome.", originalN);
else
printf("%d is not a palindrome.", originalN);
return 0;
}
```
#Coding Question1
Write a program to check whether the number is Armstrong.
#Solution:
```sh
#include <stdio.h>
#include <math.h>
int main()
{
int Number, Temp, Reminder, Times =0, Sum = 0;
printf("\nPlease Enter number to Check for Armstrong \n");
scanf("%d", &Number);
//Helps to prevent altering the original value
Temp = Number;
while (Temp != 0)
{
Times = Times + 1;
Temp = Temp / 10;
}
Temp = Number;
while( Temp > 0)
{
Reminder = Temp %10;
Sum = Sum + pow(Reminder, Times);
Temp = Temp /10;
}
printf("\n Sum of entered number is = %d\n", Sum);
if ( Number == Sum )
printf("\n %d is Armstrong Number.\n", Number);
else
printf("\n %d is not a Armstrong Number.\n", Number);
return 0;
}
```
#Popular Question1
Write a C program to print Floyd’s Triangle
#Output:
```sh
Enter the number of rows of Floyd's triangle to print
5
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
```
#Popular Question2
Write a code to find all the possible triplets from the array that can form the triangle.
#Coding Question2
Write a program to check a single number is prime or not in c
#Solution:
```sh
#include<stdio.h>
int main(){
int n,i,m=0,flag=0;
printf("Enter the number to check prime:");
scanf("%d",&n);
m=n/2;
for(i=2;i<=m;i++)
{
if(n%i==0)
{
printf("Number is not prime");
flag=1;
break;
}
}
if(flag==0)
printf("Number is prime");
return 0;
}
```
#Coding Question3
Write a C program to Reverse a Number
#Solution:
```sh
#include<stdio.h>
void main()
{
int no,rev=0,r,a;
printf("Enter any num: ");
scanf("%d",&no);
a=no;
for(;no>0;)
{
r=no%10;
rev=rev*10+r;
no=no/10;
}
printf("Reverse of %d is %d",a,rev);
}
```
#Popular Question3
Write a program to print the pattern if the input is 5.
#Coding Question4
Write a C Program to find roots of the quadratic equation
#Solution
```sh
#include <stdio.h>
#include<math.h>
int main()
{
float a, b, c;
float root1, root2, imaginary, discriminant;
printf("\n Please Enter values of a, b, c of Quadratic Equation :\n ");
scanf("\n%f\n%f\n%f", &a, &b, &c);
discriminant = (b * b) - (4 * a *c);
if(discriminant > 0)
{
root1 = (-b + sqrt(discriminant) / (2 * a));
root2 = (-b - sqrt(discriminant) / (2 * a));
printf("\n Two Distinct Real Roots Exists: \nroot1 = %.2f and\n root2 = %.2f", root1, root2);
}
else if(discriminant == 0)
{
root1 = root2 = -b / (2 * a);
printf("\n Two Equal and Real Roots Exists:\n root1 = %.2f and \nroot2 = %.2f", root1, root2);
}
else if(discriminant < 0)
{
root1 = root2 = -b / (2 * a);
imaginary = sqrt(-discriminant) / (2 * a);
printf("\n Two Distinct Complex Roots Exists:\n root1 = %.2f+%.2f and \nroot2 = %.2f-%.2f", root1, imaginary, root2, imaginary);
}
return 0;
}
```
#Coding Question5
Write a C Program for Palindrome pattern printing.
#Solution
```sh
#include <stdio.h>
int main()
{
int n, reversedN = 0, remainder, originalN;
printf("Enter an integer: ");
scanf("%d", &n);
originalN = n;
// reversed integer is stored in reversedN
while (n != 0) {
remainder = n % 10;
reversedN = reversedN * 10 + remainder;
n /= 10;
}
// palindrome if orignalN and reversedN are equal
if (originalN == reversedN)
printf("%d is a palindrome.", originalN);
else
printf("%d is not a palindrome.", originalN);
return 0;
}
```
I feel the best thing about edyst is its company-specific guidance and the huge problem sets covering up almost all the concepts from beginner to advanced concepts, it helped me a lot for my placement preparation
I practice a lot at Edyst platform and what I learnt is how to code, self-learning and more & more about the practical knowledge which gradually increased my confidence level. Edyst was great platform which changed my career.
I really like the Company specific practice questions they turn out to be super helpfulduring my interview, I didn't face any difficulty, the variety and range of practice questions (especially on arrays) got me my dream job. Also, the online live session were very interactive and helped me in revision and solving doubts. Thank you Edyst.
Daily coding challenge and the doubt session helped me in staying consistent. Also, the leadership board kept me motivated. Edyst gave me the best guiding materials for all the cohorts I joined. I like everything done by Edyst for my success.
Being a mechanical student and getting into an IT company is very tough. One of the main reason I could able to crack TCS CodeVita is because of Edyst.
Aneeq sir, your doubt clearing sessions, daily assignments & incredible mentors support really brushed up my skills.
“My software journey started because of Edyst. Edyst preparation and referrals helped me get my first internship and job. Thank you Edyst!”
#Coding Question1
Write a program to check whether the number is Armstrong.
#Solution:
```sh
#include <stdio.h>
#include <math.h>
int main()
{
int Number, Temp, Reminder, Times =0, Sum = 0;
printf("\nPlease Enter number to Check for Armstrong \n");
scanf("%d", &Number);
//Helps to prevent altering the original value
Temp = Number;
while (Temp != 0)
{
Times = Times + 1;
Temp = Temp / 10;
}
Temp = Number;
while( Temp > 0)
{
Reminder = Temp %10;
Sum = Sum + pow(Reminder, Times);
Temp = Temp /10;
}
printf("\n Sum of entered number is = %d\n", Sum);
if ( Number == Sum )
printf("\n %d is Armstrong Number.\n", Number);
else
printf("\n %d is not a Armstrong Number.\n", Number);
return 0;
}
```
#Popular Question1
Write a C program to print Floyd’s Triangle
#Output:
```sh
Enter the number of rows of Floyd's triangle to print
5
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
```
#Popular Question2
Write a code to find all the possible triplets from the array that can form the triangle.
#Coding Question2
Write a program to check a single number is prime or not in c
#Solution:
```sh
#include<stdio.h>
int main(){
int n,i,m=0,flag=0;
printf("Enter the number to check prime:");
scanf("%d",&n);
m=n/2;
for(i=2;i<=m;i++)
{
if(n%i==0)
{
printf("Number is not prime");
flag=1;
break;
}
}
if(flag==0)
printf("Number is prime");
return 0;
}
```
#Coding Question3
Write a C program to Reverse a Number
#Solution:
```sh
#include<stdio.h>
void main()
{
int no,rev=0,r,a;
printf("Enter any num: ");
scanf("%d",&no);
a=no;
for(;no>0;)
{
r=no%10;
rev=rev*10+r;
no=no/10;
}
printf("Reverse of %d is %d",a,rev);
}
```
#Popular Question3
Write a program to print the pattern if the input is 5.
#Coding Question4
Write a C Program to find roots of the quadratic equation
#Solution
```sh
#include <stdio.h>
#include<math.h>
int main()
{
float a, b, c;
float root1, root2, imaginary, discriminant;
printf("\n Please Enter values of a, b, c of Quadratic Equation :\n ");
scanf("\n%f\n%f\n%f", &a, &b, &c);
discriminant = (b * b) - (4 * a *c);
if(discriminant > 0)
{
root1 = (-b + sqrt(discriminant) / (2 * a));
root2 = (-b - sqrt(discriminant) / (2 * a));
printf("\n Two Distinct Real Roots Exists: \nroot1 = %.2f and\n root2 = %.2f", root1, root2);
}
else if(discriminant == 0)
{
root1 = root2 = -b / (2 * a);
printf("\n Two Equal and Real Roots Exists:\n root1 = %.2f and \nroot2 = %.2f", root1, root2);
}
else if(discriminant < 0)
{
root1 = root2 = -b / (2 * a);
imaginary = sqrt(-discriminant) / (2 * a);
printf("\n Two Distinct Complex Roots Exists:\n root1 = %.2f+%.2f and \nroot2 = %.2f-%.2f", root1, imaginary, root2, imaginary);
}
return 0;
}
```
#Coding Question5
Write a C Program for Palindrome pattern printing.
#Solution
```sh
#include <stdio.h>
int main()
{
int n, reversedN = 0, remainder, originalN;
printf("Enter an integer: ");
scanf("%d", &n);
originalN = n;
// reversed integer is stored in reversedN
while (n != 0) {
remainder = n % 10;
reversedN = reversedN * 10 + remainder;
n /= 10;
}
// palindrome if orignalN and reversedN are equal
if (originalN == reversedN)
printf("%d is a palindrome.", originalN);
else
printf("%d is not a palindrome.", originalN);
return 0;
}
```