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
Articles by AYUSH MISHRA
Page 11 of 12
C++ Program to Return Quadrants in which a given Coordinates Lies
Cartesian-coordinate System and Quadrants The cartesian-coordinate system is divided into four Quadrants: Quadrant I, Quadrant II, Quadrant III, and Quadrant IV. In this article, we are going to learn how we can determine the quadrant in which given points i.e., x and y, lie. Problem Description We are given the position of a point (x, y), and we have to determine in which quadrant this point lies. Example Input: (-3, 2) Output: Quadrant II Input: (2, 5) Output: Quadrant I Input: (2, -4) Output: Quadrant IV Input: (-6, -3) Output: Quadrant III Using Conditional Quadrant Identification Approach ...
Read MoreParallelogram Star Pattern using C++
When we start learning to code, practicing star patterns is one of the best ways to improve logic building. One of the engaging patterns is the parallelogram pattern. In this article, we are going to learn how to print a Parallelogram Star Pattern using C++. What is Parallelogram Pattern? A parallelogram pattern is a geometrical arrangement of stars in a parallelogram shape. The stars are printed in such a manner that if we draw a closed figure on the boundary of the printed pattern, it will resemble a parallelogram. Each row is shifted with space, which creates a diagonal ...
Read Morecheck if a given array represent min-heap or not
A Heap is a Tree-based data structure in which the tree is a complete binary tree. Binary heap is of two types max heap and min heap. A min-heap is a tree-like structure in which the value of the parent node should always be less than both of its left and right child and follow this property recursively for all nodes until it reaches to leaf node. According to this property, the root node of the min-heap has the smallest value. In this article, we are going to check whether an array represents a min-heap or not. Problem Description We ...
Read MoreC++ Program for Sum of Infinite Terms in GP
What is Geometric Progression (GP)? Geometric Progression (GP) is a sequence of numbers where each term is generated by multiplying the previous term by a constant value. This constant value in GP is known as the common ratio. In this article, we are going to discuss how to calculate the sum of infinite terms in a GP using different approaches in C++. Note: The important condition to remember is that a positive valid sum of infinite GP is only possible if the absolute of the common value (r) is less than 1, i.e., ∣r∣ < 1. Methods to Calculate ...
Read MoreHow to Generate a Random Password using Ruby?
When we want to protect our online accounts or protect sensitive data, we use a strong password. Creating a secure, random password is a little complex but in Ruby, we can easily and quickly generate a random password. In this article, we are going to discuss how we can generate a random password using ruby, different approaches, example codes, and outputs. Generate a Random Password Using Ruby Using Ruby's rand Method Using the SecureRandom Module Custom Password Generator Since the code generates random passwords, ...
Read MoreC++ Program to check if a Number is Harshad Number
A Harshad number is a special type of number. A Harshad number or Niven number is a number that is completely divisible by the sum of its digits without leaving any remainder. In this article, we are going to learn how we can check whether a given number is a Harshad number or not. Problem Description We are given a number and we have to return true if the given number is Harshad or Niven number and false if the given number is not a Harshad number. Example 1 Input: 108 Output: yes Explanation: The sum ...
Read MoreRoadmap of Becoming an Elasticsearch Engineer
Elasticsearch is one of the emerging fields that is used for real-time data analysis, log and data analytics, full-text search, etc. Elasticsearch engineers are responsible for designing, implementing, and maintaining Elasticsearch clusters, ensuring efficient data retrieval, and optimizing search performance. In this article, we are going to discuss how to become an Elasticsearch engineer, what key skills are required, and what future opportunities are.Elasticsearch EngineerElasticsearch is an open-source, distributed search and analytics engine built on top of Apache Lucene. It allows for real-time search capabilities and provides horizontal scalability, high performance, and easy integration with various data sources. Elasticsearch is commonly ...
Read MoreCheck if a given String is palindrome using two pointer in C++
A palindrome is a word, phrase, number, or other sequence of characters that reads the same from both backward and forward sides. In strings, the palindrome strings are those strings that can be read the same from both left and right sides. In this article, we are going to learn how we can check if a given string is palindrome or not using the two-pointer technique in C++. Problem We are given a string, and we have to check if it is palindrome or not using the two-pointer method in C++. Example 1 ...
Read MoreRoadmap of Becoming a QA Engineer
QA Engineers are those who handle bugs and glitches that we face while using any application or website. The Job of a QA engineer is to handle bugs in any application or website. QA engineers make sure that the software that reaches the people is error-free and bug-free. They make sure that users have a smooth experience with applications. In this article, we are going to discuss the roadmap to becoming a QA engineer. What is Quality Assurance?Quality assurance is the method of making sure that products, especially software, work for which they are manufactured. QA engineers test software to find ...
Read MoreHow to Add Elements to the End of an Array in PHP
Arrays are linear data structures used to handle data in programming. Sometimes while dealing with arrays we need to add new elements to an existing array.In this article, we will discuss several methods to add elements to the end of an array in PHP, complete with code examples, outputs, and an analysis of the time and space complexity of each approach. Following are different approaches to adding elements to an array − Using square brackets [] We add an element to the end of an array in PHP is by using square brackets []. This syntax is only suitable when ...
Read More