Interview Questions and Answers for 'L' | Search Interview Question

Interview Questions and Answers - Order By Rating

Q841. Is dependency injection possible if we don't have inheritance / Composition ?

Ans. Without composition - No, as it's the core of dependency injection.

With Inheritance - Yes, through interface implementation.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve dependency injection inversion of control ioc}

Q842. Is Runtime Polymorphism possible without Inheritance ?

Core Java

Ans. Yes, Runtime Polymprohism requires either Class inheritance or Interface implementation.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve runtime polymorphism object oriented programming (oops) oops concepts method overriding inheritance object oriented programming (oops) oops concepts}

Q843. Which of the OOP's features facilitate dependency injection ?

Design

Ans. Inheritance , Runtime Polymorphism and Composition.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve dependency injection inversion of control ioc oops oops features}

Q844. Lets say we have a set "set1" with objects of Class A, Class has a non static string called element1, Write a code ( using lambda expression ) to see if there is any object in the set with element1 = "Hello".

Core Java

Ans. set1.stream().filter(p->p.element1.equals("Hello")).findAny().isPreent();

or

set1.stream().map(A::getElement1).anyMatch("Hello"::equals)

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve lambda expressions java 8 java8 java 8 filter findAny()}

Q845. Let's suppose we have an to destroy objects, Design a program to implement garbage collection ?

Design

Ans. Step 1 - We can create a Registry Class having Map of all created objects as key and References list as value.

Step 2 - Whenever we create an object , we should update the Registry in the constructor to add the new object.

Step 3 - Whenever we assign a new reference to the object , we need to update the entry in Map. Similarly if the reference get's removed ( end of scope etc ), we need to remove the entry of reference from the list.

Step 4 - We can have threaded code to monitor the Map to see if any object looses all it's references and should call the method to destroy object and clean the memory.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve garbage collection}

Q846. What are the uses of Abstraction ?

Core Java

Ans. Loose Coupling
Facilitates designing complex applications by making them modular.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve oops concepts abstraction Asked in 1 Companies}

Q847. Explain Generics in Java ?

Core Java

Ans. Generics are a facility of generic programming that were added to the Java programming language in 2004 within J2SE5.0. They allow "a type or method to operate on objects of various types while providing compile-time type safety.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve generics Asked in 7 Companies}

Q848. Why can't we have diamond problem with interfaces ?

Core Java

Ans. Interfaces don't have member elements and method definitions that could cause diamond problem. With Java 8, Interfaces have default method definitions. This could have created diamond problem but Java introduced a compile time check for "duplicate default methods" in case same method is derived from multiple interfaces and no definition is overridden by the class.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve diamond problem interfaces java 8 default methods}

Q849. Why the following code produced this output ?

int x = 5;
int y = x;
y = 10;

System.out.println(x); // prints 5 and not 10

Core Java

Ans. Because when we say y = x, the value of x is copied to another memory location and then y points to that new memory location.

Unlike object references that once assigned point to same object in memory, value is copied in case of variable assignment.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve variable assignment}

Q850. How different is it when final applied to variables and object references ?

Core Java

Ans. final when assigned to object references doesn't make them immutable. It means that the references cannot be de-referenced.

final when applied to variables means that the value cannot be changed.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve final keyword final variable}

Q851. When we say final x = 10, is the reference final or the value ?

Core Java

Ans. final keyword have meaning only to referenced and not the value. It means that the specified reference cannot be dereferenced. It doesn't control the value assigned to the memory that's being referenced. This is the reason that final object references doesn't mean that the object is immutable but means that the reference cannot be changed to point to new object.

In case of primitive types too, when we assign a reference to another, values are passed and not the object reference, and hence a new placeholder is created in memory with the same value. That is why final to that context means that you cannot change the assigned memory and there is no way we can have that memory place have another value.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve final keyword final variables references}

Q852. Do we have a method to reverse a string in String class ?

Core Java

Ans. No but we have it in StringBuilder.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve String StringBuilder Reverse a string}

Q853. Write method to delete Node from a LinkedList.

