Dentsu Aegis Network Softwaretest Engineer Interview Questions and Answers

Q1. Some basic inheritance and overloading questions
Add your answer
Q2. Prepare for interface with same methods in one base class
Add your answer

Q1. What is binary search
Ans. 
Binary search is a search algorithm that finds the position of a target value within a sorted array.
• Binary search works by repeatedly dividing the search interval in half.

• It compares the target value with the middle element of the array.

• If the target value matches the middle element, the position is returned.

• If the target value is less than the middle element, the search continues on the lower half of the array.

• If the ...read more
Answered by AI
Add your answer
Q2. What is algorithm based on graph
Ans. 
An algorithm based on graph is a set of instructions designed to solve problems related to graphs.
• Graph algorithms are used to solve problems related to graphs, such as finding the shortest path between two nodes, detecting cycles, and determining connectivity.

• Some common graph algorithms include Dijkstra's algorithm for finding the shortest path, Kruskal's algorithm for finding the minimum spanning tree, and Depth Fir...read more
Answered by AI
Add your answer

Q1. What is scheduling
Ans. 
Scheduling is the process of planning and organizing tasks or resources over a period of time.
• Scheduling involves determining the start and end times for tasks or activities.

• It helps in optimizing resources and ensuring efficient use of time.

• Examples include project scheduling, employee scheduling, and appointment scheduling.
Answered by AI
Add your answer
Q2. What is round robin
Ans. 
Round robin is a scheduling algorithm that assigns equal time slices to each process in a circular queue.
• Each process is given a small unit of time to execute before being moved to the end of the queue.

• It ensures fairness by preventing a single process from monopolizing the CPU.

• Example: In a round robin scheduling with time quantum of 10ms, processes A, B, and C will each get 10ms of CPU time before moving to the end o
Answered by AI
Add your answer

Q1. Dot net related stuffs
Add your answer
Q2. Dependency injection
Add your answer

Built an app using dot net and angular

Q1. Basic JavaScript and React.js questions
Add your answer
Q2. Questions on functions, hooks and DOM
Add your answer
Q3. Questions on SSR
Add your answer
Q4. Questions on strings and arrays
Add your answer

Api related questions

Q1. What is Indexing in Mysql
Ans. 
Indexing in MySQL is a technique to improve the performance of database queries by creating a data structure that allows for faster data retrieval.
• Indexes are created on one or more columns of a table.

• They help in speeding up the search, sorting, and joining of data.

• Indexes can be created using different algorithms like B-tree, hash, or bitmap.

• Using indexes appropriately can significantly enhance query performance.

• Exam...read more
Answered by AI
Add your answer
Q2. Opps concepts in php
Ans. 
Object-oriented programming concepts in PHP
• Encapsulation: bundling data and methods together in a class

• Inheritance: creating new classes based on existing ones

• Polymorphism: using a single interface to represent different types

• Abstraction: hiding unnecessary details and exposing only essential features

• Class: blueprint for creating objects

• Object: instance of a class

• Method: function defined inside a class

• Property: variabl
Answered by AI
Add your answer

Q1. What is your long term goal
Add your answer

In this round, there is aptitude & 2 coding questions.

Q1. Java oops concept
Add your answer
Q2. Again Live coding test
Add your answer

Q1. Discussion about salary and company
Add your answer

Q1. Regarding React-Native Questions
Add your answer

Q1. Salary discussion
Add your answer