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
-
Economics & Finance
Articles by Aman Kumar
Page 5 of 7
Program to Find Area of an Ellipse using C++
An ellipse is the locus on all those points in a plane such that the sum of their distance from two fixed points in the plane is constant. Where the fixed point is known as foci, which are sounded by the curve, the fixed line is a directrix, and the constant ratio is the eccentricity of the ellipse. Area of an Ellipse The area of an ellipse is the region enclosed by the ellipse. Which is computed by the following formula: Area = Π∗a∗b Let's discuss the following key points of an ellipse: ...
Read MoreC++ Program to Implement Queue Using Two Stacks
Stack The stack is a linear data structure that follows the Last-In-First-Out (LIFO) operation. Where the element will be added and removed from the top. Following are the stack operations: push (int data): Insertion at top int pop(): Deletion from top Queue The queue is also a linear data structure that follows the First-In-First-Out (FIFO) operation. Where insertions are done at one end (rear) and deletions are done from another end (front). The first element that is entered is deleted first. Following are the stack operations: EnQueue (int data): Insertion at rear end int DeQueue(): Deletion from ...
Read MoreC++ Program to Implement Nearest Neighbour Algorithm
In this article, we will see a C++ program to implement the nearest neighbour algorithm: The nearest neighbour algorithm is a greedy algorithm used to find the approximate solution to the Travelling Salesman Problem (TSP) by computing the minimum cost required to visit all the nodes by traversing across the edges only once. We can implement this algorithm using different data structures like arrays, linked lists, or trees for efficient searching. How Nearest Neighbour Algorithm Works It start at a given point (eg., a city in TSP). Find the nearest unvisited ...
Read MoreWhat is a virtual base class in C++?
Virtual Base ClassVirtual base classes are used in virtual inheritance. It is a way of preventing multiple instances of given classes occurs in the inheritance hierarchy when using multiple inheritance. Why We Use Virtual Base Class? The use of a virtual base class ensures that only one shared instance exists in memory. Virtual base class prevents duplicate base class copies in multiple inheritance. Virtual base classes provide efficient memory management. It avoids redundant copy of base class variables. It ...
Read MoreC++ Program to Implement Bitap Algorithm for String Matching
The bitap algorithm is fuzzy string matching algorithm that is used to find approximate matches between a pattern and a text. The algorithm determines whether a given text contains a substring that is "approximately equal" to a given pattern, where approximate equality is defined in terms of Levenshtein distance (or number of edits) if the substring and pattern are within a given distance k of each other, then according to the algorithm they are equal. It begins by precomputing a set of bitmasks containing one bit for each element of the pattern. So we can do most of the work with ...
Read MoreC++ Program to find kth Smallest Element by the Method of Partitioning the Array
In this articles we will find the kth Smallest Element by Partitioning the Array in C++, let's see input/output scenario: Input / Output Scenario Following is the input-output scenario: Input: arr[] = {7, 2, 1, 6, 8, 5, 3, 4} Output: 3 In the above scenario, after sorting the array, it becomes {1, 2, 3, 4, 5, 6, 7, 8}, so the kth smallest element is 3. An array is a linear data structure that is a collection of elements of the same type in a contiguous memory location. So, to partition a given array, we need to use ...
Read MoreC++ Program to find the maximum subarray sum O(n^2) time (naive method)
A subarray is a contiguous slice of an array, and maintains the order of elements naturally. (i.e., the elements of the subarray occupy consecutive positions). For example, the subarrays of an array {1, 2, 3} are {1}, {1, 2}, {1, 2, 3}, {2}, {2, 3}, and {3}. Input / Output Scenario Let's see the following input/output scenario: Input: arr[] = {1, 4, 5, 3, -1} Output: 13 Explanation: Subarray {1, 4, 5, 3} has the maximum sum 13. Input: arr[] = {1, 2, -3, 4, 5, -1} Output: 9 Explanation: Subarray {1, 2, -3, 4, 5} has the ...
Read MoreC++ Program to Implement B+ Tree
A B+ tree is an m-tree that consists of a root, internal nodes, and leaves. The root may be a leaf or a node with two or more children. A B+ tree is an advanced data structure that extends the B-tree by adding a linked list of leaf nodes. A B+ tree can be a B-tree where each node contains only keys (not key-value pairs). What is B+ Tree? A B+ tree is a self-balancing tree data structure that maintains sorted data and allows for efficient insertion, deletion, and search operations. It differs from a B-tree in the following ways: ...
Read MoreWhy is a C++ pure virtual function initialized by 0?
In C++, the pure virtual function is initialized with = 0 to indicate that it must be overridden by the derived class and has no implementation in the base class. A pure virtual function is a virtual function in C++ declared in a base class that has no implementation within that class. Why Initialize by 0? The following are the reasons for initializing by 0: 1. Mark The Function as "Pure Virtual" The = 0 syntax tells the compiler that the function must be overridden by any derived class. The base ...
Read More