All Expert Articles

Morgan Stanley Interview | Set 17 (On-Campus)

Round 1: 1.5 hours ================== This was a preliminary round held on Hackerrank. It included 20 MCQs for 50 marks and 2 coding question for… Read More

Morgan Stanley

Experiences

Interview Experiences

Walmart Labs Interview Experience | Set 3 (On-Campus)

Walmart Labs Interview Experience – On campus 1st round (Online Test) It was an online test of 90 minutes and was conducted on Hackerearth. It… Read More

STL

Walmart

Bit Magic

DSA

Experiences

Hash

Interview Experiences

Queue

Recursion

Flipkart Interview Experience| Set 35 (On-Campus for SDE 1)

Recently flipkart visited our campus for hiring interns as well as SDEs Here is the interview process: Round 1 : Online coding test on Hackerrank… Read More

Flipkart

Experiences

Interview Experiences

Amazon Interview Experience | Set 203 (On-Campus for SDE-1)

Hi everyone. Following is my experience of the recent Amazon recruit drive: Aptitude Round: (1:30 hours) 20 MCQs MCQs on outputs, maths, algorithms, DBMS, OS.… Read More

Amazon

Experiences

Interview Experiences

TCS Interview Experience | Set 3 (On-campus Recruitment Drive)

“Welcome to TCS” These are the words which every aspirant reading this article is desperate to here.Few days back,I was also one of you .… Read More

TCS

TCS-interview-experience

Experiences

Interview Experiences

Flipkart Interview Experience | Set 25

Hello, I recently attended an interview at Flipkart. There were four rounds: Round 1: I was given a problem statement and I had to write… Read More

Flipkart

Experiences

Interview Experiences

BrowserStack Interview Experience | Set 7 (Online Coding Questions)

Three questions asked. The test duration was 3 hours and was conducted on hackerearth. 1. Write a sql parser to properly parse queries for a… Read More

BrowserStack

Experiences

Interview Experiences

Accolite Interview Experience | Set 3 (On-Campus)

Written MCQ There were 20 multiple choice questions to be done in 30 minutes time and most of the technical questions were from https://www.geeksforgeeks.org/, one… Read More

Accolite

Arrays

Binary Search Tree

DSA

Dynamic Programming

Experiences

Interview Experiences

Linked List

Matrix

Queue

Strings

Tree

Amazon Interview Experience | Set 181 (For SDE 1)

Recently I was interviewed by Amazon for SDE 1, here is my Experience. Hope this will help others: Written Round : there where 3 coding… Read More

Amazon

Experiences

Interview Experiences

GATE | GATE-CS-2015 (Set 3) | Question 65

Consider the following array of elements. 〈89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100〉. The minimum number of interchanges needed… Read More

GATE-CS-2015 (Set 3)

GATE-GATE-CS-2015 (Set 3)

GATE

GATE | GATE-CS-2015 (Set 3) | Question 65

Consider a machine with a byte addressable main memory of 220 bytes, block size of 16 bytes and a direct mapped cache having 212 cache… Read More

GATE-CS-2015 (Set 3)

GATE-GATE-CS-2015 (Set 3)

GATE

GATE | GATE-CS-2015 (Set 2) | Question 51

The secant method is used to find the root of an equation f(x) = 0. It is started from two distinct estimates xa and xb… Read More

GATE-CS-2015 (Set 2)

GATE-GATE-CS-2015 (Set 2)

GATE

GATE | GATE-CS-2015 (Set 2) | Question 65

Consider two relations R1(A, B) with the tuples (1, 5), (3, 7) and R1(A, C) = (1, 7), (4, 9). Assume that R(A,B,C) is the… Read More

GATE-CS-2015 (Set 2)

GATE-GATE-CS-2015 (Set 2)

GATE

GATE | GATE-CS-2015 (Set 2) | Question 40

Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These… Read More

GATE-CS-2015 (Set 2)

GATE-GATE-CS-2015 (Set 2)

GATE

GATE | GATE-CS-2015 (Set 2) | Question 42

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on n vertices, n is (A) A multiple of 4… Read More

GATE-CS-2015 (Set 2)

GATE-GATE-CS-2015 (Set 2)

GATE

GATE | GATE-CS-2015 (Set 1) | Question 65

A variable x is said to be live at a statement Si in a program if the following three conditions hold simultaneously: 1. There exists… Read More

GATE-CS-2015 (Set 1)

GATE-GATE-CS-2015 (Set 1)

GATE

GATE | GATE-CS-2015 (Set 1) | Question 65

Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). It has 600 sectors per… Read More

GATE-CS-2015 (Set 1)

GATE-GATE-CS-2015 (Set 1)

GATE

GATE | GATE-CS-2015 (Set 1) | Question 56

Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9,… Read More

GATE-CS-2015 (Set 1)

GATE-GATE-CS-2015 (Set 1)

GATE

GATE | GATE-CS-2015 (Set 1) | Question 21

The output of the following C program is __________. void f1 (int a, int b) { int c; c=a; a=b; b=c; } void f2 (int… Read More

GATE-CS-2015 (Set 1)

GATE-GATE-CS-2015 (Set 1)

GATE

Snapdeal Interview Experience | Set 8 (On Campus)

Snapdeal conducted placement drive at my campus in January last week for Software Developer. Eligibility- All CSE (no pointer criteria) Online Test- 21 (MCQ) +2… Read More

Snapdeal

DSA

Experiences

Hash

Interview Experiences

Strings