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.
posted on 18 Sep 2024
I appeared for an interview in Mar 2024.
Aptitude+CS fundamentals questions were asked
4 questions majorly based on trees and linked list
Again 3 ques 1 was based on trees,another in linked list and 3rd on kadanes algorithm
Left view of a tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree in a level order manner
Keep track of the first node encountered at each level
Add the first node encountered at each level to the result array
Use Floyd's Tortoise and Hare algorithm to detect a loop in a linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If they meet at any point, there is a loop in the linked list.
posted on 16 Oct 2024
I applied via Campus Placement
posted on 11 Dec 2024
All multiple-choice questions on object-oriented programming and pointers.
Questions related to linked lists and trees.
Three questions, all regarding LinkedIn, focusing on lists and trees.
posted on 29 Aug 2024
It was an 1 hour round with pseudocodes of c different subject questions and it was an objective test
It was difficult with question of medium to hard level
posted on 5 Aug 2024
It is very impressive work on Josh technology assessment because we learn many new skills.
API stands for Application Programming Interface. It is a set of rules and protocols that allows different software applications to communicate with each other.
APIs define the methods and data formats that applications can use to request and exchange information.
APIs can be used to access services provided by other software applications, such as retrieving data from a database or sending notifications.
Examples of APIs ...
Software development life cycle (SDLC) is a process used by software developers to design, develop, and test software.
1. Planning: Define the project scope, requirements, and objectives.
2. Analysis: Gather and analyze user requirements.
3. Design: Create a detailed design of the software.
4. Implementation: Develop the software based on the design.
5. Testing: Test the software for bugs and issues.
6. Deployment: Release t...
posted on 5 Apr 2023
I applied via Campus Placement and was interviewed in Oct 2022. There were 3 interview rounds.
They would ask searching sorting , binary search in first round
Delete a node from a binary tree.
Find the node to be deleted
If the node has no children, simply delete it
If the node has one child, replace it with its child
If the node has two children, find the minimum value in its right subtree, replace the node with that value, and delete the minimum value node
posted on 11 Jun 2023
I applied via Referral and was interviewed before Jun 2022. There were 4 interview rounds.
Duration 1 hour
Data structure and algorithms
Duration 1.5 hour
Data structure and algorithms
Use a binary tree traversal algorithm to find the next sibling on the right side of a given value.
Implement an in-order traversal algorithm to traverse the binary tree
Keep track of the parent node and the direction of traversal to find the next sibling on the right side
If the given value is the right child of its parent, move up the tree until finding a node that is the left child of its parent
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