i
UST
Filter interviews by
posted on 10 Jul 2024
90 min test containing verbal, Quantitative aptitude and question based on diagrams
I prefer programming languages like Python and Java for their versatility and widespread use in the industry.
I prefer Python for its simplicity, readability, and vast libraries for various tasks.
I also like Java for its strong typing, object-oriented approach, and cross-platform compatibility.
I am open to learning new languages as needed for specific projects or tasks.
posted on 2 Sep 2024
I applied via campus placement at Jaipur Engineering College & Research Centre, Jaipur and was interviewed in Aug 2024. There was 1 interview round.
The first round is the aptitude+Core Subjects(Dsa+Cloud+Networking+Sql+Devops+ML)+ Coding One basic and one Advance
posted on 17 Dec 2024
posted on 15 Nov 2024
I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.
2 coding question were there and we need to solve eit in 45 minutes
Merit and demerit of Machine learning ?
General Aptitude and reasoning
Normalisation is the process of organizing data in a database to reduce redundancy and improve data integrity.
It involves dividing larger tables into smaller ones and defining relationships between them.
Normalization helps to eliminate data inconsistencies and anomalies.
There are different levels of normalization, such as first normal form (1NF), second normal form (2NF), and so on.
Normalization can improve database pe...
Polymorphism is the ability of an object to take on many forms.
It allows objects of different classes to be treated as if they were objects of the same class.
It is achieved through method overriding and method overloading.
Example: A shape class can have multiple subclasses like circle, square, etc. and all can be treated as shapes.
Example: A method can take an object of a parent class as a parameter and it can accept a
Stack is a data structure that follows LIFO. Pre and post tree formation are methods of traversing a tree.
Stack is used for backtracking, undoing, and recursion.
Pre-order traversal visits the root node first, then left subtree, then right subtree.
Post-order traversal visits the left subtree, then right subtree, then root node.
posted on 31 May 2022
I was interviewed in Apr 2022.
Round duration - 90 minutes
Round difficulty - Medium
You are provided with an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. The task is to determine the height of the tree.
The height of a binary tree is the maximum number of edges from the root to a leaf node.
Traverse the tree recursively and keep track of the maximum height
If the current node is null, return 0
Otherwise, calculate the height of the left and right subtrees and return the maximum height plus 1
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to calculate the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped on each bar by subtracting its height from the minimum of the maximum heights on both sides.
Sum up the trapped water for all bars and return the total amount.
Round duration - 45 minutes
Round difficulty - Medium
Given two sorted integer arrays ARR1
and ARR2
of size M and N, respectively, merge them into ARR1
as one sorted array. Assume that ARR1
has a size of M + N to hol...
The task is to merge two sorted arrays into one sorted array.
Create a new array with size M + N to store the merged array
Use two pointers to iterate through the elements of ARR1 and ARR2
Compare the elements at the current pointers and add the smaller element to the new array
Move the pointer of the array from which the element was added
Repeat the process until all elements are merged
If there are remaining elements in AR...
Tip 1 : Just focus on Data structures mostly arrays, string and dp and practice at least 350 Questions
Tip 2 : Prepare topics related to web tech like HTML, CSS, Node Js
Tip 3 : Prepare Java, OOPS and if required then spring framework and jsp, servlets and do atleast 2 good projects
Tip 1 : Everything should be clear and right what you have written on your resume.
Tip 2 : Have some projects on your resume and that projects should be done by you only and you should have proper knowledge of the tech and flow you have used in that projects.
I applied via Naukri.com and was interviewed in Apr 2022. There were 2 interview rounds.
HANA is an in-memory database platform while ECC is a traditional ERP system.
HANA is designed to handle large amounts of data in real-time while ECC is not optimized for real-time processing.
HANA uses column-based storage while ECC uses row-based storage.
HANA has a simpler data model and can handle unstructured data while ECC has a more complex data model.
HANA is a newer technology while ECC has been around for decades...
posted on 21 Apr 2022
I applied via Referral and was interviewed in Mar 2022. There were 3 interview rounds.
based on 1 interview
Interview experience
based on 11 reviews
Rating in categories
Software Developer
2.1k
salaries
| ₹2.5 L/yr - ₹12.6 L/yr |
Senior Software Engineer
1.7k
salaries
| ₹6.6 L/yr - ₹27.1 L/yr |
Software Engineer
1.3k
salaries
| ₹3.7 L/yr - ₹15.1 L/yr |
System Analyst
1.1k
salaries
| ₹6.3 L/yr - ₹21 L/yr |
Validation Engineer
942
salaries
| ₹2 L/yr - ₹9.6 L/yr |
TCS
Infosys
Wipro
HCLTech