Virtusa Placement Papers: Online Test Pattern and Practice Questions

Virtusa’s online test has two core sections and one conditional section: 40 to 60 Technical MCQs, a 2-problem coding round, and an optional 40-question aptitude section that appears for select profiles.

That framing matters before you open a practice set. The bulk of your prep time should go to the Technical MCQ section and the coding round. The aptitude section, when it appears, covers standard quantitative aptitude, logical reasoning, and verbal ability. Students who treat all three sections as equally weighted tend to underinvest in technical prep, which is where Virtusa makes most of its selection decisions.

To understand how the online test fits into the full hiring funnel, see the Virtusa recruitment process guide.

How the Virtusa Online Test Is Structured

The online test structure, based on reported drives across multiple years:

Section	Questions	Time	Notes
Technical MCQs	40 to 60	60 to 75 minutes	Core section; present in every drive
Coding Round	2 problems	60 to 90 minutes	Medium to high difficulty; present in every drive
Aptitude Round	40	40 minutes	Conditional; appears for select profiles

Difficulty calibration: the Technical MCQ section expects solid CS fundamentals, not trivia. The coding problems are typically medium-difficulty by competitive programming standards, closer to LeetCode Medium than Easy. The aptitude section, if present, is solvable with standard placement-level quantitative prep.

No negative marking is reported across drives on the Technical MCQ section, but that can change cycle to cycle. Always read the instructions on the test day before you start.

After clearing the online test, the next stage is one or two technical interviews followed by an HR round. The Virtusa interview questions guide covers what to expect in those conversations.

Virtusa Technical MCQ Syllabus: Topic-by-Topic Breakdown

The Technical MCQ section draws from eight topic areas. Relative weight is approximate based on reported patterns:

Topic Area	Approximate Share	Key Sub-topics
C Programming	15 to 20%	Pointers, memory management, structs, output prediction
Java	15 to 20%	OOP concepts, exceptions, collections, generics
Computer Networks	10 to 15%	OSI model, TCP/IP, DNS, routing protocols
Operating Systems	10 to 15%	Process scheduling, memory management, deadlocks, file systems
DBMS and SQL	10 to 15%	Normalisation, transactions, joins, query output
Computer Organisation	5 to 10%	Number systems, gates, flip-flops, memory hierarchy
Software Engineering	5 to 10%	SDLC models, testing types, UML
Data Structures (within C/Java)	10 to 15%	Arrays, linked lists, stacks, queues, trees

A few patterns across reported drives:

• Output-prediction questions (what does this C or Java snippet print?) are more common than pure theory questions.
• DBMS questions often give a schema and ask for the output of a specific SQL query, rather than asking for a definition.
• OS questions tend to focus on process scheduling algorithms (FCFS, SJF, Round Robin) and deadlock conditions.
• Computer Networks questions at Virtusa tend towards the application layer and transport layer, not deep hardware-level content.

Virtusa Coding Round: What to Expect

Two problems, 60 to 90 minutes. The problems are independent; you don’t need to complete one before attempting the other.

Language options: C, C++, Java, Python. For Java-developer or backend-specific profiles, Java may be mandatory. The drive notification will specify if there is a restriction.

Typical problem categories seen across reported Virtusa drives:

• String manipulation: palindrome checks, anagram detection, pattern matching
• Array problems: duplicate removal, sorting, subarray sums
• Linked list operations: reversal, cycle detection, merge
• Recursion: Fibonacci sequence, factorial calculation, Tower of Hanoi variants
• Cryptarithmetic and puzzle-type problems: digit assignment problems where letters represent digits (such as SATURN + URANUS = PLANETS)
• Number theory: perfect squares, digit-property checks, prime filters

The cryptarithmetic type is worth specific preparation. These problems require assigning digits to letters so that a given arithmetic expression holds. The standard approach is systematic search with constraint propagation: a brute-force across all digit assignments works for small alphabets but is too slow when there are 8 or more unique letters. Practise recognising the constraint structure before the test.

One partial-scoring pattern reported in some drives: if your solution handles all test cases correctly but scores below the time complexity threshold, you still get partial marks. Write a correct brute-force solution first, then optimise if time allows.

Virtusa Aptitude Round (When It Appears)

When the aptitude section is present, it has 40 questions in 40 minutes. Topic distribution:

Sub-section	Approximate Questions
Quantitative Aptitude	15 to 18
Logical Reasoning	12 to 15
Verbal Ability and Reading Comprehension	8 to 10

High-frequency quantitative topics: time and work, time-speed-distance, profit and loss, percentages, ratios and proportions, number systems.

High-frequency logical reasoning topics: coding-decoding, blood relations, direction sense, seating arrangements, series completion.

Verbal section: sentence correction, reading comprehension (one short passage), vocabulary in context.

One minute per question is the target pace. Reading comprehension can be time-heavy; skim the questions before reading the passage to extract only what you need.

Students preparing for Virtusa alongside other IT services tests should note that the Syntel placement papers have a closely aligned aptitude section structure. Virtusa completed its acquisition of Syntel in 2021 (Virtusa official announcement), and overlap between the two companies’ prep materials is high.

Practice Questions: Virtusa Technical MCQ Samples

The following questions represent the types and difficulty level reported in Virtusa’s Technical MCQ section. They are representative examples, not official Virtusa questions.

C Programming: Output Prediction

