Before Moving Ahead with the Data structure tutorials,Lets have a look at what we will learn in these Topics.
By the end of this Subject, we will be able to learn:
What is mean by data structure ? Lets have brief introduction about data structure, Lets us takes an example ,in our room we have different Read More »
What is An Algorithm? An algorithm is a sequence of unambiguous instructions which can be used to solve the problem . In addition every algorithm Read More »
Overview of Recursion: A function must be able to call itself. For example, let us consider the function factr() shown below, which computers the factorial Read More »
Differences between recursion and iteration: Both involve repetition. Both involve a termination test. Both can occur infinitely. You may be interested in: Data Structures Read More »
in The Previous Post We have Learned What is algorithm? In Computer Science we have some problem which we have to solve, but before writing Read More »
In This section lets understand the Basic concept of NP Hard & NP Complete Algorithm NP-Hard and NP-Complete Problems An algorithm A is of Read More »
In this Post, the list data structure is presented. This structure can be used as the basis for the implementation of other data structures (stacks, Read More »
Linked List Concepts A linked list is a non-sequential collection of data items. It is a dynamic data structure. For every data item in a Read More »
Single Linked List In Brief: A linked list allocates space for each element separately in its own block of memory called a “node”. The list Read More »
Another alternative is to allocate the nodes in blocks. In fact, if you know the maximum size of a list a head of time, you Read More »
A double linked list is a two-way list in which all nodes will have two links. This helps in accessing both successor node and predecessor Read More »
Concept: It is just a single linked list in which the link field of the last node points back to the address of the first Read More »
Concept: A circular double linked list has both successor pointer and predecessor pointer in circular manner. The objective behind considering circular double linked list is Read More »
The major disadvantage of doubly linked lists (over singly linked lists) is that they require more space (every node has two pointer fields instead of Read More »
Data structure Stack:There are certain situations in computer science that one wants to restrict insertions and deletions so that they can take place only at Read More »
An algebraic expression is a legal combination of operators and operands. Operand is the quantity on which a mathematical operation is performed. Operand may be Read More »
A queue is another special kind of list, where items are inserted at one end called the rear and deleted at the other end called Read More »
A more efficient queue representation is obtained by regarding the array Q[MAX] as circular. Any number of items could be placed on the queue. This Read More »
In the preceding section we saw that a queue in which we insert items at one end and from which we remove items at the Read More »
A priority queue is a collection of elements such that each element has been assigned a priority and such that the order in which elements Read More »
A data structure is said to be linear if its elements form a sequence or a linear list. Previous linear data structures that we have Read More »
Binary Tree Traversal Techniques: A tree traversal is a method of visiting every node in the tree. By visit, we mean that some type of Read More »
The linked representation of any binary tree has more null links than actual pointers. If there are 2n total links, there are n+1 null links. Read More »
A binary search tree is a binary tree. It may be empty. If it is not empty then it satisfies the following properties: Every element Read More »
If in a tree, the outdegree of every node is less than or equal to m, the tree is called general tree. The general tree Read More »
There is a one-to-one mapping between general ordered trees and binary trees. So, every tree can be uniquely represented by a binary tree. Furthermore, a Read More »
Search involves visiting nodes in a tree in a systematic manner, and may or may not result into a visit to all nodes. When the Read More »
Graph G is a pair (V, E), where V is a finite set of vertices and E is a finite set of edges. We will Read More »
A spanning tree for a connected graph is a tree whose vertex set is the same as the vertex set of the given graph, and Read More »
Many graph algorithms require one to systematically examine the nodes and edges of a graph G. There are two standard ways to do this. They Read More »
There are basically two aspects of computer programming. One is data organization also commonly called as data structures. Till now we have seen about data Read More »
This is the simplest of all searching techniques. In this technique, an ordered or unordered list will be searched one by one from the beginning Read More »
If we have ‘n’ records which have been ordered by keys so that x1 < x2 < … < xn . When we are given Read More »
The bubble sort is easy to understand and program. The basic idea of bubble sort is to pass through the file sequentially several times. In Read More »
Selection sort will not require no more than n-1 interchanges. Suppose x is an array of size n stored in memory. The selection sort algorithm Read More »
The quick sort was invented by Prof. C. A. R. Hoare in the early 1960’s. It was one of the first most efficient sorting algorithms. Read More »
Heap is a data structure, which permits one to insert elements into a set and also to find the largest element efficiently. A data structure, Read More »
Here on design and analysis of algorithms today’s it is going to be an overview of the course and i want to introduce you to the main Read More »
Dijkstra’s algorithm finds the shortest paths from a given node to all other nodes in a graph Initially, Mark the given node as known (path Read More »
The Dynamic Programming (DP) is the most powerful design technique for solving optimization problems. It was invented by mathematician named Richard Bellman inn 1950s. The DP Read More »
DIVIDE AND CONQUER ALGORITHM In this approach ,we solve a problem recursively by applying 3 steps DIVIDE-break the problem into several sub problems of smaller Read More »
This is a greedy algorithm. A greedy algorithm chooses some local optimum (i.e. picking an edge with the least weight in a MST). Kruskal’s Read More »
A given graph can have many spanning trees. From these many spanning trees, we have to select a cheapest one. This tree is called as Read More »
Copyright © 2023 | ExamRadar. | Contact Us | Copyright || Terms of Use || Privacy Policy