Depth First Search Algorithm for Graph Depth First search algorithm is another important algorithm for Graph Traversal. Sometimes DFS, DFS-based Problem is asked in the GATE and UGC NET exams. We have explained the Depth First Search Algorithm with examples here in this tutorial. After reading this tutorial, students will be able to solve the problem […]
Breadth First Search Algorithm The Breadth First Search algorithm is a systematic search algorithm for graph or tree data structures. Breadth-first Search is sometimes also known as breadth-first traversal. Questions based on the Breadth First Search algorithm are generally asked in the GATE(CS) and UGC NET exams every year. GATE and UGC aspirants are suggested to prepare this topic very […]
Types of Hashing in Data Structure We discussed the Hashing in Data Structure in previous data structure tutorial. In this tutorial we will learn about various types of hashing in data structure. Hashing based questions are asked in GATE and UGC NET exam are also explained in this tutorial. After reading this tutorial students will […]
Hashing in Data Structure Hashing in data structure is an important concepts. A computer science students must have the the knowledge of hashing concept. Hashing in data structure is also an important topic for GATE(CS/IT) and UGC NET exam. Today here in this tutorial we have explained Hashing, Hash Function and Types of Hash Function […]
Kruskal’s Algorithm and Example Kruskal’s Algorithm in data structure is another greedy approach used to find the cost of spanning tree. Generally it is used to find the minimum spanning tree in the given Graph. Problem based on Kruskal’s algorithm is generally asked in GATE(CS/IT) and UGC NET exam. In this tutorial we have explained […]
Prim’s Algorithm to find MST Prim’s algorithm is a greedy algorithm used to find the minimum spanning tree in a given Graph. Problem based on Prim’s algorithm is mostly asked in GATE(CS/IT) Exam. Students preparing for GATE and UGC NET exam. We have explained the Prim’s Algorithm to find minimum cost spanning tree with Example […]
Minimum Spanning Tree Example with Solution Minimum Spanning Tree is an important part of Graph Data Structure. Basic Concepts of Minimum Spanning Tree with Example and Solution are explained here in this tutorial. Minimum Spanning Tree is also an important topic for GATE(CS/IT) and UGC NET exam. GATE aspirants are advised to prepare minimum spanning […]
What is Heap Data Structures ? Heap Data Structures is a Tree Data Structure in which tree is a Complete Binary Tree. Explanation of Complete Binary Tree with example is explained in next section of this tutorial. Questions based on Heap are generally asked in GATE(CS/IT) and UGC NET exam. Students are also suggested to […]
Data Structure Notes for GATE Exam Data structure notes for GATE(CS/IT) and UGC Net exams are provided here in this post. Data Structure is an important subject of the Computer Science Branch. Data Structure provides a way to organize the data in an efficient manner so that data items can be used effectively when needed. […]
Tree Traversal in Data Structure Tree traversal in data structure is an important topic from exam point of view. There are three techniques of traversing a tree in Data Structure. These tree traversing techniques in Data Structure are in order traversing, pre order traversing and post order traversing techniques. Sometime questions based on tree traversal […]