• What is the output of this code snippet?

  int x = 5;
  printf("%d %d %d", x++, x++, x++);

  • A) 5 6 7
  • B) 7 6 5
  • C) Undefined behaviour
  • D) 5 5 5
  • Answer: C — The order of evaluation of function arguments is unspecified in C; modifying x multiple times between sequence points is undefined behaviour.

• Which of the following is correct about pointers in C?

  • A) A pointer can store the address of a variable of any type
  • B) A pointer and the variable it points to must be of the same type
  • C) Dereferencing a null pointer always returns 0
  • D) Pointer arithmetic is defined for all pointer types
  • Answer: B — Pointers are typed in C. While void * can hold any address, dereferencing requires a specific type.

Java: OOP

• Which keyword prevents a method from being overridden in Java?

  • A) static
  • B) private
  • C) final
  • D) abstract
  • Answer: C — The final keyword applied to a method prevents subclasses from overriding it.

• What is the output of the following Java snippet?

  String a = "hello";
  String b = "hello";
  System.out.println(a == b);
  System.out.println(a.equals(b));

  • A) false / true
  • B) true / true
  • C) false / false
  • D) Depends on JVM
  • Answer: B — String literals in Java are interned; a and b point to the same object in the string pool, so == returns true. equals also returns true.

DBMS: SQL Output

• Given a table Employees(id, name, dept, salary), what does the following query return?

  SELECT dept, COUNT(*) FROM Employees
  GROUP BY dept HAVING COUNT(*) > 2;

  • A) All departments and their employee counts
  • B) Departments with more than 2 employees and their counts
  • C) All employees in departments with more than 2 members
  • D) Departments with exactly 2 employees
  • Answer: B — HAVING COUNT(*) > 2 filters groups after aggregation; only departments with more than 2 rows are returned.

Operating Systems: Process Scheduling

• In the Round Robin scheduling algorithm, a process that does not complete within its time quantum is:
  • A) Terminated
  • B) Moved to the waiting queue
  • C) Placed at the end of the ready queue
  • D) Given a priority boost
  • Answer: C — The preempted process is placed at the back of the ready queue to wait for its next turn.

Computer Networks: Protocol Identification

• Which layer of the OSI model is responsible for end-to-end error detection and flow control?
  • A) Network layer
  • B) Data Link layer
  • C) Transport layer
  • D) Session layer
  • Answer: C — The Transport layer (Layer 4) handles end-to-end communication, error detection, and flow control via protocols such as TCP.

Coding Round: Sample Problem

Find all four-digit perfect squares whose digits are all even.

• Four-digit perfect squares range from 32 squared (1024) to 99 squared (9801). Iterate from 32 to 99, compute the square, and check whether every digit is even (0, 2, 4, 6, or 8).
• Extract each digit using modulo 10 and integer division. If any digit is odd, skip that number.
• There are exactly 2 such numbers: 6400 (80 squared) and 8464 (92 squared). The digit 0 is even, so 6400 qualifies. For 8836 (94 squared), the digit 3 disqualifies it.

Preparation Strategy: Four Weeks to the Virtusa Test

A four-week plan calibrated to the actual test structure.

Weeks 1 and 2: Technical MCQ foundation

Start with the two highest-weight areas: C programming output prediction and Java OOP. Do not just read theory. Write code, predict the output before running, then compare.

• C: Practise 15 pointer and memory questions per day. Common traps: pointer arithmetic, printf with multiple increments, sizeof on arrays vs. pointers.
• Java: Practise 15 OOP questions per day. Common topics: inheritance, polymorphism, interface vs. abstract class, exception handling, string interning.
• DBMS: Solve 2 to 3 SQL query-output questions per day. Cover joins (inner, left, right), GROUP BY with HAVING, subqueries, and normalisation forms (1NF, 2NF, 3NF, BCNF).
• OS: Work through process scheduling by hand. For FCFS, SJF (preemptive and non-preemptive), and Round Robin, compute the Gantt chart and turnaround/waiting time by hand at least 5 times each before timing yourself.

Weeks 3 and 4: Coding round focus

• Solve 2 LeetCode Easy and 1 LeetCode Medium per day in week 3. Focus: arrays, strings, linked lists, recursion.
• In week 4, increase to 2 LeetCode Medium per day. Add: binary search, stack/queue problems, basic dynamic programming.
• Practise one cryptarithmetic or digit-assignment puzzle every 2 days. These are rare but time-consuming; exposure reduces the panic factor.
• Time your sessions from week 3 onwards. The real test gives 30 to 45 minutes per coding problem. If you’re consistently exceeding that, identify whether the bottleneck is problem-solving or implementation.

Throughout:

• Run at least 2 full mock tests against a Virtusa-pattern mock (Technical MCQs plus coding, timed end to end) before the actual drive.
• For the aptitude section: if your drive notification mentions it, add 20 minutes of daily aptitude practice from week 2. If not mentioned, treat it as a low-priority supplement.

The eight topic areas in the Virtusa Technical MCQ section cover the same CS fundamentals that power modern software engineering and, increasingly, AI application development. Data structures, query optimisation, OS memory management, and network protocol design are prerequisites for working with LLMs, vector databases, and retrieval systems, not just for placement tests. TinkerLLM (₹299) puts those fundamentals to work in a set of build challenges covering LLM integration, retrieval, and deployment. A working AI project you can demo in a technical interview carries more weight than another certificate in a crowded candidate pool. For the full self-study path, see the 2026 AI roadmap for Indian engineering students.