(CGPA 6.22 in Graduation, 84.76% in 12th and 80.4% in 10th).

**Coding Interview:**

- Reverse a linked list from the middle.
- Write a program to implement a round robin scheduler and calculate the average waiting time.Arrival time, burst time, time quantum, and no. of processes should be the inputs.

- Write a program of prime number using recursion.
- What is the difference between http and https?
- What are heap memory and stack memory and what are memory tables.

- Where do you see yourself in 5 years?
- Why do you want to work with Aspiring minds?
- What are your long-term goals?

(CGPA 7.25 in Graduation, 75% in 12th and 92% in 10th.)

**Coding Interview:**

- Write a code to generate a series where the next element is the sum of last k terms.
- Write a SQL queries on Self Join and Inner Join.

- What is the difference between process and thread?
- Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
- Write a program of advanced Fibonacci series.
- Give m equations and n variables. How many solutions are possible in each case?

(i) m<n,(ii) m=n (iii) m>n

- What is a reverse linked list.

- Tell us about yourself.
- Are you ready to handle a team under pressure? How will you manage them?
- What challenges are you facing presently and how are you dealing with them?
- What will you mark as your achievement during your college life?

Aspiring-Minds Preparation Links

- Actual Aspiring-Minds Interview Questions
- All About Aspiring-Minds
- Sample Aptitude Questions of Aspiring-Minds
- Free Mock Aspiring-Minds Placement Paper
- Join free prep course for Aspiring-Minds

(CGPA 8.25 in Graduation, 85% in 12th and 72% in 10th.)

- Write a code to select distinct records without using the DISTINCT keyword.
- Write a SQL queries on Self Join and Inner Join.

- What is the difference between process and thread?
- Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
- Write a program of advanced Fibonacci series.
- Give m equations and n variables. How many solutions are possible in each case?

(i) m<n,(ii) m=n (iii) m>n

- What is a reverse linked list?

- Tell us about yourself.
- What do you know about our competitors?
- What are your weaknesses and why we should not hire you?
- Basic puzzles.
- A lot of companies have visited your campus for recruitments, why haven’t you been placed yet?

(CGPA 7.25 in Graduation, 75% in 12th and 92% in 10th.)

- Write a code to generate a series where the next element is the sum of last k terms.
- On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.

- Given a doubly linked list with one pointer of each node pointing to the next node just like in a singly linked list. The second pointer(orbit pointer) however can point to any node in the list and not just the previous node. Write a program in to create a copy of this list.
- Give m equations and n variables. How many solutions are possible in each case?

(i) m<n,(ii) m=n (iii) m>n

- Write a program of prime number using recursion.

- Tell us about yourself.
- What all your projects and internship you did while? How did you get them?
- What makes the company different from other firms?
- Would you like to give your any general advice to your juniors?

(CGPA 7.25 in Graduation, 75% in 12th and 92% in 10th.)

- Write a code of a general series where the next element is the sum of last k terms.
- Select distinct records without using the DISTINCT keyword. Both using a subquery and without it.

- Write SQL queries on Self Join and Inner Join.
- What is the difference between heap memory and stack memory?
- Where to store local variables?
- What are memory tables?

- Tell me about yourself.
- What are the challenges you facing in IT?
- What are your achievements in life?
- Do you work well under pressure?
- Where do you see yourself in 5 years?

Other Resources for Placement Training: