Addverb Technologies Sales Manager Interview Questions and Answers

Q1. C sharp basic concept
Add your answer
Q2. Explain Oops concept
Ans. 
Object-oriented programming paradigm focusing on objects and classes for code organization and reusability.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (object)

• Inheritance: Ability of a class to inherit properties and behavior from another class

• Polymorphism: Ability to present the same interface for different data types
Answered by AI
Add your answer
Q3. Explains oops type
Ans. 
Object-oriented programming paradigm that focuses on objects and classes
• Encapsulation: bundling data and methods that operate on the data into a single unit (class)

• Inheritance: ability of a class to inherit properties and behavior from another class

• Polymorphism: ability to present the same interface for different data types

• Abstraction: hiding the complex implementation details and showing only the necessary features
Answered by AI
Add your answer

Oop s concept all give simple program noted task

Asked to create a login form using MVVM architecture with frontend WPF and backend C#

Q1. Difference between association aggregation and composition
Ans. 
Association, aggregation, and composition are types of relationships between classes in object-oriented programming.
• Association is a relationship where two classes are connected, but not dependent on each other.

• Aggregation is a type of association where one class contains another class, but the contained class can exist independently.

• Composition is a stronger form of aggregation where the contained class is part of the
Answered by AI
Add your answer

Q1. Swift interview questions
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

Q1. Details about past experience
Add your answer
Q2. Details about your personal
Add your answer

Q1. Technical round
Add your answer
Q2. About automation testing
Add your answer

Q1. How will you handle challenges
Add your answer
Q2. How do you handle pressure
Add your answer