ELDAAS Technologies Embedded Software Engineer Interview Questions and Answers

Recursive program of binary tree and basic HTML bootstrap

Basic to medium questions on array string SQL

Q1. Project related questions
Add your answer

Q1. Questions was based on SQL
Add your answer
Q2. SQL queries and joins and
Add your answer

Q1. Basic java questions
Add your answer
Q2. Sql related questions
Add your answer

Q1. How internally work HashMap ?
Ans. 
HashMap uses key-value pairs, hashing, and buckets for efficient data retrieval and storage.
• HashMap stores data in key-value pairs, where each key is unique.

• It uses a hash function to compute an index (hash code) for each key.

• The computed index points to a bucket in an array where the value is stored.

• If multiple keys hash to the same index (collision), they are stored in a linked list or tree structure.

• Example: For a k...read more
Answered by AI
Add your answer
Q2. Write the logic of prime number
Ans. 
A prime number is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.
• A prime number has exactly two distinct positive divisors: 1 and itself.

• Examples of prime numbers include 2, 3, 5, 7, 11, and 13.

• The number 1 is not prime because it has only one positive divisor.

• The number 4 is not prime because it can be divided by 1, 2, and 4.

• To check if a number n is prime, test divisi
Answered by AI
Add your answer
Q3. Difference between hash map and hash set?
Ans. 
HashMap stores key-value pairs; HashSet stores unique keys without values.
• HashMap allows duplicate values but not duplicate keys. Example: {1: 'A', 2: 'B', 1: 'C'} results in {1: 'C', 2: 'B'}.

• HashSet only stores unique elements. Example: {1, 2, 2} results in {1, 2}.

• HashMap provides O(1) average time complexity for get and put operations.

• HashSet provides O(1) average time complexity for add, remove, and contains operati...read more
Answered by AI
Add your answer

Loans