Technical Interview Questions
In BFS algorithm, Queue data structure is used. In DFS algorithm, Stack data structure is used. Both BFS (Breadth-First Search) and DFS (Depth-First Search) algorithms can be implemented using various data structures. Here are the commonly used ones: Queue for BFS: BFS typically uses a queue data structure to keep track of the nodes to … Read more
For the graph implementation, following data structures are used. In sequential representation, Adjacency matrix is used. In Linked representation, Adjacency list is used. In graph implementation, various data structures are commonly used to represent the graph and facilitate operations on it efficiently. Some of the key data structures used in graph implementation include: Adjacency Matrix: … Read more
Path: A Path is the sequence of adjacent vertices connected by the edges with no restrictions. Cycle: A Cycle can be defined as the closed path where the initial vertex is identical to the end vertex. Any vertex in the path can not be visited twice Circuit: A Circuit can be defined as the closed … Read more
A graph G can be defined as an ordered set G(V, E) where V(G) represents the set of vertices and E(G) represents the set of edges which are used to connect these vertices. A graph can be seen as a cyclic tree, where the vertices (Nodes) maintain any complex relationship among them instead of having … Read more
Applications of Tree- data structure: The manipulation of Arithmetic expression, Symbol Table construction, Syntax analysis Hierarchal data model Trees are a fundamental data structure in computer science with a wide range of applications. Here are some common applications of tree data structures: Binary Search Trees (BST): Used in databases and file systems for efficient searching, … Read more