All Expert Articles

Adobe Interview Experience for MTS-1 (1.5 Years Experience)

2 Rounds of online test, one related to aptitude and other is related to c++. Aptitude one had around 39 questions and 2hours was given.… Read More

Adobe

Experiences

Interview Experiences

Amazon Interview Experience | Set 170

Round 1 – Telephonic 1. Find element in an array which have elements in first increasing and then decreasing order. (code) 2. Find if two… Read More

Amazon

Experiences

Interview Experiences

Amazon Interview Experience | Set 169 (For SDE 2)

Recently I was interviewed for the position of SDE 2 I have 4 years of work experience .Following were the asked. Note: For all of… Read More

Amazon

Experiences

Interview Experiences

Snapdeal interview experience | Set 3

Hello guys, I recently appeared in Snapdeal interview for Java profile in Bangalore office. Here is my experience. The interview had 5 rounds out of… Read More

Snapdeal

Experiences

Interview Experiences

Athena Health Interview Experience | Set 2

Round 1: 10 Aptitude questions with difficulty level hard. Round 2: 3 programs given. 1st one mandatory. 1) Replace wild cards with all possible combinations… Read More

Athena-Health

Experiences

Interview Experiences

GATE | GATE-CS-2000 | Question 49

Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a… Read More

GATE-CS-2000

GATE-GATE-CS-2000

GATE

Adobe Interview Experience | Set 18 (For WBT Profile)

Following is my Interview experience in Adobe Bangalore for the profile of White Box Test Engineer. Written Round There were two parts technical and aptitude… Read More

Adobe

Experiences

Interview Experiences

GATE | GATE-CS-2002 | Question 38

The smallest finite automation which accepts the language {x | length of x is divisible by 3} has : (A) 2 states (B) 3 states… Read More

GATE-CS-2002

GATE-GATE-CS-2002

GATE

GATE | GATE-CS-2003 | Question 54

Define languages L0 and L1 as follows : L0 = {< M, w, 0 > | M halts on w} L1 = {< M, w,… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

Suffix Tree Application 5 – Longest Common Substring

Given two strings X and Y, find the Longest Common Substring of X and Y.Naive [O(N*M2)] and Dynamic Programming [O(N*M)] approaches are already discussed here. In… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Adobe Interview | Set 17 (For MTS-1)

Written Round There were two round technical and aptitude Aptitude round consisted of 45 questions (50 minutes) except two passage based on logical reasoning rest… Read More

Adobe

Experiences

Interview Experiences

Amazon Interview Experience | Set 144 (Off-Campus For SDE-1)

F2F Round 1: 1. Tell me about yourself. 2. Tell me about any challenging work you did in any of your past projects, why was… Read More

Amazon

DSA

Experiences

Hash

Interview Experiences

Strings

Fast method to calculate inverse square root of a floating point number in IEEE 754 format

Given a 32-bit floating point number x stored in IEEE 754 floating point format, find the inverse square root of x, i.e., x-1/2.A simple solution… Read More

DSA

Mathematical

GATE | GATE-CS-2003 | Question 90

Let ∑ = (a, b, c, d, e) be an alphabet. We define an encoding scheme as follows : g(a) = 3, g(b) = 5,… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

GATE | GATE-CS-2003 | Question 37

Let f : A → B be an injective (one-to-one) function. Define g : 2A → 2B as : g(C) = {f(x) | x ∈… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

Informatica Internship Interview Experience

Informatica recently visited our campus to hire full time employees and interns. About 70 students appeared out of which 4 were given internship and two… Read More

Informatica

Experiences

Internship

Interview Experiences

GATE | GATE-CS-2004 | Question 48

Consider two processes P1 and P2 accessing the shared variables X and Y protected by two binary semaphores SX and SY respectively, both initialized to… Read More

GATE-CS-2004

GATE-GATE-CS-2004

GATE

GATE | GATE-CS-2004 | Question 21

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by (A) the instruction… Read More

GATE-CS-2004

GATE-GATE-CS-2004

GATE

GATE | GATE-CS-2005 | Question 1

What does the following C-statement declare? [1 mark] int ( * f) (int * ) ; (A) A function that takes an integer pointer as… Read More

GATE-CS-2005

GATE-GATE-CS-2005

GATE

GATE | GATE-CS-2006 | Question 72

The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6. Two vertices of G… Read More

GATE-CS-2006

GATE-GATE-CS-2006

GATE