Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Data Structure Articles
Page 164 of 164
Introduction to Pattern Searching Algorithms
Pattern Searching algorithms are used to find a pattern or substring from another bigger string. There are different algorithms. The main goal to design these type of algorithms to reduce the time complexity. The traditional approach may take lots of time to complete the pattern searching task for a longer text. Here we will see different algorithms to get a better performance of pattern matching. In this Section We are going to cover. Aho-Corasick Algorithm Anagram Pattern Search Bad Character Heuristic Boyer Moore Algorithm Efficient Construction of Finite Automata kasai’s Algorithm Knuth-Morris-Pratt Algorithm Manacher’s Algorithm Naive Pattern Searching Rabin-Karp ...
Read MoreIntroduction to Searching Algorithms
The searching algorithms are used to search or find one or more than one element from a dataset. These type of algorithms are used to find elements from a specific data structures. Searching may be sequential or not. If the data in the dataset are random, then we need to use sequential searching. Otherwise we can use other different techniques to reduce the complexity. In this Section We are going to cover − Binary Search Exponential Search Interpolation Search Jump Search Linear Search Ternary Search
Read MoreIntroduction to Miscellaneous Problems
We have seen different problems in different sections. There are some other problems which are not categorized. In this section we will see some of the random problems. In this Section We are going to cover. Adding base n numbers Babylonian method to find the square root Factorial of a large number Check if a given point lies inside a Polygon Check Perfect Square or Not Check if given four points form a Square Check if two given sets are disjoint? Check if two line segments intersect Check whether a given point lies inside a Triangle Connect n ropes ...
Read MoreIntroduction to Graph Algorithms
The graph is a non-linear data-structure, which consists finite number of nodes and a set of edges which are used to connect a pair of nodes. The graphs are used to solve some real-time problems to represent network etc. In different social networks, the graphs are used. In this Section We are going to cover − Bi-Connected Graph Checking Breadth First Search (BFS) for a Graph Bridges in a Graph Check if a given graph is tree or not Connectivity in a directed graph Depth First Search (DFS) for a Graph Detect Cycle in a an Undirected Graph Detect ...
Read MoreIntroduction to Algorithms for Mathematical Problems
In this section we will see some common mathematical problems and their possible way solve using different computational algorithms. We will see how to solve differential equations, integrations and some other complex mathematical problems. In this Section We are going to cover − Convert Infix to Postfix Expression Convert Infix to Prefix Expression Evaluate Postfix Expression Secant method to solve non-linear equation Trapezoidal Rule for definite integral Simpson's 1/3 Rule for definite integral Linear Regression Lagrange Interpolation Runge-Kutta 4th order rule for differential equation Lucky Numbers Decimal to Binary conversion Find LCM of two numbers Find ...
Read More