Addverb Technologies Corporate Communication Executive Interview Questions and Answers

Q1. Java spring boot
Add your answer
Q2. Angular routing,
Add your answer

2-3 basic dsa questions

Q1. Basic dsaquestions basic dsa
Add your answer
Q2. Basic dsa questions basic dsa
Add your answer

Q1. 1. Basic OOP Concepts 2. Difference between structure and class in terms of constructor 3. Can members of structure be defined as private 4. What's lambda function and it's real life use case 5. Difference...read more
Add your answer
Q2. 6. What's O(n) in time and space complexity
Ans. 
O(n) refers to linear time and space complexity.
• O(n) means that the time or space required by an algorithm grows linearly with the size of the input.

• It implies that the algorithm's performance is directly proportional to the input size.

• For example, if an algorithm takes 10 seconds to process 100 elements, it would take 20 seconds to process 200 elements.

• O(n) complexity is considered efficient and desirable in most case
Answered by AI
Add your answer

Given programming questions
String programs

Q1. Asked basic to intermediate level questions Datatypes OOP concepts Code snippets
Add your answer

Q1. System architecture
Add your answer
Q2. Dict ,list and other questions
Add your answer

Q1. Good URI design
Add your answer
Q2. Accessing id parameter in URL
Ans. 
Accessing id parameter in URL involves parsing the URL and extracting the id value.
• Use the window.location object to access the URL of the current page.

• Parse the URL using methods like split() or URLSearchParams to extract the id parameter.

• Example: If the URL is 'http://example.com/page?id=123', you can access the id value by parsing the URL.
Answered by AI
Add your answer

Q1. Salary expectations
Add your answer
Q2. Plan of growing up technically
Add your answer

It was the ask mostly about DSA

Q1. Normal coding questions nested list
Add your answer
Q2. Nested dictionary
Add your answer

Data extraction, solid questions, oops