Deloitte — Online Assessment: Pattern, Syllabus & Mock Test
Deloitte — Online Assessment pattern: 65 questions in 60 minutes across 3 sections. Sample questions, a preparation guide and a free timed mock.
- Pattern: Deloitte
- Duration: 60 minutes
- Questions: 65
- Timing: Sectional — each section on its own clock
- Negative marking: None
Sixty-five questions in an hour, with the technical block the largest of the three.
- No negative marking
- Technical-heavy
- Sectional cut-offs
Sections
| Section | Questions | Time | Kind | Marks each |
|---|---|---|---|---|
| Language Skills | 13 | 10 min | Multiple choice | 1 |
| General Aptitude | 22 | 25 min | Multiple choice | 1 |
| Technical Skills | 30 | 25 min | Multiple choice | 1 |
Deloitte — Online Assessment syllabus
Language Skills
General 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
- Number & Letter Series
- Coding & Decoding
- Blood Relations
- Direction Sense
- Syllogisms
- Seating & Puzzles
- Analogies & Classification
- Mathematical Reasoning
Technical Skills
Instructions
Deloitte's assessment puts more weight on computer fundamentals than on aptitude: thirty of the sixty-five questions are technical.
- Reported sectional cut-offs are roughly eleven of twenty-two on aptitude, seven of thirteen on English, and eleven of thirty on technical.
- No negative marking.
- Sources disagree on whether the paper is adaptive; this one is not.
The two coding problems that follow the MCQ block are not part of this paper.
How to prepare for this pattern
A guide to the Deloitte online assessment pattern, in which computer fundamentals outweigh aptitude: thirty of the sixty-five questions are technical.
What the paper looks like
Three sections, sat in a fixed order: Language Skills, 13 questions in 10 minutes; General Aptitude, 22 questions in 25 minutes; and Technical Skills, 30 questions in 25 minutes. That is 65 questions in 60 minutes. Each question is worth one mark and there is no negative marking. Each section runs on its own clock and closes when you leave it; sources differ on whether the real timer is shared or per section, and per section is used here. Sources also disagree on whether the paper is adaptive, and this mock is not. Reported sectional cut-offs are roughly 7 of 13 on English, 11 of 22 on aptitude and 11 of 30 on technical. The two coding problems that follow the multiple-choice block are not part of this paper.
How to prepare, section by section
- Language Skills is thirteen verbal questions at about 46 seconds each: Sentence Correction, Synonyms & Antonyms, Fill in the Blanks & Para Jumbles and Reading Comprehension. Grammar needs to be automatic at that pace.
- General Aptitude asks quantitative and reasoning questions together, twelve and ten. For the quantitative side, cover Percentages, Profit & Loss, Ratio & Proportion, Time & Work and Time, Speed & Distance; for reasoning, Number & Letter Series, Syllogisms, Blood Relations and Seating & Puzzles.
- Technical Skills is ten questions each on Programming Fundamentals, Data Structures & Algorithms and OS, DBMS & Networks. It is the largest section, so it repays the most preparation. For the programming questions, the early modules of the Java, C++ or Python study plan cover operators, types and control flow; for data structures, solving problems on the DSA roadmap makes the trade-offs familiar from use.
On the day
Every section is timed separately, so pace each on its own terms. Language Skills is the fastest at under fifty seconds a question: answer what you know on sight and guess the rest before the ten minutes are up. General Aptitude allows about 68 seconds a question. Technical Skills allows 50 seconds, which suits recall questions but not long tracing, so answer the factual OS, DBMS and data structures questions first and come back to the output-prediction ones. There is no negative marking, so leave no question blank in any section, and remember that minutes left in one section are lost when you move on.
This mock is modelled on the section counts two prep portals agree on, 13, 22 and 30, with per-section timing chosen where they differ; CodeKairo is not affiliated with Deloitte.
Practice questions for the Deloitte — Online Assessment test
The tone of the passage
Railways were the first industry to require a single national time. Before them, every town kept its own clock by the sun, and a difference of a few minutes between neighbouring places troubled nobody. A timetable made those minutes intolerable. Within a generation, the railway companies had imposed a standard time across whole countries — not because anyone had argued for it, but because the trains could not run without it.
The tone of the passage is best described as:
- Nostalgic
- Explanatory
- Indignant
- Sceptical
Show the answer
B. Explanatory Worked solution
The word that fits
Fill in the blank:
The witness gave a ______ account, omitting nothing of importance.
- vague
- meticulous
- hurried
- biased
Show the answer
B. meticulous Worked solution
Father thirty years older
A father is 30 years older than his son. In 12 years the father will be three times as old as his son. What is the son's present age?
- 3
- 4
- 5
- 6
Show the answer
A. 3 Worked solution
Foot is to man
Foot : Man :: Hoof : ?
- Bird
- Fish
- Horse
- Snake
Show the answer
C. Horse Worked solution
Average speed over two legs
A car covers 100 km at 60 km/h and another 100 km at 40 km/h. What is its average speed for the whole journey?
- 45 km/h
- 48 km/h
- 50 km/h
- 52 km/h
Show the answer
B. 48 km/h Worked solution
My nephew's maternal grandmother
A man pointing to a photograph says, 'The lady in the photograph is my nephew's maternal grandmother.' How is the lady related to the man's sister, who has no other sister?
- Mother
- Aunt
- Sister
- Grandmother
Show the answer
A. Mother 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
Counting FIFO page faults
A process references the pages 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. With three frames and FIFO replacement, how many page faults occur? Count the initial loads as faults.
- 7
- 8
- 9
- 10
Show the answer
C. 9 Worked solution
Dividing a negative number
What does this C program print? Assume a C99 or later compiler.
#include <stdio.h>
int main(void) {
printf("%d %d", -7 / 2, -7 % 2);
return 0;
}- -4 -1
- -4 1
- -3 -1
- -3 1
Show the answer
C. -3 -1 Worked solution
Shortest path by breadth-first search
An undirected graph has these adjacency lists:
| Vertex | Adjacent vertices |
|---|---|
| A | B, C |
| B | A, D |
| C | A, E |
| D | B, E |
| E | C, D, F |
| F | E |
A breadth-first search from A is used to find the shortest path to F. How many edges does that path contain?
- 2
- 3
- 4
- 5
Show the answer
B. 3 Worked solution
Largest possible natural join
R(A, B) holds 200 tuples and S(B, C) holds 100 tuples. What is the maximum possible number of tuples in the natural join of R and S?
- 0
- 100
- 200
- 20000
Show the answer
D. 20000 Worked solution
A local that hides a global
What does this C program print?
#include <stdio.h>
int x = 10;
void f(void) {
int x = 20;
x = x + 1;
printf("%d ", x);
}
int main(void) {
f();
printf("%d", x);
return 0;
}- 11 10
- 11 11
- 21 10
- 21 21
Show the answer
C. 21 10 Worked solution
About this pattern
PrepInsta and placementpreparation.io agree on 13 / 22 / 30 MCQs and the 90-minute total including coding. They differ on whether the timer is shared or per-section; per-section is used here. Adaptivity is claimed by one source only and is not modelled.
Modelled on the published pattern; not affiliated with Deloitte. Every sitting draws a fresh paper from the aptitude bank.