Data Structure

Ans. public class LinkedList {

   Node start = null;
   Node head = null;

   class Node {
      Integer body;
      Node nextNode;

      Node(Integer value) {
         body = value;
      }
   }

   private void addNodeToEnd(Integer value) {
      if (start == null) {
         start = new Node(value);
         head = start;
         head.nextNode = null;
         return;
      }

      while (head.nextNode != null) {
         head = head.nextNode;
      }

      head.nextNode = new Node(value);
   }

   private void deleteNode(Integer value) {
      head = start;
      while (head.nextNode != null) {
         if(head.nextNode.body == value){
            head.nextNode = head.nextNode.nextNode;
         }

         head = head.nextNode;
      }
   }



   private void traverse() {
      head = start;
      while (head != null) {
         System.out.println(head.body);
         head = head.nextNode;
      }
   }

   public static void main(String[] args) {
      LinkedList ll = new LinkedList();

      ll.addNodeToEnd(5);
      ll.addNodeToEnd(10);
      ll.addNodeToEnd(15);

      ll.traverse();

      ll.deleteNode(10);

      ll.traverse();

   }
}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve linkedlist delete node from linkedlist}

Q854. In a Linked list with sorted numbers, insert a new numbers while maintaining the sort order.

Algorithm

Ans.
public class LinkedList {

   Node start = null;
   Node head = null;

   class Node{
      Integer body;
      Node nextNode;

      Node(Integer value){
         body = value;
      }
   }

   private void insertInMiddle(Integer value){
      head = start;
      if(start == null) {
         start = new Node(value);
         head = start;
         head.nextNode = null;
         return;
      }

      while(head.body < value){
         if(head.nextNode == null || head.nextNode.body >= value){
            Node newNode = new Node(value);
            newNode.nextNode = head.nextNode;
            head.nextNode = newNode;

            break;
         }
         head = head.nextNode;
      }
   }

   private void traverse(){
      head = start;
      while(head != null){
         System.out.println(head.body);
         head = head.nextNode;
      }
   }

   public static void main(String[] args){
      LinkedList ll = new LinkedList();

      ll.insertInMiddle(5);
      ll.insertInMiddle(10);
      ll.insertInMiddle(15);
      ll.insertInMiddle(7);

      ll.traverse();

   }
}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve LinkedList Data structures Algorithm}

Q855. Write a program for LinkedList, with method to append node and traversing the list ?

Algorithm

Ans. public class LinkedList {

   Node start = null;
   Node head = null;

   class Node {
      Integer body;
      Node nextNode;

      Node(Integer value) {
         body = value;
      }
   }

   private void addNodeToEnd(Integer value) {
      if (start == null) {
         start = new Node(value);
         head = start;
         head.nextNode = null;
         return;
      }

      while (head.nextNode != null) {
         head = head.nextNode;
      }

      head.nextNode = new Node(value);
   }

   private void traverse() {
      head = start;
      while (head != null) {
         System.out.println(head.body);
         head = head.nextNode;
      }
   }

   public static void main(String[] args) {
      LinkedList ll = new LinkedList();

      ll.addNodeToEnd(5);
      ll.addNodeToEnd(10);
      ll.addNodeToEnd(15);

      ll.traverse();

   }
}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve LinkedList Data structures Algorithm}

Q856. If you need to consume messages from the queue faster, which approach will you recommend - batching or concurrency ?

Design

Ans. Each has it's own advantages

Batching requires less resources but may result in loosing whole batch in case of failure whereas concurrency even though is little more expensive in terms of resources but would result in minimal loss in case of failure.

In case messages are to be consumed in a particular order, batching them in that order and then consuming them makes better sense.

if incoming messages are not continuous , it makes more sense to do concurrency as we need not wait for all messages to form a batch and flush. Though time sensitivity can be added but that would add unnecessary complexity.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve concurrency vs batching concurrency multithreading batch}

Q857. What is nested if ?

Core Java

Ans. if statements nested within another if or else blocks are called nested if statements.

if(condition1) {
if(condition2){
}
}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve if statement control statements nested if}

