Technical Interview Questions
Depth-first search (DFS) is an algorithm that is based on LIFO (last-in, first-out). Since recursion is implemented with LIFO stack data structure, the nodes are in a different order than in BFS. The path is stored in each iteration from root to leaf nodes in a linear fashion with space requirement. The Depth-first Search (DFS) … Read more
A breadth-first search (BFS) algorithm is used to search tree or graph data structures. It starts from the root node, proceeds through neighbouring nodes, and finally moves towards the next level of nodes. Till the arrangement is found and created, it produces one tree at any given moment. As this pursuit is capable of being … Read more
is a computer algorithm in AI that is extensively used for the purpose of finding paths or traversing graphs – to obtain the most optimal route between nodes. It is widely used in solving pathfinding problems in video games. Considering its flexibility and versatility, it can be used in a wide range of contexts. A* … Read more
The Turing test is a method that tests a machine’s ability to match human-level intelligence. It is only considered intelligent if it passes the Turing test. However, a machine can be considered as intelligent even without sufficiently knowing how to mimic a human, in specific scenarios. The Turing Test is a measure of a machine’s … Read more
Tower of Hanoi essentially is a mathematical puzzle that displays how recursion is utilised as a device in building up an algorithm to solve a specific problem. The Tower of Hanoi can be solved using a decision tree and a breadth-first search (BFS) algorithm in AI. With 3 disks, a puzzle can essentially be solved … Read more