Hexaware Placement Papers: Test Pattern and Syllabus 2026

Hexaware’s Graduate Trainee Engineer drive begins with a single proctored online test that combines 60 aptitude questions, a technical MCQ section, and a coding round.

Hexaware Selection Process: The Five Stages

The full recruitment cycle for the Graduate Trainee Engineer role runs through five stages:

1. Online Test (Aptitude + Technical + Programming in one sitting)
2. Technical Interview — Round 1
3. Technical Interview — Round 2 (for some batches)
4. HR Interview
5. Offer Letter

The online test is the first filter. Students who clear all three sections move to the interview rounds. The aptitude and technical sections are MCQ-based; the programming section requires writing and submitting code in a browser-based IDE with compiler access. No physical calculator is permitted during the test. For the latest batch notifications and eligibility criteria, check Hexaware’s careers page.

Hexaware Online Test Pattern

The table below summarises the structure reported across recent drives:

Section	Type	Questions	Time
Aptitude	MCQ	60	60 minutes
Technical	MCQ	~25	~25 minutes
Programming	Coding	2–3 problems	45–60 minutes

The aptitude section is the longest component and historically the sharpest cut-off filter. The 60-question, 60-minute window gives one minute per question on average. Students who target a 50-minute finish get ten minutes to revisit flagged items.

The programming section is always last. Most online platforms serving Hexaware drives provide a browser IDE with compiler access; the exact set of accepted languages appears in your test invitation.

Negative Marking

Based on reported drives, the aptitude section carries no negative marking. Attempt all 60 questions.

Hexaware Aptitude Test: Syllabus and Sample Questions

The aptitude section draws from three sub-areas: quantitative aptitude, English (verbal), and analytical reasoning. In most drives, the 60 questions are distributed roughly equally across the three.

Quantitative Aptitude

Key topics reported across drives:

• Number systems and HCF/LCM
• Percentages and profit/loss
• Ratio, proportion, and averages
• Time and work; pipes and cisterns
• Time, speed, and distance
• Simple and compound interest
• Probability basics

Three sample questions with verified solutions:

• Q1 (Pipes and Cisterns): Pipe A fills a tank in 12 hours. Pipe B drains it in 18 hours. If both are open simultaneously, how long does the tank take to fill?

  • Fill rate: 1/12 per hour
  • Drain rate: 1/18 per hour
  • Net rate: 1/12 minus 1/18 = 3/36 minus 2/36 = 1/36 per hour
  • Time to fill = 36 hours
  • Answer: 36 hours

• Q2 (Mixtures): A 60-litre mixture has milk and water in ratio 2:1. How many litres of water must be added to change the ratio to 1:2?

  • Milk = 40 litres; Water = 20 litres (fixed 2:1 split of 60 litres)
  • Milk stays at 40 litres. For ratio 1:2, water must equal 2 x 40 = 80 litres
  • Water to add = 80 minus 20 = 60 litres
  • Answer: 60 litres

• Q3 (Speed): A train covers 360 km in 4 hours. What is its speed in km/h?

  • Speed = Distance / Time = 360 / 4 = 90 km/h
  • Answer: 90 km/h

English (Verbal)

Key topics:

• Sentence correction and error spotting
• Synonyms and antonyms
• Reading comprehension (1–2 passages)
• Fill in the blanks (grammar and vocabulary)
• Para-jumbles

A sample question:

• Q (Vocabulary): Choose the word closest in meaning to ameliorate.
  • (A) Worsen (B) Improve (C) Maintain (D) Decrease
  • Answer: B. “Ameliorate” means to make something better or more bearable, typically applied to a bad or unsatisfactory situation.

Analytical Reasoning

Key topics:

• Number and letter series
• Coding and decoding
• Blood relations
• Seating arrangements (linear and circular)
• Syllogisms
• Data interpretation (tables or bar charts)

A sample question:

• Q (Number Series): What is the next number in the series: 2, 6, 12, 20, 30, ?
  • Consecutive differences: 4, 6, 8, 10 — each increases by 2
  • Next difference = 12; next term = 30 + 12 = 42
  • Answer: 42

Hexaware Technical Test: Topics and Format

