LTIMindtree — Online Assessment: Pattern, Syllabus & Mock Test
LTIMindtree — Online Assessment pattern: 108 questions in 172 minutes across 6 sections. Sample questions, a preparation guide and a free timed mock.
- Pattern: LTIMindtree
- Duration: 172 minutes
- Questions: 108
- Timing: Sectional — each section on its own clock
- Negative marking: None
Aptitude, a long English block and sixty computer-science questions, then two easy programs.
- No negative marking
- Two CS blocks
- Coding in some drives
Sections
| Section | Questions | Time | Kind | Marks each |
|---|---|---|---|---|
| Quantitative Aptitude | 12 | 15 min | Multiple choice | 1 |
| Logical Reasoning | 12 | 15 min | Multiple choice | 1 |
| English | 22 | 22 min | Multiple choice | 1 |
| Computer Science — Programming | 30 | 30 min | Multiple choice | 1 |
| Computer Science — Fundamentals | 30 | 30 min | Multiple choice | 1 |
| Coding | 2 | 60 min | Coding | 10 |
LTIMindtree — Online Assessment syllabus
Quantitative Aptitude
- Number System
- Percentages
- Profit & Loss
- Ratio & Proportion
- Averages
- Problems on Ages
- Time & Work
- Time, Speed & Distance
- Simple & Compound Interest
- Permutations & Combinations
- Probability
- Mixtures & Alligation
- Mensuration
Logical Reasoning
- Number & Letter Series
- Coding & Decoding
- Blood Relations
- Direction Sense
- Syllogisms
- Seating & Puzzles
- Analogies & Classification
- Mathematical Reasoning
English
Computer Science — Programming
Computer Science — Fundamentals
Coding: Mindtree coding questions 19 problems
Instructions
The fresher assessment LTIMindtree runs on WeCP, in the most-cited recent shape.
- Sectionally timed, in a fixed order.
- No negative marking.
- The two computer-science blocks are the bulk of the paper: output tracing and pseudocode first, then data structures, OS, DBMS and networks.
- The coding section appears in some drives and not others. It is included here so you are ready for the drives that have it.
The spoken-English check some drives run, the paragraph writing one source reports and the AI-assisted grading of code are not part of this paper.
Practice questions for the LTIMindtree — Online Assessment test
As old as you at your birth
A father tells his son, 'I was as old as you are now at the time of your birth.' If the father is 38 now, what was the son's age five years back?
- 14
- 19
- 24
- 33
Show the answer
A. 14 Worked solution
Opposites
Hot : Cold :: Victory : ?
- Battle
- Defeat
- Win
- Army
Show the answer
B. Defeat Worked solution
A suitable title
Antibiotic resistance is not a future risk but a present one. Every course of antibiotics kills the susceptible bacteria and leaves the resistant to multiply, so resistance is the predictable result of use rather than of misuse alone. Misuse merely accelerates it. This is why the response has two halves that are often confused: using existing drugs more sparingly buys time, but only new classes of drug can replace what is being lost.
Which is the most suitable title for the passage?
- The Dangers of Hospital Infections
- Why Resistance Is Built Into Antibiotic Use
- A History of Antibiotics
- How to Prescribe Medicines
Show the answer
B. Why Resistance Is Built Into Antibiotic Use Worked solution
Two blanks at once
Fill in the blanks:
Although the report was ______, its conclusions were widely ______ by experts.
- thorough … accepted
- thorough … disputed
- vague … dismissed
- brief … ignored
Show the answer
B. thorough … disputed Worked solution
Three divisions in Python
What does this Python program print?
print(7 // 2, 7 / 2, -7 // 2)- 3 3.5 -3
- 3 3.5 -4
- 3 3 -4
- 3.5 3.5 -3.5
Show the answer
B. 3 3.5 -4 Worked solution
Rotating an array left
The array A is 0-indexed. What are its contents at the end?
Integer A[0..4], i, t
Set A = {10, 20, 30, 40, 50}
Set t = A[0]
For i = 0 to 3
Set A[i] = A[i + 1]
End For
Set A[4] = t
Print A- 10 20 30 40 50
- 20 30 40 50 10
- 50 10 20 30 40
- 50 40 30 20 10
Show the answer
B. 20 30 40 50 10 Worked solution
Integer and floating-point division in Java
What does this Java program print?
public class Main {
public static void main(String[] args) {
System.out.println(5 / 2 + " " + 5 / 2.0 + " " + 5 % 2);
}
}- 2 2.5 1
- 2 2.0 1
- 2 2.5 2
- 2.5 2.5 1
Show the answer
A. 2 2.5 1 Worked solution
Best case of insertion sort
What is the best-case running time of insertion sort, and on which input does it occur?
- O(1) on a single-element array
- O(n) on an already sorted array
- O(n log n) on a randomly shuffled array
- O(n²) on a reverse-sorted array
Show the answer
B. O(n) on an already sorted array Worked solution
Which DNS record
Which DNS record type maps a host name to an IPv4 address?
- A
- CNAME
- MX
- NS
Show the answer
A. A Worked solution
A queue from two stacks
A queue is built from two stacks: enqueue pushes onto stack A, and dequeue pops from stack B, refilling B by emptying A into it whenever B is empty. What is the amortised cost of one dequeue?
- O(1)
- O(log n)
- O(n)
- O(n log n)
Show the answer
A. O(1) Worked solution
About this pattern
Section order and sizes follow placementpreparation.io (12 quantitative, 12 logical, about 22 English, two blocks of about 30 CS questions). FACE Prep's 2026 page gives a six-section, 107-question version with two coding problems, and Glassdoor reports from 2025 mention two easy problems; placementpreparation.io says most recent drives have none. An older pre-merger page reports negative marking; no recent source does.
Modelled on the published pattern; not affiliated with LTIMindtree. Every sitting draws a fresh paper from the aptitude bank and the problem catalogue.