Q858. Can we synchronize the run() method in Java?

Core Java

^{This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve synchronization multithreading run method}

Q859. What will be the output of following code and Why ?

int x = 5;
int y = 7;
float f = 5f;
float z = y / x * f;
System.out.println(z);

Core Java

Ans. 5.0

operation between two ints generate int only. so 7/5 generates 1 and not 1.4. Multiplication between int and float generates float and hence

1 * 5.0 = 5.0

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve arithmetic calculation data types}

Q860. Is it a bad practice to initialize object reference to Null ?

Core Java

Ans. never initialise local to null,yes it is bad pratice

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve null nullpointerexception}

Q861. What is the difference between Java SE Map and Apache Commons MultiMap ? How can we implement functionality similar to multimap using Java SE map ?

Core Java

Ans. We can have duplicate keys within MultiMap whereas we cannot have duplicate keys within Java Util Map.

We can have a Map with value as a "collection of values" instead of single value to have a similar function as Multimap.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Apache commons multimap map vs multimap}

Q862. What is the difference between return and continue statement ?

Core Java

Ans. return is used within a method to return control out of the method. It may be followed by a value which is returned from the method to calling method immediately preceding the point of call.

continue statement is used within a loop to start next iteration without executing the remaining statements in the loop.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve return statement continue statement return vs continue for loop control statements loop statement}

Q863. What will happen in a graph traversal if we don't have a check for cycle

Algorithm

Ans. It will result in never ending loop

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve graph traversal}

Q864. Given the list of adjacent nodes, What will be the Depth First path

1 -> 2
1 -> 3
1 -> 6
2 -> 4
3 -> 5

Algorithm

Ans. 1 -> 2 -> 4 -> 3 -> 5 -> 6

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve depth first traversal graph traversal}

Q865. Given the list of adjacent nodes, What will be the Breadth First path

1 -> 2
1 -> 3
1 -> 6
2 -> 4
3 -> 5

Algorithm

Ans. 1 -> 2 -> 3 -> 6 -> 4 - > 5

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve breadth first traversal graph traversal}

Q866. What is the difference between Graph's Breadth first and Depth First algorithm ?

Algorithm

Ans. In Breadth first algorithm, all the adjacent nodes of the starting node is visited first and then the same rule is followed while moving inwards whereas

In Depth first algorithm, all the nodes of a single traversal path are visited first till a cycle or an end is found.

For example , given the following entries of adjacent nodes

1,2
1,3
1,6
2,4
2,5
3,6

The Breadth first path would be

1,2,3,6,4,5

and Depth first path would be

1,2,4,5,3,6

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve graph traversal breadth first vs depth first frequent}

Q867. What does the following initialization mean ?

ArrayList<LinkedList> traversalPaths = new ArrayList<LinkedList>();

What could be the use of such a collection.

Core Java

Ans. Initialize an ArrayList that will hold LinkedLists i.e every element of the arraylist will be a linked list.

Such collection could be used in algorithms that require first random access and then sequential traversal. For example - Storing traversal paths for a graph wherein we can start from any vertex. Implementing dictionary with each arraylist element holding staring with character and then linked list holding duplicate words.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve collections linkedlist arraylist}

Q868. Is String final in Java ?

Core Java

Ans. Strings are immutable in Java and not final.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve is string final final string immutable immutability immutability}

Q869. What is the difference between being final and being immutable ? Are string final or immutable in Java ?

Core Java

Ans. Being final in the sense of objects or object reference means that the reference cannot be reassigned to a different object whereas being immutable means that the object contents cannot be changed.

Strings in Java are immutable.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve string immutable immutability final vs immutable immutability}

Q870. Will the following code compile ?

final HashMap hm = new HashMap();
hm.put("Ravi", 221);

Core Java

Ans. Yes, it will compile without error. final in this context means that the reference hm cannot be assigned to a new hash map but didn't restrict from changing the state of collection already held by hm.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve final final variable Asked in 1 Companies}

Search Interview Questions

Help us and Others Improve. Please let us know the questions asked in any of your previous interview.