i
Filter interviews by
I applied via Campus Placement
Top trending discussions
posted on 19 Aug 2022
I applied via Referral and was interviewed before Aug 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Mar 2020. There were 4 interview rounds.
Hashtable is synchronized while hashmap is not.
Hashtable is thread-safe while hashmap is not.
Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.
Hashtable is slower than hashmap due to synchronization.
Hashtable is a legacy class while hashmap is a newer implementation.
Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.
Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.
Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.
Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.
Concurrent Hashmap is slower than Hashma...
I appeared for an interview in Sep 2017.
I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.
I appeared for an interview in Sep 2019.
I applied via Recruitment Consultant and was interviewed before Jan 2020. There were 5 interview rounds.
I am proficient in Java, Python, and C++. I have 2 years of experience in software development. I have excellent communication skills for client interaction.
Proficient in Java, Python, and C++
2 years of software development experience
Excellent communication skills for client interaction
I applied via Walk-in and was interviewed before Jul 2021. There were 3 interview rounds.
Data structures and algorithms
Python etl,pandas, pyspark questions
I applied via first naukari and was interviewed before Oct 2020. There were 4 interview rounds.
To find the shortest path in a graph stored in SQL, use algorithms like Dijkstra's or A* with SQL queries for traversal.
Use Dijkstra's algorithm for weighted graphs to find the shortest path efficiently.
For unweighted graphs, consider using Breadth-First Search (BFS).
Store graph edges in a table with columns for source, destination, and weight.
Example SQL query: SELECT * FROM edges WHERE source = 'A' AND destination = ...
based on 2 interview experiences
based on 10 reviews
Rating in categories
Project Engineer
3.2k
salaries
| ₹3.8 L/yr - ₹11 L/yr |
Project Associate
474
salaries
| ₹2.7 L/yr - ₹6.1 L/yr |
Software Developer
194
salaries
| ₹1 L/yr - ₹10 L/yr |
Senior Project Engineer
157
salaries
| ₹6 L/yr - ₹15.9 L/yr |
Knowledge Associate
80
salaries
| ₹7.8 L/yr - ₹11 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech