i
Filter interviews by
A stack is a data structure that follows the Last In First Out (LIFO) principle.
Elements are added and removed from the top of the stack.
Push() adds an element to the top of the stack.
Pop() removes the top element from the stack.
Peek() returns the top element without removing it.
Used in programming for function calls, expression evaluation, and memory management.
A queue is a data structure that follows the FIFO (First In First Out) principle.
Elements are added to the back of the queue and removed from the front.
Common operations include enqueue (add to back) and dequeue (remove from front).
Examples include a line of people waiting for a movie or a printer queue.
Java provides the Queue interface and its implementations like LinkedList and PriorityQueue.
Errors are severe issues that cannot be handled programmatically, while exceptions are issues that can be handled.
Errors are typically caused by the environment or system, while exceptions are caused by the program itself.
Errors are usually fatal and cannot be recovered from, while exceptions can be caught and handled.
Examples of errors include out of memory errors or stack overflow errors, while examples of excep...
throw is used to explicitly throw an exception, while throws is used to declare that a method may throw an exception.
throw is used within a method to throw an exception explicitly
throws is used in the method signature to declare that the method may throw an exception
throw is followed by an instance of an exception class
throws is followed by the list of exception classes that the method may throw
Exception handling is a mechanism in Java to handle runtime errors and prevent program termination.
Exceptions are objects that represent errors or exceptional conditions.
Java provides try-catch blocks to handle exceptions.
The try block contains the code that may throw an exception.
The catch block catches and handles the exception.
Multiple catch blocks can be used to handle different types of exceptions.
The finally...
Collections are data structures in Java that store and manipulate groups of objects.
Collections provide a way to store, retrieve, and manipulate groups of objects.
They offer various data structures like lists, sets, and maps.
Collections provide methods for adding, removing, and accessing elements.
Examples include ArrayList, HashSet, and HashMap.
Yes, a class can be private in Java.
A private class can only be accessed within the same outer class.
It cannot be accessed from any other class, even subclasses.
Private classes are often used for encapsulation and to hide implementation details.
Yes, duplicates can be added to an array.
Arrays in Java can contain duplicate elements.
The order of elements in an array is preserved.
Duplicate elements can be added at any index in the array.
No, a subclass cannot inherit the properties of a parent class if the parent class is not loaded.
In Java, inheritance allows a subclass to inherit the properties and methods of its parent class.
However, for a subclass to inherit the properties of its parent class, the parent class must be loaded.
If the parent class is not loaded, the subclass will not have access to its properties.
To ensure that a subclass can inh...
Array is a fixed-size data structure that stores elements of the same type, while heap is a dynamically allocated memory used for dynamic memory allocation.
Array has a fixed size, while heap can dynamically grow or shrink.
Array elements are stored in contiguous memory locations, while heap memory is allocated dynamically.
Arrays are accessed using index, while heap memory is accessed using pointers or references.
Ar...
I applied via Naukri.com and was interviewed in Jan 2023. There were 3 interview rounds.
I completed my B.E. in 2015.
I completed my B.E. in 2015.
I graduated with a Bachelor's degree in Engineering in 2015.
My B.E. was completed in 2015.
I completed my 12th in the year 2010.
I completed my 12th in 2010.
I finished my 12th grade in 2010.
My 12th grade was completed in 2010.
I took a year gap to gain practical experience and enhance my skills.
To gain practical experience and enhance my skills
To explore different technologies and frameworks
To work on personal projects and contribute to open-source projects
To attend workshops, seminars, and training programs
To take up internships or freelance projects
I completed my graduation in the year 2015.
I completed my graduation in 2015.
I graduated in the year 2015.
My graduation was completed in 2015.
Composition is a way to combine objects to create complex structures, while inheritance is a way to create new classes based on existing ones.
Composition is a 'has-a' relationship, where an object contains other objects as its parts.
Inheritance is an 'is-a' relationship, where a subclass inherits properties and behaviors from its superclass.
Composition allows for greater flexibility and modularity in design, as objects...
A stack is a data structure that follows the Last In First Out (LIFO) principle.
Elements are added and removed from the top of the stack.
Push() adds an element to the top of the stack.
Pop() removes the top element from the stack.
Peek() returns the top element without removing it.
Used in programming for function calls, expression evaluation, and memory management.
A queue is a data structure that follows the FIFO (First In First Out) principle.
Elements are added to the back of the queue and removed from the front.
Common operations include enqueue (add to back) and dequeue (remove from front).
Examples include a line of people waiting for a movie or a printer queue.
Java provides the Queue interface and its implementations like LinkedList and PriorityQueue.
Top trending discussions
I applied via Naukri.com and was interviewed before Jan 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Sep 2023. There were 2 interview rounds.
5 coding questions on google docs..duration 1 hour
I applied via Recruitment Consulltant and was interviewed in Oct 2024. There were 2 interview rounds.
Programming questions on string, array, numbers.
Difficultity level was simple.
5 questions were asked out of which 2 of them were easy and rest of them were hard.
Easy :- sorting, numbers
Hard :- bitwise, mathematical equation question.
posted on 7 Dec 2024
I applied via Campus Placement
Good question with nice logic
5 question in 1 hour so it's kinda difficult to manage time
I applied via Company Website and was interviewed before May 2023. There were 3 interview rounds.
5-6 questions were provided and a day was given.
Find minimum number of coins to make a given value using dynamic programming.
Use dynamic programming to find the minimum number of coins needed.
Create a dp array to store the minimum number of coins for each value up to the given value.
Iterate through each coin denomination and update the dp array accordingly.
Return the value at the given value index in the dp array.
Medium level question based on quantitative aptitude
Medium level leetcode questions
posted on 24 Sep 2024
Questions based on data structure
Questions based on Data structure
posted on 15 Aug 2023
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
IT WAS 3RD CODING ROUND IN WHICH 3 CODING QUESTIONS AND DURATION 75MIN
Some of the top questions asked at the Cross Country Infotech Java Developer interview -
based on 1 interview experience
Difficulty level
Duration
Process Associate
105
salaries
| ₹2 L/yr - ₹5 L/yr |
Senior Process Associate
39
salaries
| ₹2.9 L/yr - ₹5.5 L/yr |
Senior Software Engineer
30
salaries
| ₹7 L/yr - ₹13.8 L/yr |
Analyst
28
salaries
| ₹16.6 L/yr - ₹71.5 L/yr |
Software Engineer
26
salaries
| ₹9.4 L/yr - ₹16.5 L/yr |
Maxgen Technologies
JoulestoWatts Business Solutions
Value Point Systems
F1 Info Solutions and Services