Huffman Tree in Data Structure Huffman Tree in Data Structure is used in Huffman Coding. In this tutorial we will learn about Huffman coding tree in data structure. Questions based on Huffman tree are generally asked in different university examination of Data Structure subject and also in GATE and UGC NET exam. Frequently Asked Questions […]
Floyd Warshall Algorithm Example Floyd warshall algorithm example in C or Data structure is used to find the all pairs shortest path it means shortest path among all the vertices pairs in a given weighted graph. In this tutorial we have explained the floyd warshall algorithm example. Frequently asked Questions Some frequently asked questions are […]
Dijkstra Shortest Path Algorithm in Data Structure Dijkstra shortest path algorithm in data structure is used to find the shortest path from one vertex to all other remaining vertices in the given weighted graph. Dijkstra algorithm is also known as single shortest path algorithm because in this algorithm there is a single source vertex. In […]
AVL Tree Questions AVL tree questions are explained here in this tutorial with solution. AVL Tree questions are generally asked in GATE CSE exam and also in UGC NET exam. AVL tree questions and answers explained in tutorial are also asked in previous year Data Structure Subject of AKTU examination. AVL practice problems discussed in […]
Binary Search Tree Problems and Solution Binary Search Tree Problems are generally asked in GATE ,UGC NET exam and also in University examination. There are two types of problems based on Binary Search Tree. These problems are (1) Construct or Build a Binary Search Tree for given sequence of numbers. (2) What will the Binary […]
Evaluation of Postfix Expression Evaluation of Postfix Expression using Stack is an important topic in Data Structure for AKTU Data Structure Exam. Problem solving questions based on evaluation of postfix expression is generally asked in various university examination and also in competitive examination such as GATE and UGC NET. Today in this tutorial we will […]
Infix to Postfix Conversion using Stack Example Infix to postfix conversion using stack examples with answers are explained here in this tutorial. Infix to postfix conversion using stack based problem solving questions are generally asked in university examination and also in competitive examination. Today in this tutorial we have discussed the procedure to convert a given […]
Implementation of Queue using Linked List Implementation of Queue using Linked List in C is an important topic to be asked in University Examination and also in Competitive exam. In this tutorial we have explained with example how can we implement queue using linked list. Insertion and deletion operations on queue using Linked List are […]
Queue Data Structure Queue Data Structure follow the FIFO principle. In this tutorial we will learn about basic introduction of Queue, different operations on Queue and Array Implementation of Queue is also explained. After the study of this tutorial students can easily answer the following frequently asked questions based on queue. Students also will be […]
Data Structure Imporatnt Questions from Unit 2 Data Structure Important Questions asked from first unit are given in this tutorial. In this tutorial we have discussed the important topics and subtopics data structure first unit as per AKTU Data Structure Subject Syllabus. Data Structure Second Unit Topics and Subtopics As per AKTU Data Structure Syllabus […]
Data Structure Imporatnt Questions from Unit 1 Data Structure Important Questions asked from first unit are given in this tutorial. In this tutorial we have discussed the important topics and subtopics data structure first unit as per AKTU Data Structure Subject Syllabus. Data Structure First Unit Topics and Subtopics As per AKTU Data Structure Syllabus […]
Deletion in Doubly Linked List at the End Deletion in doubly linked list at the end means deleting the last node of a doubly linked list. In this tutorial, we will learn about how can we delete the last node of a doubly linked list. The algorithm and C Program to perform deletion in a […]
Deletion in Doubly Linked List from Beginning Deletion in Doubly Linked List is an important operation. In this tutorial we will understand how can we delete a node in doubly linked list. Questions based on doubly linked list are asked in University examination. Doubly Linked List Deletion can be performed in following cases. (1) Deletion […]
Insertion after a Specified Node in Circular Linked List In this tutorial we will learn about how can we insert a new node after a specified node in circular linked list. We can also understand this as inserting a new node after a given node. To insert a new node after a specified node in […]
Insertion at the End of Circular Linked List In this tutorial we will learn about the Insertion at the end of Circular Singly Linked List. In previous tutorial we have discussed the Insertion in the beginning of circular linked list. Algorithm or steps to insert a new node at the end of circular linked list […]
Operations on Data Structure in C There are various operations that can be perform on Data Structure. Some of them are common data structure operations it means they can be perform on both Linear and non Linear Data Structure. Various operations on Data Structure in C are given below – Traversing Insertion Deletion Search Sorting […]
Circular Queue in Data Structure Circular queue in data structure is the updated version of normal queue in which the last element is connected to the first element of the queue. Circular Queue is an important topic of Data Structure. Questions based on Circular queue are sometime asked in GATE examination. Here we are going […]
Merge Sort and It’s Time Complexity Merge sort and it’s time complexity make it more useable sorting algorithm in Data structure. In this article we will discuss about Merge Sort algorithm and it”s time complexity. Questions based on merge sort are generally asked in GATE(CS) and UGC NET exam. In this tutorial we will discuss […]
Application of Queue in Data Structure Application of Queue in Data Structure belong to many real world situation. As we know that queue is a First in First Out Data Structure. Here in this tutorial we are going to discuss various applications of queue in data structure. A data structure is a way of storing, […]
Char Array in C Char array in C is used for the string type data. Char array in c means character array in c programing. In previous tutorial we have learned some basic concepts of array. In this tutorial we will mainly learn about the character array. Questions based on string and character array are […]