HEPL - A Cavinkare Group Company IT fresher Interview Questions and Answers

Preety easy round has basic qunts and reasoning

Was basic problem solving questions and easy ones

Q1. Collections in java programming
Ans. 
Collections in Java are data structures that store and manipulate groups of objects.
• Collections framework provides interfaces (List, Set, Map) and classes (ArrayList, HashSet, HashMap) for storing and manipulating data.

• Collections offer methods for adding, removing, and accessing elements in a structured way.

• Example: ArrayList<String> names = new ArrayList<>(); names.add("Alice"); names.add("Bob");
Answered by AI
Add your answer
Q2. What are the oops concepts
Add your answer

It is easy to crack the first round with the basic topics of aptitude.

Must learn string,array,pointer and others to clear this round

Simple aptitude questiona

Q1. Bubble sort coding question abd remaining HR questions
Add your answer

Q1. Questions on my resume. what is join? What is out of memory error? Can it be resolved after getting it? One programming question in java? Then some followup questions based on above?
Add your answer

Q1. Find the highest element from a BST and implement insertion operation of BST.
Ans. 
To find the highest element in a BST, perform a right traversal until reaching the rightmost leaf node.
• Perform a right traversal starting from the root node until reaching the rightmost leaf node to find the highest element.

• Implement the insertion operation by comparing the value to be inserted with each node and traversing left or right accordingly.

• Ensure that the BST property is maintained during insertion by placing...read more
Answered by AI
Add your answer
Q2. Heap Sort with Max Heap
Ans. 
Heap Sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• Heap Sort involves building a max heap from the input array, then repeatedly removing the maximum element and rebuilding the heap.

• The time complexity of Heap Sort is O(n log n) in the worst case scenario.

• Example: Given an array [4, 10, 3, 5, 1], after applying Heap Sort, the sorted array would be [1, 3, 4, 5, 10].
Answered by AI
Add your answer

Q1. Delete nth element from end in a LINKEDLIST.
Ans. 
To delete the nth element from the end in a LinkedList, we can use two pointers approach.
• Use two pointers - one to traverse the list and another to keep track of the nth element from the end.

• Calculate the distance between the two pointers and delete the node at the second pointer.
Answered by AI
Add your answer
Q2. Reverse a LinkedLis
Add your answer

Q1. Spring Boot basics
Add your answer
Q2. SQL basics and query
Add your answer

Q1. Microservices, Kafka, api gateway
Add your answer

Q1. Project explaination, technical questions
Add your answer

Q1. Spring security
Add your answer
Q2. Solid design principles
Ans. 
Solid design principles are a set of best practices for designing software that is maintainable, scalable, and flexible.
• Single Responsibility Principle - each class should have only one responsibility

• Open/Closed Principle - classes should be open for extension but closed for modification

• Liskov Substitution Principle - objects of a superclass should be replaceable with objects of its subclasses without affecting the pro...read more
Answered by AI
Add your answer

Q1. How authentication and authorization works in java
Add your answer
Q2. Design patterns in java
Ans. 
Design patterns in Java are reusable solutions to common problems in software design.
• Design patterns help in creating flexible, maintainable, and scalable code.

• Examples of design patterns in Java include Singleton, Factory, Observer, and Strategy.

• Each design pattern has its own purpose and can be applied in different scenarios.

• Understanding design patterns is essential for Java developers to write efficient code.
Answered by AI
Add your answer