Azuga Telematics Technical Support Analyst Interview Questions and Answers

Logical Reasoning, Questions on distances, Questions on directions

1- Difference between array list and linked list.
2- Reverse the linked list

1-Difference between Arraylist and Linked list.
2-Check if strings are anagram.

Good technical round, you can manage, mainly Java questions used to come

Q1. HR round is also good package discussion will happen
Add your answer
Q2. Company personal so kept secret
Add your answer

Hackerrank algorithms and ds test

Q1. Technical on java and aws
Add your answer

Q1. About company values
Add your answer

Q1. UML class diagram
Ans. 
UML class diagram is a visual representation of classes, attributes, methods, and relationships in a system.
• Classes are represented as boxes with three compartments for class name, attributes, and methods.

• Attributes are listed in the second compartment with their data types.

• Methods are listed in the third compartment with their parameters and return types.

• Relationships between classes are shown using lines with arrows ...read more
Answered by AI
Add your answer

Competency based questions

Know your resume and your basics

Know class diagrams. Very Huge for workday.

Some kind of cognitive test. Test was easy but a bit practice is necessary. 40 qstns in 20 mins.
Types of qstns :
1. comparing images and find the odd one.(around 10 qstns).
2. question on ratios.
3. Qstns on pi chart and bar graphs (like what is the percentage of certain portion out of whole).
4. Qstns on average (basic).
Advice: prepare the resources shared by HR.

Q1. Questions on Linux, java threads, tomcat servers, basic java, networking, tcp/ip, osi model,smtp.
Add your answer

Q1. Techno-managerial round Rapid fire qstns, landed some out of my experience qstns. Again qstns on multithreading, networking, smtp, linux commands, resetting servers?, java threads, dead locks, thread logs...read more
Add your answer

Q1. Types of data structure and their time complexities
Ans. 
Data structures are used to organize and store data efficiently. Time complexity is the measure of efficiency.
• Arrays - O(1) for access, O(n) for search and insertion

• Linked Lists - O(n) for access, O(1) for insertion and deletion

• Stacks - O(1) for access, insertion and deletion

• Queues - O(1) for access, insertion and deletion

• Trees - O(log n) for access, insertion and deletion

• Hash Tables - O(1) for access, insertion and de
Answered by AI
Add your answer
Q2. Types of Binary Tree
Ans. 
Binary trees are classified based on the number of children each node can have.
• Full binary tree: every node has either 0 or 2 children

• Complete binary tree: all levels except possibly the last are completely filled, and all nodes are as far left as possible

• Perfect binary tree: all internal nodes have two children and all leaf nodes are at the same level

• Balanced binary tree: the difference in height between the left and ...read more
Answered by AI
Add your answer

Q1. Based on DSA, OOPS
Add your answer

Q1. Based on Projects in Resume
Add your answer

Q1. Technical Discussion about earlier projects
Add your answer

Q1. Salary Discussion
Add your answer