Hexaware Technologies Software Developer Interview Questions, Process, and Tips

1:30 hours duration for aptitude

Q1. Basic questions in communication
Add your answer

Q1. Introduction about yourself
Add your answer
Q2. Ready to relocate
Add your answer

Qualitative analysis questions

Q1. Project related questions
Add your answer
Q2. Oops concepts and java related questions
Add your answer

Java and Selenium mcq question

Q1. Framework related
Add your answer

Q1. Nothing just salary discussion
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Can you explain Bipolar Junction Transistors (BJTs)?
Ans. 
BJTs are three-terminal semiconductor devices used for amplification and switching of electronic signals.
• BJTs have three regions - emitter, base, and collector.

• They can be NPN or PNP type, depending on the arrangement of semiconductor materials.

• BJTs are current-controlled devices, where a small current at the base terminal controls a much larger current between the collector and emitter.

• Common BJT examples include 2N22
Answered by AI
Add your answer
Q2. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Ans. 
Graph coloring problem where vertices need to be colored with two colors such that no adjacent vertices share the same color.
• Check if the graph can be colored using two colors without any adjacent vertices sharing the same color.

• Use graph coloring algorithms like Greedy Coloring or Backtracking to solve the problem.

• If there are odd-length cycles in the graph, it is not possible to color the graph with two colors.

• If the...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. Can you explain in detail about Stacks and Graphs?
Ans. 
Stacks are data structures that follow the Last In First Out (LIFO) principle, while Graphs are data structures that consist of nodes and edges to represent relationships.
• Stacks are used for implementing functions, backtracking, and expression evaluation.

• Graphs are used for representing networks, social connections, and shortest path algorithms.

• Stacks can be implemented using arrays or linked lists.

• Graphs can be direct...read more
Answered by AI
Add your answer
Q2. 
Rat in a Maze: All Paths Problem
You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...read more
Ans. 
Find all possible paths for a rat in a maze from start to finish.
• Use backtracking to explore all possible paths in the maze.

• At each cell, check if it is a valid move and mark it as part of the path.

• Explore all four directions (up, down, left, right) recursively.

• When reaching the destination cell, add the path to the result.

• Return all valid paths found in the maze.
Answered by AI
Add your answer