AI InterviewSearch…Search problems, topics, or pages…Ctrl KGet started
All placement tests

Virtusa

Virtusa — Online Test & Coder Challenge

A short aptitude block, thirty CS questions and pseudocode, then four medium problems in fifty minutes.

11 sample questions

Coding-heavyNo negative markingFour problems, 50 minutes

The sitting

1h 40m

total time

54

questions

4

sections

None

negative marking

Start the test

The clock starts as soon as you click. Your paper is drawn fresh, so a second sitting is a different set.

Proctored sitting

  • Laptop or desktop only, with a webcam. Phones and tablets can't start a test.
  • The test runs full screen, with the site's navigation hidden.
  • Your webcam stays on and is checked on your computer — nothing is recorded or uploaded.
  • Leaving full screen, switching tab or window or minimising blurs the paper — and so does the camera seeing no one, someone else, a phone, or you looking away. The clock keeps running.
  • Each is a warning; the third ends the sitting. It is graded so you can review it, but marked disqualified and never counted as your best.
  • Pasting, copying, right-click and printing are off.

The paper

1

Aptitude

10 Q

10 min

Quantitative Aptitude · Logical Reasoning · Verbal Ability

2

CS Fundamentals

30 Q

30 min

Programming Fundamentals · Data Structures & Algorithms · OS, DBMS & Networks

3

Pseudo Code

10 Q

10 min

Pseudocode

4

Coder Challenge

4 Q

50 min

Four problems on one clock. Move between them freely.

4 medium

Before you start

Virtusa's fresher test leans on code more than most service papers.

  • Aptitude is short: ten questions across quantitative, logical and verbal.
  • CS Fundamentals and Pseudo Code follow, sectionally timed.
  • The Coder Challenge is four medium problems in fifty minutes, graded on test cases passed.
  • No negative marking.

A strong Coder Challenge score opens the separate Power Coder round (hard problems on trees, graphs and DP) and the higher offer; it is not part of this paper. Nor are the essay, the communication round or the adaptive delivery some sources describe.

AI InterviewGet started

Virtusa — Online Test & Coder Challenge: Pattern, Syllabus & Mock Test

Virtusa — Online Test & Coder Challenge pattern: 54 questions in 100 minutes across 4 sections. Sample questions, a preparation guide and a free timed mock.

  • Pattern: Virtusa
  • Duration: 100 minutes
  • Questions: 54
  • Timing: Sectional — each section on its own clock
  • Negative marking: None

A short aptitude block, thirty CS questions and pseudocode, then four medium problems in fifty minutes.

  • Coding-heavy
  • No negative marking
  • Four problems, 50 minutes

Sections

SectionQuestionsTimeKindMarks each
Aptitude1010 minMultiple choice1
CS Fundamentals3030 minMultiple choice1
Pseudo Code1010 minMultiple choice1
Coder Challenge450 minCoding10

Virtusa — Online Test & Coder Challenge syllabus

Aptitude

CS Fundamentals

Pseudo Code

Coding: Virtusa coding questions 13 problems

Instructions

Virtusa's fresher test leans on code more than most service papers.

  • Aptitude is short: ten questions across quantitative, logical and verbal.
  • CS Fundamentals and Pseudo Code follow, sectionally timed.
  • The Coder Challenge is four medium problems in fifty minutes, graded on test cases passed.
  • No negative marking.

A strong Coder Challenge score opens the separate Power Coder round (hard problems on trees, graphs and DP) and the higher offer; it is not part of this paper. Nor are the essay, the communication round or the adaptive delivery some sources describe.

Practice questions for the Virtusa — Online Test & Coder Challenge test

Ages differing by 16

The ages of two people differ by 16 years. Six years ago the elder was three times as old as the younger. What is the younger's present age?

  1. 12
  2. 14
  3. 16
  4. 20
Show the answer

B. 14 Worked solution

Square roots

16 : 4 :: 49 : ?

  1. 6
  2. 7
  3. 8
  4. 9
Show the answer

B. 7 Worked solution

Sparsest AVL tree

What is the minimum number of nodes in an AVL tree of height 4, counting the height of a single node as 0?

  1. 7
  2. 11
  3. 12
  4. 15
Show the answer

C. 12 Worked solution

TCP against UDP

Which of these statements about TCP is false?

  1. It is connection oriented
  2. It delivers bytes to the application in order
  3. It has a minimum header size of 8 bytes
  4. It provides flow control through a receiver-advertised window
Show the answer

C. It has a minimum header size of 8 bytes Worked solution

Comparing strings with == and equals

What does this Java program print?

public class Main {
    public static void main(String[] args) {
        String a = "code";
        String b = "code";
        String c = new String("code");
        System.out.println((a == b) + " " + (a == c) + " " + a.equals(c));
    }
}
  1. true true true
  2. true false true
  3. false false true
  4. true false false
Show the answer

B. true false true Worked solution

Deleting the root of a BST

A BST has 50 at the root, 30 and 70 as its children, 20 and 40 below 30, and 60 and 80 below 70. The root is deleted and replaced by its inorder successor. Which key becomes the new root?

  1. 20
  2. 30
  3. 40
  4. 60
Show the answer

D. 60 Worked solution

Where a router works

A router forwards packets by examining destination IP addresses. At which OSI layer does it operate?

  1. Data link layer
  2. Network layer
  3. Physical layer
  4. Transport layer
Show the answer

B. Network layer Worked solution

Pre-increment against post-increment

What does this C program print?

#include <stdio.h>

int main(void) {
    int i = 5;
    int j = i++;
    int k = ++i;
    printf("%d %d %d", i, j, k);
    return 0;
}
  1. 5 5 7
  2. 6 5 6
  3. 7 5 7
  4. 7 6 7
Show the answer

C. 7 5 7 Worked solution

Counting recursive calls

The naive recursion fib(n) = fib(n − 1) + fib(n − 2), with fib(0) and fib(1) returned directly, is used to compute fib(5). How many calls to fib are made in total, including the first one?

  1. 8
  2. 9
  3. 15
  4. 25
Show the answer

C. 15 Worked solution

A post-tested loop

A Repeat ... Until loop tests its condition after running the body. What is printed?

Integer x, c
Set x = 3
Set c = 0
Repeat
    Set x = x - 7
    Set c = c + 1
Until x < 5
Print c
  1. 0
  2. 1
  3. 2
  4. 3
Show the answer

B. 1 Worked solution

How many swaps does it perform

The array A is 0-indexed. What is printed?

Integer A[0..3], i, j, m, t, swaps
Set A = {4, 3, 2, 1}
Set swaps = 0
For i = 0 to 2
    Set m = i
    For j = i + 1 to 3
        If A[j] < A[m] Then
            Set m = j
        End If
    End For
    If m != i Then
        Set t = A[i]
        Set A[i] = A[m]
        Set A[m] = t
        Set swaps = swaps + 1
    End If
End For
Print swaps
  1. 2
  2. 3
  3. 4
  4. 6
Show the answer

A. 2 Worked solution

About this pattern

Section sizes follow PrepInsta's 2026 table (10 aptitude, 30 CS, 10 pseudocode, 4 problems in 50 minutes), the only full breakdown; its claims that HirePro runs it and that it is adaptive are not corroborated. FACE Prep and Glassdoor reports from 2025 give 40–60 MCQs with 1–5 problems, so counts vary by drive.

Modelled on the published pattern; not affiliated with Virtusa. Every sitting draws a fresh paper from the aptitude bank and the problem catalogue.

The Virtusa recruitment process, round by round