.png){kind=logo}
.svg)
Tech Mahindra
About Tech Mahindra
Tech Mahindra is a leading provider of digital transformation, consulting, and business reengineering services. The company operates in over 90 countries and has a global workforce of over 138,000 professionals. As one of the largest recruiters in the IT industry, Tech Mahindra conducts placement exams to recruit the best and brightest candidates for their organization.
To crack the Tech Mahindra placement exam, it is important to understand the exam pattern, syllabus, and types of questions that are typically asked. It is also recommended to practice with mock tests and solve previous year's question papers to get a feel for the exam format.
In addition, it is crucial to follow best practices when preparing for the Tech Mahindra placement exam. These include setting a study schedule, taking breaks, staying organized, and getting enough sleep. It is also important to seek advice and guidance from experienced professionals and peers who have taken the exam before.
As with any exam, cheating is not only unethical but also counterproductive. It is not recommended to resort to cheating as it can lead to serious consequences and tarnish your reputation in the industry. Instead, focus on honing your skills and knowledge to crack the Tech Mahindra placement exam on your own merit.
Benefits of Tech Mahindra Exam
- Job opportunities with Tech Mahindra, one of the leading technology companies in India..
- A platform to showcase coding and problem-solving skills to a reputed organization, and gain recognition in the industry.
- Opportunity to gain hands-on experience in a competitive and high-pressure environment, which can help in developing skills and improve one's resume.
- A pathway to potentially kick start a successful career in the technology industry.
- Networking opportunities with industry professionals and experts from Tech Mahindra, who can provide valuable guidance and advice.
- The chance to learn about the latest technologies and techniques used in the industry, which can help to stay updated with industry trends.
- An opportunity to benchmark oneself against other talented and motivated students from across India.
- Enhance critical thinking and problem-solving skills in a real-world, competitive setting
- Potential to gain a competitive edge when applying for jobs or internships at other companies.
Eligibility criteria for Tech Mahindra Exam
To be eligible for the Tech Mahindra placement exam, you must meet the following academic qualifications:
- A minimum of 60% or above in Class 10th Standard
- A minimum of 70% or above in Class 12th Standard
- A minimum of 70% CGPA or above in college graduation
Additionally, you must be from a full-time degree course recognized by the Central/State Government of India, with no more than 1 year of education gap. All pending backlogs must be cleared at the time of the Tech Mahindra selection process.
We also have exciting packages for you to avail. If you clear Round 1 i.e., Aptitude + Essay Test only you will be offered a package of 3.25 LPA. But if you want to be eligible for a package of 5.5 LPA, you will have to clear Round 2 i.e., Coding.
But that's not all! If you're selected for the Tech Mahindra placement exam, you'll have the opportunity to work with one of the leading technology companies in India and gain hands-on experience in a competitive and high-pressure environment. You'll also have the chance to network with industry professionals and experts, learn about the latest technologies and techniques used in the industry, and potentially kickstart a successful career in the technology industry.
Please note that, Students who have participated in Tech Mahindra Interview process in the last 6 months are not eligible for Tech Mahindra selection process. So, don't wait any longer, apply now and take the first step towards achieving your career goals with Tech Mahindra!
Syllabus for Tech Mahindra
Quantitative Aptitude:
- Ages: 0-1 question
- Profit and Loss: 0-1 question
- Time and Work: 0-1 question
- Averages: 0-1 question
- Simple and Compound Interest: 0-1 question
- Prime Products: 0-1 question
- LCM and HCF: 0-1 question
- Equations: 0-1 question
- Divisibility: 0-1 question
- Boats and Streams: 0-1 question
- Permutation and Combination: 0-1 question
- Data Interpretation: 0-1 question
- Allegation and Mixture: 0-1 question
- Probability: 0-1 question
Logical Reasoning:
- Number Series: 0-3 questions
- Blood Relations: 0-2 questions
- Time and Work: 0-4 questions
- Analogies: 0-1 questions
- Statement and Conclusions: 0-2 questions
- Odd Man Out: 0-2 questions
- Data Sufficiency: 0-4 questions
- Seating Arrangement: 0-2 questions
- Cubes and Dices: 0-3 questions
- Shape and Construction: 0-3 questions
- Pattern Completion: 0-3 questions
- Coding-Decoding: 0-3 questions
- Mathematical Ordering: 0-2 questions
Tech Test:
- Coding: 1 question
- SEO: 0-3 questions
- SDK: 0-3 questions
- Stackoverflow: 0-1 questions
- Looping: 0-2 questions
- HTTPS: 0-3 questions
- Javascript & CSS: 0-1 questions
- Interpreter: 0-2 questions
- Hardware abstracts: 0-2 questions
- Flowcharts in CS: 0-1 questions
- Email protocol Pop3 | SMTP | HTTP | FTP: 0-1 questions
- Runtime Errors: 0-2 questions
- GIT: 0-3 questions
- Code - Reuse Functions: 0-1 questions
- Primary Key: 0-2 questions
- DBMS Language: 0-1 questions
- Ping: 0-1 questions
- OOPs Abstraction | Inheritence | Encapsulation | Polymorphism: 0-2 questions
- Storage classes: 0-2 questions
English - Verbal:
- Fill in the Blanks: 0-3 questions
- Error Detection: 0-3 questions
- One Word Substitution: 0-1 questions
- Tenses and Articles: 0-2 questions
- Proposition and Conjunction: 0-3 questions
- Error Identification: 0-1 questions
- Antonyms: 0-2 questions
- Synonyms: 0-2 questions
- Analogies: 0-1 questions
- Sentence Completion: 0-1 questions
- Sentence Correction: 0-2 questions
- Spellings: 0-3 questions
- Reading Comprehension: 1 question (5 sub-questions)
Tech Mahindra Exam Pattern
Round 1: Online Test
- Aptitude Test: Consists of quantitative aptitude, logical reasoning, and verbal ability
- Essay Writing: Candidates are required to write an essay on a given topic
Round 2: Technical Test
- Candidates are evaluated on their technical knowledge and skills in a specific area of expertise
Round 3: Conversational Test
- Candidates are assessed on their communication skills, problem-solving abilities, and overall fit for the company
Round 4: Interview Rounds
- Candidates are interviewed by a panel of managers and HR representatives to assess their qualifications and fit for the company
Note:
- The online test is a one-time test and candidates cannot go back to previous questions or sections
- All rounds are elimination rounds
- Candidates who clear Round 1 (Aptitude Test + Essay) are eligible for Round 2 and will be offered a package of 3.25 LPA
- Candidates who clear Round 2 will be offered a package of 5.5 LPA.
Section Name: Aptitude Test
- Number of Questions: 75
- Time Allotted: 142 minutes
Subjects:
- Logical Reasoning: 30 questions
- Aptitude: 10 questions
- Verbal English: 35 questions
English Essay:
- Topic: Vocabulary/Grammar
- Number of Questions: 1
- Time Allotted: 15 minutes
Section Name: Technical Test
- Number of Questions: 26
- Time Allotted: 65 minutes
Subjects:
- Coding: 1 question
- Technical MCQs: 25 questions
Note: The time allotted for the test is subject to change as per the discretion of the company.
Tech Mahindra Selection Process:
- Aptitude Test: The first stage of the selection process is an aptitude test, which is conducted to assess the candidate's problem-solving abilities, quantitative aptitude, and verbal ability.
- Essay Writing: In this stage, candidates are required to write an essay on a given topic. It helps the company to evaluate the candidate's writing skills, vocabulary, and grammar.
- Technical Test: In this stage, candidates are evaluated on their technical knowledge and skills in a specific area of expertise.
- Interview Round: After successfully clearing the above stages, candidates are called for an interview round. It is the final stage of the selection process. In this stage, candidates are interviewed by a panel of managers and HR representatives to assess their qualifications, experience, and fit for the company.
Note: The selection process may vary depending on the role and location. The company reserves the right to add or remove stages as per the requirement.
Popular Questions
#Question 1
Develop a function that takes in an array of positive integers and a starting position as input, and returns the sum of absolute differences between adjacent numbers, starting from the specified position.
#Question 1
Write a Java program to implement a circular buffer using an array. The buffer should have a fixed size and should be able to add and remove elements in a circular fashion.
#Solution 1
```sh
class CircularBuffer {
private int[] buffer;
private int size;
private int head = 0;
private int tail = 0;
public CircularBuffer(int size) {
this.size = size;
buffer = new int[size];
}
public void add(int value) {
if (head == (tail + 1) % size) {
throw new IllegalStateException("Buffer is full");
}
buffer[tail] = value;
tail = (tail + 1) % size;
}
public int remove() {
if (head == tail) {
throw new IllegalStateException("Buffer is empty");
}
int value = buffer[head];
head = (head + 1) % size;
return value;
}
}
```
#Question 2
Create a function that takes in the number of cloth pieces and the desired length of each clothing piece (10 feet) as input, and calculates the total number of clothing pieces that can be extracted from the given number of cloth pieces.
#Question 2
Write a Java program to implement a thread-safe LRU cache using a HashMap and a LinkedList. The cache should have a fixed size and should automatically remove the least recently used element when it becomes full.
#Solution 2
```sh
import java.util.LinkedHashMap;
import java.util.Map;
class LRUCache<K, V> {
private final int maxSize;
private final Map<K, V> cache;
public LRUCache(final int maxSize) {
this.maxSize = maxSize;
this.cache = new LinkedHashMap<K, V>(maxSize * 4 / 3, 0.75f, true) {
@Override
protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
return size() > maxSize;
}
};
}
public synchronized V get(K key) {
return cache.get(key);
}
public synchronized void put(K key, V value) {
cache.put(key, value);
}
}
```
#Question 3
Create a function that takes in an array of loan amounts and calculates the total interest on the loans, considering that no interest is applied on loans up to 2000 and a 20% interest is applied on remaining amounts in the array.
#Question 3
Write a Java program to implement a Bloom filter using a bit array and multiple hash functions. The Bloom filter should have a fixed size and should be able to add and check for the presence of elements efficiently.
#Answer 3
import java.util.BitSet;
import java.util.HashMap;
import java.util.Map;
class BloomFilter {
private BitSet bitset;
private int size;
private Map<Integer, Integer> hashFunctions;
public BloomFilter(int size) {
this.size = size;
this.bitset = new BitSet(size);
this.hashFunctions = new HashMap<>();
hashFunctions.put(1, 7);
hashFunctions.put(2, 11);
hashFunctions.put(3, 13);
}
public void add(String value) {
for (Integer key : hashFunctions.keySet()) {
int index = Math.abs(value.hashCode() * key) % size;
bitset.set(index, true);
}
}
public boolean check(String value) {
for (
#Question 4
Write a Java program to implement a thread-safe Singleton class using the double-checked locking mechanism.
#Answer 4
```sh
class Singleton {
private static volatile Singleton instance;
private Singleton() { }
public static Singleton getInstance() {
if (instance == null) {
synchronized (Singleton.class) {
if (instance == null) {
instance = new Singleton();
}
}
}
return instance;
}
}
```
#Question 5
Write a Java program to implement a generic tree data structure using classes and interfaces. The tree should support basic operations such as adding and removing nodes, and traversing the tree in pre-order, in-order, and post-order.
#Solution 5
```sh
interface Tree<T> {
public void addNode(T value);
public void removeNode(T value);
public void preOrderTraversal();
public void inOrderTraversal();
public void postOrderTraversal();
}
class TreeNode<T> {
T value;
List<TreeNode<T>> children;
public TreeNode(T value) {
this.value = value;
children = new ArrayList<TreeNode<T>>();
}
}
class GenericTree<T> implements Tree<T> {
private TreeNode<T> root;
// implements addNode, removeNode, preOrderTraversal, inOrderTraversal, postOrderTraversal methods
}
```
Previously Asked Question
#Question 1
Develop a function that takes in an array of positive integers and a starting position as input, and returns the sum of absolute differences between adjacent numbers, starting from the specified position.
#Question 1
Write a Java program to implement a circular buffer using an array. The buffer should have a fixed size and should be able to add and remove elements in a circular fashion.
#Solution 1
```sh
class CircularBuffer {
private int[] buffer;
private int size;
private int head = 0;
private int tail = 0;
public CircularBuffer(int size) {
this.size = size;
buffer = new int[size];
}
public void add(int value) {
if (head == (tail + 1) % size) {
throw new IllegalStateException("Buffer is full");
}
buffer[tail] = value;
tail = (tail + 1) % size;
}
public int remove() {
if (head == tail) {
throw new IllegalStateException("Buffer is empty");
}
int value = buffer[head];
head = (head + 1) % size;
return value;
}
}
```
#Question 2
Create a function that takes in the number of cloth pieces and the desired length of each clothing piece (10 feet) as input, and calculates the total number of clothing pieces that can be extracted from the given number of cloth pieces.
#Question 2
Write a Java program to implement a thread-safe LRU cache using a HashMap and a LinkedList. The cache should have a fixed size and should automatically remove the least recently used element when it becomes full.
#Solution 2
```sh
import java.util.LinkedHashMap;
import java.util.Map;
class LRUCache<K, V> {
private final int maxSize;
private final Map<K, V> cache;
public LRUCache(final int maxSize) {
this.maxSize = maxSize;
this.cache = new LinkedHashMap<K, V>(maxSize * 4 / 3, 0.75f, true) {
@Override
protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
return size() > maxSize;
}
};
}
public synchronized V get(K key) {
return cache.get(key);
}
public synchronized void put(K key, V value) {
cache.put(key, value);
}
}
```
#Question 3
Create a function that takes in an array of loan amounts and calculates the total interest on the loans, considering that no interest is applied on loans up to 2000 and a 20% interest is applied on remaining amounts in the array.
#Question 3
Write a Java program to implement a Bloom filter using a bit array and multiple hash functions. The Bloom filter should have a fixed size and should be able to add and check for the presence of elements efficiently.
#Answer 3
import java.util.BitSet;
import java.util.HashMap;
import java.util.Map;
class BloomFilter {
private BitSet bitset;
private int size;
private Map<Integer, Integer> hashFunctions;
public BloomFilter(int size) {
this.size = size;
this.bitset = new BitSet(size);
this.hashFunctions = new HashMap<>();
hashFunctions.put(1, 7);
hashFunctions.put(2, 11);
hashFunctions.put(3, 13);
}
public void add(String value) {
for (Integer key : hashFunctions.keySet()) {
int index = Math.abs(value.hashCode() * key) % size;
bitset.set(index, true);
}
}
public boolean check(String value) {
for (
#Question 4
Write a Java program to implement a thread-safe Singleton class using the double-checked locking mechanism.
#Answer 4
```sh
class Singleton {
private static volatile Singleton instance;
private Singleton() { }
public static Singleton getInstance() {
if (instance == null) {
synchronized (Singleton.class) {
if (instance == null) {
instance = new Singleton();
}
}
}
return instance;
}
}
```
#Question 5
Write a Java program to implement a generic tree data structure using classes and interfaces. The tree should support basic operations such as adding and removing nodes, and traversing the tree in pre-order, in-order, and post-order.
#Solution 5
```sh
interface Tree<T> {
public void addNode(T value);
public void removeNode(T value);
public void preOrderTraversal();
public void inOrderTraversal();
public void postOrderTraversal();
}
class TreeNode<T> {
T value;
List<TreeNode<T>> children;
public TreeNode(T value) {
this.value = value;
children = new ArrayList<TreeNode<T>>();
}
}
class GenericTree<T> implements Tree<T> {
private TreeNode<T> root;
// implements addNode, removeNode, preOrderTraversal, inOrderTraversal, postOrderTraversal methods
}
```
Testimonials
.jpg)
Abhishek Surya
I liked the assessment facility offered by Edyst, using this feature I prepared for all the competitive companies where Computer Science graduates get placement. As a CS background student Edyst platform helped me a lot to furnish my coding skills. It helped me to perform upto my true potential during my placement exams.
Jayaram Majeti
I joined Edust because the platform has wide range of practice questions. Also, there was mentors support throughout the day to help students when they get stuck. All the mentors were very friendly and helpful, the chat support feature of Edyst is best.
.jpg)
Manikanta Javvadi
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.
Sai Lokesh
Initially, I had 0 experience in coding as I'm a mechanical student; then I came across Edyst, which took me from 0 to 1 in coding. Edyst helped me to understand things better and easier. The sessions were excellent and very helpful. The best part of their courses was the assignments; they were accommodating, and the mentors were too kind to help me even at midnight.
Sai Sasikanth Rokkam
I wanted video lectures along with the coding assessments and that is exactly what Edyst offered me. I also got the roadmap towards getting a good placement job, I can't thanks Edyst enough for my success.
.jpg)
Rahil Sayed
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.
Coding Interview Round Sample Questions
#Question 1
Develop a function that takes in an array of positive integers and a starting position as input, and returns the sum of absolute differences between adjacent numbers, starting from the specified position.
#Question 1
Write a Java program to implement a circular buffer using an array. The buffer should have a fixed size and should be able to add and remove elements in a circular fashion.
#Solution 1
```sh
class CircularBuffer {
private int[] buffer;
private int size;
private int head = 0;
private int tail = 0;
public CircularBuffer(int size) {
this.size = size;
buffer = new int[size];
}
public void add(int value) {
if (head == (tail + 1) % size) {
throw new IllegalStateException("Buffer is full");
}
buffer[tail] = value;
tail = (tail + 1) % size;
}
public int remove() {
if (head == tail) {
throw new IllegalStateException("Buffer is empty");
}
int value = buffer[head];
head = (head + 1) % size;
return value;
}
}
```
#Question 2
Create a function that takes in the number of cloth pieces and the desired length of each clothing piece (10 feet) as input, and calculates the total number of clothing pieces that can be extracted from the given number of cloth pieces.
#Question 2
Write a Java program to implement a thread-safe LRU cache using a HashMap and a LinkedList. The cache should have a fixed size and should automatically remove the least recently used element when it becomes full.
#Solution 2
```sh
import java.util.LinkedHashMap;
import java.util.Map;
class LRUCache<K, V> {
private final int maxSize;
private final Map<K, V> cache;
public LRUCache(final int maxSize) {
this.maxSize = maxSize;
this.cache = new LinkedHashMap<K, V>(maxSize * 4 / 3, 0.75f, true) {
@Override
protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
return size() > maxSize;
}
};
}
public synchronized V get(K key) {
return cache.get(key);
}
public synchronized void put(K key, V value) {
cache.put(key, value);
}
}
```
#Question 3
Create a function that takes in an array of loan amounts and calculates the total interest on the loans, considering that no interest is applied on loans up to 2000 and a 20% interest is applied on remaining amounts in the array.
#Question 3
Write a Java program to implement a Bloom filter using a bit array and multiple hash functions. The Bloom filter should have a fixed size and should be able to add and check for the presence of elements efficiently.
#Answer 3
import java.util.BitSet;
import java.util.HashMap;
import java.util.Map;
class BloomFilter {
private BitSet bitset;
private int size;
private Map<Integer, Integer> hashFunctions;
public BloomFilter(int size) {
this.size = size;
this.bitset = new BitSet(size);
this.hashFunctions = new HashMap<>();
hashFunctions.put(1, 7);
hashFunctions.put(2, 11);
hashFunctions.put(3, 13);
}
public void add(String value) {
for (Integer key : hashFunctions.keySet()) {
int index = Math.abs(value.hashCode() * key) % size;
bitset.set(index, true);
}
}
public boolean check(String value) {
for (
#Question 4
Write a Java program to implement a thread-safe Singleton class using the double-checked locking mechanism.
#Answer 4
```sh
class Singleton {
private static volatile Singleton instance;
private Singleton() { }
public static Singleton getInstance() {
if (instance == null) {
synchronized (Singleton.class) {
if (instance == null) {
instance = new Singleton();
}
}
}
return instance;
}
}
```
#Question 5
Write a Java program to implement a generic tree data structure using classes and interfaces. The tree should support basic operations such as adding and removing nodes, and traversing the tree in pre-order, in-order, and post-order.
#Solution 5
```sh
interface Tree<T> {
public void addNode(T value);
public void removeNode(T value);
public void preOrderTraversal();
public void inOrderTraversal();
public void postOrderTraversal();
}
class TreeNode<T> {
T value;
List<TreeNode<T>> children;
public TreeNode(T value) {
this.value = value;
children = new ArrayList<TreeNode<T>>();
}
}
class GenericTree<T> implements Tree<T> {
private TreeNode<T> root;
// implements addNode, removeNode, preOrderTraversal, inOrderTraversal, postOrderTraversal methods
}
```
Technical Interview Round Sample Questions
.svg){kind=icon}
HR Interview Round Sample Questions
Tech Mahindra
Services Company Mega Pack
Services Company Mega PackProduct Companies Mega Pack