Skip to content
Related Articles

Related Articles

Nokia interview Experience (On campus)
  • Difficulty Level : Medium
  • Last Updated : 02 Jan, 2019
GeeksforGeeks - Summer Carnival Banner

Round 1:

The first round was online test conducted in AMCAT environment. It consists of the following sections:

Before starting the test you have to choose programming language (C++/Java) for coding test.

  1. Quantitative aptitude – 16 questions (16 minutes)
  2. Logical reasoning – 14 questions (14 minutes)
  3. English comprehension – 18 questions (22 minutes)
  4. Programming question – 22 questions (25 minutes)
  5. Coding questions:

Eg:  Input array = {3, 5, 10, 0, -1, 4, 1}.

         Output array = { -1, 1, 4, 10}.



Refer this link for Aptitude test in AMCAT:

Round 2:

Second round is Technical round. Around 84 students were shortlisted from ECE/EEE/CSE/IT for next round.

There are 4 different domain Nokia hire.

  • Motive ( Programmer / Java Developer)
  • BBA (Business Administration)
  • FNN (Nokia Fixed Network )  
  • Motive & BBA ( Good at programming and Network)

If you do two coding question in JAVA in first round you will be automatically moved to Motive panel. If you do two coding question in C++ in first round you will be automatically moved to Motive and BBA panel otherwise you will be moved to BBA and FNN panel.

I got through the motive panel because I do two coding question in java in first round.

Technical Interview Question: (1 hrs and 30 mins )

JAVA Questions:



  1. Introduce about yourself.
  2. Explain your mini projects.
  3. Questions in mini projects like cloud, database, Block chain, class diagram of project.
  4. Explain internal architecture of Java.
  5. What is JVM, JDK and JRE?
  6. What is byte-code? Why java is platform independent?
  7. What are all the types of memory in java?
  8. Difference between Array and Array List.
  9. Advantages of Array over linked list.
  10. What is mutable and immutable string?
  11. Code for declare hash table in collections.
  12. Can we add duplicate value and keys in hash table?
  13. What if we add duplicate keys in hash table?
  14. What is mean by genesys in Java?
  15. What is abstract class?
  16. Difference between abstract class and interface.
  17. Real time example for abstract class and interface.
  18. Types of inner class in class and code for it.
  19. Output for the given code.

public class HelloWorld{

public static void main(String []args){

if(true)

{

break;

}

}

}

  1. What is synchronization in java?
  2. What is deadlock in java?
  3. What is race condition?
  4. Can execute desktop application developed in java in different platform like windows, linux, mac.

Coding Questions:

  1. Reverse the string using recursion.( https://www.geeksforgeeks.org/reverse-a-string-using-recursion/ )
  2. Sort the alphabets in character array.( https://www.tutorialspoint.com/learn_c_by_examples/program_to_sort_string_characters_in_c.htm )

DBMS Questions:

  1. Query to find the second max salary. (https://www.geeksforgeeks.org/sql-query-to-find-second-largest-salary/ )

Round 3:

Around 16 students were shortlisted for HR round.

  1. Tell me about yourself.
  2. About Nokia.
  3. Why Nokia?
  4. Cognizant vs Nokia.
  5. What is your strength and weakness?

[REJECTED]

Around 7 students were selected (3 full time and 4 internship only). I was not among them. I don’t know the reason for rejection after that I came to know that there is job vacancy only for BBA and FNN only those students got full time offer remaining got only internship offer and some of students are rejected 🙁 .

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.   In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :