Core Java Interview Questions, Answers for Freshers and Experienced asked in various Company Job Interviews

Core Java Interview Questions

Questions Answers Views Company eMail

Implement a stack with push (), pop() and min() in O(1) time.

Amazon,

1049

Find the value of a specified element of the array arr[i] where 0 <= i <= n-1

Amazon,

936

Convert Binary tree to linked list.

Amazon,

1024

Convert a BST into a DLL and DLL to BST in place.

Amazon,

1073

worst case complexities of Quick sort and Merge sort.

Amazon,

957

What do you mean by hashing?

Amazon,

1056

What is the definition of tree ?

Amazon,

974

When can you say a graph to be a tree?

Amazon,

1041

What do you mean by constant time complexity?

Amazon,

1152

Write a program to show whether a graph is a tree or not using adjacency matrix.

Amazon,

1049

You're given a Boolean 2D matrix, can you find the number of islands?

Amazon,

1055

What steps are taken when the OS shifts from one-thread execution to another?

Amazon,

1325

What are the differences between graph and tree?

Amazon,

1073

Differentiate between overriding and overloading cases?

Amdocs,

1056

Differentiate between run time error and syntax error.

Amdocs,

1076

Post New Core Java Questions

Un-Answered Questions { Core Java }

how would you implement a thread pool? : Java thread

854

How do you change an int to a string?

956

Explain JMS in detail.

978

Does java initialize arrays to zero?

971

What is a functional interface?

977

What is a boolean output?

924

What is string builder in java?

961

Can I use % with real numbers?

971

Difference between static binding and dynamic binding?

1047

According to java operator precedence, which operator is considered to be with highest precedence?

1051

what is the difference between the methods sleep() and wait()? : Java thread

917

What is sizeof () operator?

933

What is a treemap in java?

958

Where are local variables stored?

922

How to sort double array in java?

954

For More Un-Answered { Core Java } Questions Click Here