Baazi Games Quality Assurance Engineer 3 Interview Questions and Answers

If you are a fresher , then this is for you else almost no coding test for experienced candidates.

Q1. Javascript basics, Angular react general questions depends upon profile.
Add your answer

Q1. They asked general questions related to some hectic situation faced in previous company / project..
Add your answer

Quant, logical reasoning, mathematics

Q1. Access modifiers
Add your answer
Q2. Diff between abstract class and interface Difference between array and array list Difference between method overloading and overriding Pillars of oops Deadlock Normalisation
Ans. 
Abstract class is a class with abstract methods, interface is a contract with only abstract methods. Array is fixed size, ArrayList is dynamic. Method overloading is same method with different parameters, overriding is redefining a method. OOP pillars are inheritance, encapsulation, polymorphism, abstraction. Deadlock is a situation where two or more processes are unable to proceed because each is waiting for the other...read more
Answered by AI
Add your answer

Easy applitute question with 1 coding question at the end

Q1. String builder vs string buffer
Ans. 
String builder is faster but not thread-safe, while string buffer is slower but thread-safe.
• String builder is recommended for single-threaded applications for better performance.

• String buffer is recommended for multi-threaded applications to ensure thread safety.

• Example: StringBuilder sb = new StringBuilder(); StringBuffer sbf = new StringBuffer();
Answered by AI
Add your answer
Q2. Final keyword in oops
Ans. 
The final keyword in OOP is used to restrict the user from changing the value of a variable, overriding a method, or inheriting from a class.
• Final variable: value cannot be changed once assigned

• Final method: cannot be overridden in child classes

• Final class: cannot be inherited by other classes
Answered by AI
Add your answer
Q3. Bsf graph explanation
Ans. 
BSF graph explanation
• BFS (Breadth-First Search) is a graph traversal algorithm that explores all the neighbor nodes at the present depth before moving on to the nodes at the next depth.

• It uses a queue data structure to keep track of the nodes to visit next.

• BFS is often used to find the shortest path in an unweighted graph.

• Example: BFS can be used to find the shortest path in a maze from the starting point to the exit.
Answered by AI
Add your answer