Virtusa Interview Experience by | On Campus - Jan 2019

New update is available. Click here to update.

SDE - 1

Virtusa

3 rounds | 5 Coding problems

Anonymous

Fresher | Jan 2019

Selected

486 views

0 comments

1 upvotes

Interview preparation journey

Preparation

Duration: 3 months

Topics: Linked List, Binary Search Tree, Queue, Array ,DP ,Graph ,Recursion

Tip

Tip 1 : Competitive programming plays a major role when you are appearing for coding rounds as a fresher. In the coding rounds, you won't get direct problems copied from the internet. You would be required to use your logical thinking to go ahead in the process. This is where competitive programming helps.
Tip 2 : Coding rounds are all about Coding + Timing. Most people fail to excel due to the pressure of a timer ticking on their heads. So, instead of just solving problems, try to participate in timed contests. This will help you be used to the pressure of the timer.
Tip 3 : Many big companies expect you to be good at standard problems. So, once you are done with the coding round by your logical skills and competitive programming, you must be well versed with some standard problems in order to excel.

Application process

Where: Campus

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Make it short, crisp, and simple. It is always good to have a 1 pager resume.
Tip 2 : Resume must comprise of the following: Educational Qualifications, Technical skills, Projects, Work experience (if any), Achievements. Other than this, you may include some extra co-curricular achievements.

Interview rounds

Round

Easy

Online Coding Interview

Duration90 minutes

Interview date10 Jan 2019

Problems2

It happens in a very friendly manner.

Print All Possible Paths From Top Left Corner To Bottom Right Corner Of A 2-D Matrix

You are given an ‘M*N’ Matrix, You need to print all possible paths from its top left corner to the bottom right corner if given that you can either move right i.e from (i,j) to (i,...

Problem approach

I have tried DFS approach but not getting the answer there some test cases only passed.

Try solving now

DBMS Question

Create 2 tables and perform different operations on them.

Inner Join
Outer Join
Left Outer Join

Problem approach

Simply create the table and perform different operations

Round

Medium

Face to Face

Duration90 minutes

Interview date20 Jan 2019

Problems2

No problem occur very friendly environment.

DBMS Questions

What is the difference between SQL and NoSQL databases?

Problem approach

If your data is very structured and ACID compliance is a must, SQL is a great choice. On the other hand, if your data requirements aren't clear or if your data is unstructured, NoSQL may be your best bet. The data you store in a NoSQL database does not need a predefined schema like you do for a SQL database.

OS Questions

Write the code for both semaphore operations.

Round

Hard

Face to Face

Duration90 minutes

Interview date21 Jan 2019

Problems1

Rat In A Maze

Problem approach

Create a solution matrix, initially filled with 0’s.
Create a recursive function, which takes initial matrix, output matrix and position of rat (i, j).
if the position is out of the matrix or the position is not valid then return.
Mark the position output[i][j] as 1 and check if the current position is destination or not. If destination is reached print the output matrix and return.

Try solving now