Thanks for valuable information

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

Thanks for valuable information

Hey priyanka gautam-piya Thanks for sharing this Post first of all:

My question is the following:

They have asked to choose Research Area in application .Are they going to ask any question from that topic in interview.

Thanks for writing the post. Do you remember what kind of coding questions were asked and what was the time limit to solve them?

$Procedure:$

a. Programming Test

b. Written Test

c. Interview

a. $Programming\ Test$

Attempt three out of four questions:

1. Return Array sum

2. Find the number of combination such that sum of row = sum of column sum (i don't remember question exactly but it was something like this)

3. Some tree related question (write just function)

4. ......

b. $Written\ Test$

$20$ questions were there. All are objective type. Numerical related to page size, cache lines, regular languages, serial schedule, probability.

Algo question: An array is given. An array is row-wise as well as column-wise sorted. You have to find an element. How much time will it take? (Options were there)

Did $2$ programs (All test cases cleared) and in the written test I got $20/20$ (They didn't disclose written marks but at the time of interview they asked me to solve written exam question. Because there was an ambiguous question (graph related) and I ticked it correctly and got the mark. Luck :P)

1st shortlisting based on Programming + Written test.

After this you have to fill area:

1. Theoretical Computer Science

2. Systems

3. Intelligent System

I marked $Theoretical\ Computer\ Science$.

c. $Interview:$

Question-related to the written test. Just single question.

A binary tree with n node and height h along with two arbitrary nodes are given. Find the maximum distance between these two nodes. $(2*h)$

What is BFS?

Any other thing BFS do except traversal? (Finding shortest if a graph is undirected)

How? (Explained on board)

An array is given. Find the number of pairs with sum $= k$. Complexity?

If given array is already sorted. Then?

Difference between Merge and insertion sort?

People did $1$ programming question also selected for the interview. So try to score as much as possible in the written test.

Programming platform HackerRank.

Good Luck :)

a. Programming Test

b. Written Test

c. Interview

a. $Programming\ Test$

Attempt three out of four questions:

1. Return Array sum

2. Find the number of combination such that sum of row = sum of column sum (i don't remember question exactly but it was something like this)

3. Some tree related question (write just function)

4. ......

b. $Written\ Test$

$20$ questions were there. All are objective type. Numerical related to page size, cache lines, regular languages, serial schedule, probability.

Algo question: An array is given. An array is row-wise as well as column-wise sorted. You have to find an element. How much time will it take? (Options were there)

Did $2$ programs (All test cases cleared) and in the written test I got $20/20$ (They didn't disclose written marks but at the time of interview they asked me to solve written exam question. Because there was an ambiguous question (graph related) and I ticked it correctly and got the mark. Luck :P)

1st shortlisting based on Programming + Written test.

After this you have to fill area:

1. Theoretical Computer Science

2. Systems

3. Intelligent System

I marked $Theoretical\ Computer\ Science$.

c. $Interview:$

Question-related to the written test. Just single question.

A binary tree with n node and height h along with two arbitrary nodes are given. Find the maximum distance between these two nodes. $(2*h)$

What is BFS?

Any other thing BFS do except traversal? (Finding shortest if a graph is undirected)

How? (Explained on board)

An array is given. Find the number of pairs with sum $= k$. Complexity?

If given array is already sorted. Then?

Difference between Merge and insertion sort?

People did $1$ programming question also selected for the interview. So try to score as much as possible in the written test.

Programming platform HackerRank.

Good Luck :)

- All categories
- Testimonials 48
- Numerical Ability 0
- Verbal Ability 1
- Engineering Mathematics 7
- Algorithms 2
- Databases 2
- Digital Logic 3
- CO & Architecture 2
- Computer Networks 3
- Compiler Design 2
- Programming & Data Structures 6
- Motivation 18
- Preparation Advice 53
- Theory of Computation 2
- Preparation Experience 30
- Useful Links 10
- Study Materials 13
- Others 152
- Interview Experience 23
- Announcements 53

34,947 questions

41,991 answers

119,239 comments

41,484 users