**CTC:28 LPA**

**Profile: Software Development Engineer**

**Round 1:**

20 objective(c+os+dbms+networking) + 2 coding question

**Question 1:**

Generate the following pattern when x is given upto Nth terms

For ex:

Input: x=2 ,N=5

OUTPUT:

2

12

1112

3112

132112

**Question 2:**

Find the next higher no. Of x Whose binary represent does not contain consecutive 1s-

For ex:

Input:

12

Output:

16

**Round 2:**

3 coding question+project discussion:

**Question 1:**

Write a C program that, given an array A[] of n numbers and another number x, determines whether or not there exist two elements in S whose sum is exactly x.

**Question 2:**

Write an efficient program for printing k largest elements in an array. Elements in array can be in any order.

**Question 3:**

Given an unsorted array in which every adjacent element is differ by either +1 or -1

Write an efficient code to find x where x is also given.

**Round 3:**

**1 Question(tree)+project discussion.**

Find the lowest common ancestor of given n nodes in given binary tree.

Nodes are given in array of size n.

expected time complexity: O(n),space complexity :O(1)

**Round 4(HR Round):**

Tell me about yourself.

Strength,weakness

Project discussion

Coding Question: find nth node from the end of linked list.

**Round 5(Interview)**

Implement LRU cache where searching complexity will be O(1)?

What is multithreading ,apply it on the implemented cache,

What is critical section relate it with this code?How to solve the problem of critical section .

Difference between semaphore and mutex?

Project Discussion.

comments powered by Disqus