The technical section is a shorter MCQ round covering core computer science subjects. Questions test conceptual accuracy rather than code output. Typical topics across drives:

• Data Structures: arrays, linked lists, stacks, queues, trees, graphs
• Algorithms: sorting (time complexity), searching, recursion basics
• DBMS: normalisation (1NF through 3NF), SQL joins, keys, transactions
• Operating Systems: process scheduling, memory management, deadlock conditions
• Computer Networks: OSI model layers, TCP/IP stack, IP addressing, common protocols
• OOP Concepts: inheritance, polymorphism, encapsulation, abstraction
• C/C++ or Java Basics: pointers, memory allocation, OOP in code

Two sample questions with verified solutions:

• Q1 (Normalisation): Which normal form eliminates partial dependencies?

  • (A) 1NF (B) 2NF (C) 3NF (D) BCNF
  • Answer: B — 2NF. A relation is in 2NF when it is already in 1NF and every non-key attribute depends on the entire primary key, not just a subset of it. Partial dependency arises with composite keys when a non-key attribute depends on only part of the key.

• Q2 (Sorting): What is the worst-case time complexity of Quick Sort?

  • (A) O(n log n) (B) O(n squared) (C) O(n) (D) O(log n)
  • Answer: B — O(n squared). Worst case occurs when the pivot consistently picks the smallest or largest element at each step (as happens on an already-sorted input with no randomisation). The recurrence T(n) = T(n-1) + O(n) resolves to O(n squared).

Hexaware Programming Test: Languages, Format, and Prep

The programming section follows the aptitude and technical rounds. It typically contains 2 to 3 problems at easy-to-medium difficulty, with a combined time window of 45 to 60 minutes.

Languages commonly accepted: C, C++, Java, Python. The exact list for your drive is stated in the test invitation. Python is a valid choice and fully supported on most platforms used for Hexaware drives.

Problem types reported across drives:

• Array manipulation (reverse, rotate, find maximum subarray sum)
• String processing (anagram check, palindrome detection, character frequency count)
• Pattern printing (number/star triangles)
• Basic sorting and searching
• Simple recursion problems

What to Practice

Difficulty sits at LeetCode Easy to Medium. Four areas cover most drive problems:

• String and array operations in your chosen language
• Loops, conditionals, and function definitions
• Basic recursion: sum of digits, Fibonacci, power calculations
• Input/output handling: reading from stdin, printing to stdout

For the programming section, clean compilable code beats clever but broken optimisation. A brute-force solution that gives correct output scores better than an optimised one that fails to compile.

How to Structure Your Prep

A four-week plan for the Hexaware online test, suitable for students at Tier-2 and Tier-3 engineering colleges who are preparing alongside ongoing coursework:

Week	Focus
Week 1	Quantitative aptitude: ratios, percentages, time-work, pipes, time-distance
Week 2	Verbal: sentence correction, reading comprehension passages, vocabulary
Week 3	Technical MCQs: DBMS, OS, data structures, OOP concepts
Week 4	Full mock tests plus coding practice (Easy-Medium on any online judge)

One strategy note worth keeping: the aptitude section’s one-minute-per-question constraint means flagging hard quantitative problems and returning to them at the end is a better strategy than grinding through them in sequence. Bank the easy time first.

If you are preparing for multiple companies at the same time, the aptitude and reasoning sections here transfer directly to the EY placement test, which follows a similar three-topic MCQ structure. The HirePro platform guide is worth reading if your Hexaware drive runs on HirePro, which is common for off-campus rounds. For contrast on how the technical MCQ section differs across industry segments, the Siemens online test shows how an engineering-manufacturing firm weights its topics differently from a pure IT services company.

The Quick Sort worst-case question in the technical section above is a good marker for where the technical MCQ bar sits: you need to understand why the complexity behaves as it does, not just recall the answer from a lookup table. That same reasoning about algorithm behaviour connects directly to applied machine learning, where complexity trade-offs determine which approach is viable on real data. If you want to build that layer of understanding in Python, TinkerLLM starts at ₹299 and covers algorithm-to-ML connections through code you write and run, not slides you watch.