Avid Organics pvt.ltd. Application Development Analyst Interview Questions and Answers

Q1. Sort the array with duplicate values
Ans. 
Use sorting algorithm like quicksort or mergesort to sort the array with duplicate values.
• Use a sorting algorithm like quicksort or mergesort to sort the array efficiently.

• Handle duplicate values by ensuring they are placed in the correct order during sorting.

• Consider using a hashmap to count the frequency of each element before sorting.
Answered by AI
Add your answer

Q1. What is bubbling in js
Ans. 
Bubbling is the process in which an event propagates from the innermost element to the outermost element in the DOM tree.
• Events in JavaScript propagate in two ways: bubbling and capturing.

• Bubbling is the default propagation mode in which an event is first captured by the innermost element and then propagated to the outermost element.

• Bubbling can be stopped using the stopPropagation() method.

• Example: Clicking on a butto...read more
Answered by AI
View 1 more answer
Q2. What is capturing in ES
Ans. 
Capturing in ES refers to the process of binding a value to a variable in a closure.
• Capturing allows a function to access variables outside of its own scope.

• This is achieved by creating a closure that contains the variable and its value.

• Captured variables can be modified by the function, but the original value remains unchanged.

• Example: const x = 5; function foo() { console.log(x); } foo(); // Output: 5

• Example: functio...read more
Answered by AI
View 1 more answer

Page development in 2 hrs

Q1. Tell me about yourself.
Add your answer

Q1. Related to iso& certification
Add your answer

Q1. About industrial unit in surat
Add your answer

It was a one hour hackerrank coding test where we need to solve two coding questions.

Q1. It was mostly based on HTML, CSS, Javascript
Add your answer

Q1. It was 2nd technical round where I was grilled on topics like DBMS, OOPS, DSA and coding.
Add your answer

Q1. It was an interview round with the Vice President. Was more of a casual talk.
Add your answer

Q1. - Coin change Variation - Behaviour based questions - Puzzle
Add your answer

Q1. - 0-1 knapsack and print its weight - Past Experience and Project
Ans. 
0-1 knapsack problem involves selecting items to maximize value within a weight constraint.
• 0-1 knapsack is a classic optimization problem where items have a weight and value, and the goal is to maximize the total value while staying within a weight limit.

• Dynamic programming is commonly used to solve the 0-1 knapsack problem efficiently.

• Example: Given items with weights [2, 3, 4, 5] and values [3, 4, 5, 6], and a knapsa...read more
Answered by AI
Add your answer

Q1. - SQL Joins - Rest API Paging - Frontend Questions - Past Experience
Add your answer

Q1. Architecture questions
Add your answer

Q1. Behaviour questions
Add your answer

.net online coding 100 mins