Filter interviews by
Clear (1)
Top trending discussions
posted on 20 Feb 2015
posted on 19 Jan 2022
I applied via Naukri.com and was interviewed in Jul 2021. There was 1 interview round.
posted on 10 Sep 2020
I applied via Company Website and was interviewed in Aug 2020. There were 3 interview rounds.
Connecting to a database has multiple options depending on the type of database and programming language used.
For SQL databases, options include using JDBC for Java, ODBC for C++, and ADO.NET for C#.
For NoSQL databases, options include using MongoDB's driver for Python or Node.js.
ORMs like Hibernate and Entity Framework can also be used to abstract away the database connection details.
Connection strings are used to spe...
posted on 6 Jan 2021
Compile time polymorphism is achieved through function overloading and templates.
Function overloading allows multiple functions with the same name but different parameters.
Templates allow generic programming by defining functions or classes that can work with different data types.
Examples of function overloading include cout<< for different data types and sqrt() for float and double.
Examples of templates include vector
I applied via Company Website and was interviewed in Jun 2024. There were 2 interview rounds.
Tomarrow, power system
Machine power system drive
I was interviewed in Jun 2024.
Electrical engineering
Power system machine power electronics
I applied via Referral and was interviewed before Mar 2020. There were 3 interview rounds.
30min and ask one coding question
30min and ask 2 coding question
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
A stack is a Last In First Out (LIFO) data structure, while a queue is a First In First Out (FIFO) data structure.
Stack: LIFO - Last In First Out. Example: browser history where the last page visited is the first to be accessed.
Queue: FIFO - First In First Out. Example: a line at a grocery store where the first person in line is the first to be served.
Function to find two numbers in array that add up to target. Optimize solution.
Use a hash map to store each number and its index as you iterate through the array.
For each number, check if the difference between the target and the number exists in the hash map.
Return the indices of the two numbers that add up to the target.
based on 1 interview
Interview experience
Electrical Engineer
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Electrical Engineer
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Safety Officer
26
salaries
| ₹0 L/yr - ₹0 L/yr |
KEC International
Kalpataru Projects International
BHEL
Siemens