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
Server Side Programming Articles
Page 1651 of 2109
Golang program to add items into the hash collection
In Golang, we can use a simple indexing method and slicing method to add items to the hash collections. A hash function is used for retrieving and storing the data. In this article are going to see two different examples where we are going to use the above-mentioned methods to add items to a hash collection in go programming language. Syntax func make ([] type, size, capacity) The make function in go language is used to create an array/map it accepts the type of variable to be created, its size and capacity as arguments. Algorithm Import the required ...
Read MoreWhat is the difference between a weak reference and an unowned reference?
Understanding iOS memory management is essential for iOS and macOS development. The concept of weak self and unowned self is challenging to understand, especially for beginners. ARC (Automatic Reference Counting) may have solved many problems for us. Swift still requires that you manage references a lot of the time when you are not working with value types. ARC or Automatic Reference Counting Automatic Reference Counting (ARC) is used for tracking and managing the app’s memory usage. In most cases, this means that memory management “just works” in Swift, and you don’t need to think about memory management yourself. ARC automatically ...
Read MoreHow to add group-level summary statistics as a new column in Pandas?
Pandas is an extremely popular data handling library used frequently for data manipulation and analysis. The Pandas library offers powerful features for analysis such as grouping to analyze various samples having some common features. In this article, we are going to learn how to add these summary statistics obtained through groups of samples as a new column in our existing Pandas dataframes. NOTE − The code in this article was run on a jupyter notebook. Let's begin by importing Pandas. import pandas as pd ExampleFollowing is the sample d ataset we will work on. It has 3 columns storing ...
Read MoreHow to add header row to a Pandas Dataframe?
Pandas is a super popular data handling and manipulation library in Python which is frequently used in data analysis and data pre-processing. The Pandas library features a powerful data structure called the Pandas dataframe, which is used to store any kind of two-dimensional data. In this article we will learn about various ways to add a header row (or simply column names) to a Pandas dataframe. NOTE − The code in this article was tested on a jupyter notebook. We will see how to add header rows in 5 different ways − Adding header rows when creating a ...
Read MoreProgram to check the similarity of given two triangles
In this problem, we will learn to check the similarity of two given triangles, which have many real-world use cases from the viewpoint of a programmer. To construct and manage 2D and 3D models of things, CAD systems are utilized, and one key function is the capability to compare two triangles. For instance, engineers working in design and construction may need to make that the foundational measurements of a building match the blueprint. Engineers can rapidly evaluate whether the angles and sides of the foundation game the layout by utilizing a CAD tool that has a built-in feature to check ...
Read MoreNumber of triangles in a plane if no more than two points are collinear
Let us see how to calculate the number of triangles in a plane with n number of points given, with the constraint that not more than two points are collinear. Computing the number of triangles in a plane with no more than two collinear points is a typical problem in computational geometry, and it is used in computer graphics, image processing, and other areas of computer science. While creating a 2D image from a 3D scene in 3D graphics, for instance, the issue of counting triangles in a plane with no more than two points collinear can come up. The ...
Read MoreDifferent ways to represent N as the sum of K non-zero integers
The problem “Different ways to represent N as the sum of K non-zero integers” has many real-world use cases. Cryptography − In cryptography, specific cryptographic methods are designed using the concept of encoding a number N as the sum of K non-zero integers. Representing an integer N as the sum of K non-zero integers might appear as a subproblem in different optimization issues in the context of optimization methods. Machine learning − In machine learning, feature vectors that depict the distribution of data points can be created by using the problem of representing an integer N as the sum of ...
Read MoreCompute power of power k times % m
Our objective to compute power of power k time % m, with the values of base, k and m provided as input − Look at the image above. Have you ever tried to compute such a problem? Let’s try it. Compute the power of power k times and then find modulo with m. Explanation In this question, x, k, and m are given. Compute ${x^{x{^x{^{^.{^{^.{^{^.}}}}}}}}}$ up to k times and then modulo with m. Let’s understand with an example. Given, x = 2, k = 4, and m = 6 So, Compute $2^{2^{2{^2}}}\:=\:4^{2{^2}}\:=\:16^2\:=\:256$ Then 256 % 6 ...
Read MoreCheck whether an array can fit into another array by rearranging the elements in the array
From the problem statement, we can understand that given two arrays, we have to check whether the first array can fit into the second array. In the real world, there are many instances where we need to check whether an array can fit into another array by rearranging the elements in the array. For a variety of reasons, programmers may need to reorder the items of an array to see if they can fit into another array. Memory management in computer programming is one such reason. When working with huge amounts of data, it is frequently more effective to use ...
Read MoreLevel order traversal with direction change after every two levels(Implementation in C/C++)
Level Order TraversalThis is one of the algorithms that processes or prints all nodes of a binary tree by traversing through depth, starting at the root and moving on to its children and so forth.Example INPUT − OUTPUT − 2 4 7 3 6 11 This task involves printing a binary tree's level order traversal so that the first two levels are printed from right to left direction, and the next two levels from left to right direction, and so on. The challenge is that a binary tree's level order traverse must be ...
Read More