Category: 02. DSA Using Java

Overview Recursion refers to a technique in a programming language where a function calls itself. The function which calls itself is called a recursive method. Characteristics A recursive function must posses the following two characteristics Learn Java in-depth with real-world projects through our Java certification course. Enroll and become a certified expert to boost your career. Recursive Factorial…

Sorting refers to arranging data in a particular format. Sorting algorithm specifies the way to arrange data in a particular order. Most common orders are numerical or lexicographical order. Importance of sorting lies in the fact that data searching can be optimized to a very high level if data is stored in a sorted manner.…

Search refers to locating a desired element of specified properties in a collection of items. We are going to start our discussion using following commonly used and simple search algorithms. Sr.No Technique & Description 1 Linear SearchLinear search searches all items and its worst execution time is n where n is the number of items.…

Overview Graph is a datastructure to model the mathematical graphs. It consists of a set of connected pairs called edges of vertices. We can represent a graph using an array of vertices and a two dimentional array of edges. Important terms Basic Operations Following are basic primary operations of a Graph which are following. Learn Java in-depth…

Overview Heap represents a special tree based data structure used to represent priority queue or for heap sort. We’ll going to discuss binary heap tree specifically. Binary heap tree can be classified as a binary tree with two constraints − Basic Operations Following are basic primary operations of a Min heap which are following. Learn Java in-depth…

Overview HashTable is a datastructure in which insertion and search operations are very fast irrespective of size of the hashtable. It is nearly a constant or O(1). Hash Table uses array as a storage medium and uses hash technique to generate index where an element is to be inserted or to be located from. Hashing…

Overview Tree represents nodes connected by edges. We’ll going to discuss binary tree or binary search tree specifically. Binary Tree is a special datastructure used for data storage purposes. A binary tree has a special condition that each node can have two children at maximum. A binary tree have benefits of both an ordered array…

Overview Priority Queue is more specilized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by key value so that item with the lowest value of key is at front and item with the highest value of key is at rear…

Overview Queue is kind of data structure similar to stack with primary difference that the first item inserted is the first item to be removed (FIFO – First In First Out) where stack is based on LIFO, Last In First Out principal. Queue Representation Learn Java in-depth with real-world projects through our Java certification course. Enroll and become…

Ordinary airthmetic expressions like 2*(3*4) are easier for human mind to parse but for an algorithm it would be pretty difficult to parse such an expression. To ease this difficulty, an airthmetic expression can be parsed by an algorithm using a two step approach. Infix Notation Normal airthmetic expression follows Infix Notation in which operator…