GirnarSoft Team Leader (Nontechnical) Interview Questions and Answers

To find the shortest path in a graph stored in SQL, use algorithms like Dijkstra's or A* with SQL queries for traversal.

• Use Dijkstra's algorithm for weighted graphs to find the shortest path efficiently.

• For unweighted graphs, consider using Breadth-First Search (BFS).

• Store graph edges in a table with columns for source, destination, and weight.

• Example SQL query: SELECT * FROM edges WHERE source = 'A' AND destination = ...read more

Question on internal working of hashmap, multi-threading, DSA, and coding.

• HashMap is a data structure that stores key-value pairs and uses hashing to retrieve values quickly.

• Multi-threading is the ability of a CPU to execute multiple threads concurrently.

• DSA stands for Data Structures and Algorithms, which are fundamental concepts in computer science.

• Coding involves writing instructions in a programming language to cre...read more

I am drawn to Incedo for its innovative approach and growth opportunities, aligning with my career aspirations in technology consulting.

• Incedo's commitment to innovation resonates with my passion for technology and problem-solving.

• I admire Incedo's collaborative culture, which I experienced in my previous role at XYZ Corp, where teamwork led to a successful project launch.

• My future plan includes advancing my skills in ...read more