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 20 of 164
Centered Pentadecagonal Number
The problem includes printing the N-th centered pentadecagonal number for any input number N. A centered pentadecagonal number is a number that can be represented in the form of a figure with a dot in the centre and surrounded by successive layers of the pentadecagon i.e. 15-sided polygon. Here the successive layers of the pentadecagon depict that the first layer surrounding the dot in the centre will be 15-sided polygon, the next layer will be 30-sided polygon followed by a 45-sided polygon and so on. We can understand the concept of centered pentadecagonal with the below figures. The first ...
Read MoreCentered Octagonal Number
The problem statement includes printing the N-th centered octagonal number for some positive integer N, which will be given by the user. A centered octagonal number is a type of number which can be represented in a pattern of figures. Every centered octagonal number can be represented as a dot in the centre surrounded by the successive layers of an Octagon. An octagon is a type of polygon in geometry which has 8 sides in it. The successive layers of an octagon means that the first layer surrounding the dot in the centre will be an octagon, the second ...
Read MoreCentered Octadecagonal Number
The problem includes to print the N-th centered octadecagonal number, where N will be given as an input. A centered octadecagonal number is a type of figurative number which is represented as a dot in the centre surrounded by the successive layers of the octadecagon. An octadecagon is a polygon with 18 sides in it. The successive layers of the octadecagon are the first layer will be 18-sided polygon, the next will be 36-sided polygon and so on. The numbers can be better explained with the help of figures. The first number is represented as a dot in the ...
Read MoreCentered nonadecagonal number
The problem statement includes printing of the N-th centered nonadecagonal number for any positive value of N. A centered nonadecagonal numbers are numbers which are represented in a particular pattern of figure. This number can be represented in a figure as a dot in the centre surrounded by the successive layers of the nonadecagon. A nonadecagon is a type of polygon in mathematics which has 19 sides in it. The successive layers of the nonadecagon suggests that the first layer surrounding the dot in the centre will be 19 sided polygon followed by 38 sided polygon and so ...
Read MoreCentered dodecahedral number
The problem statement says to print the N-th centered dodecahedral number for any positive value of N which will be the user input. A centered dodecahedral number is a number that can be represented in a particular pattern of figure. A dodecahedron is a three-dimensional figure in mathematics which has 12 flat faces. And a centered dodecahedral number is a number which can be represented in the form of a figure with a dot in the centre surrounded by the successive layers of the dodecahedron (12 faced 3-d structure). The successive layers of the dodecahedron says the first layer will ...
Read MoreCentered cube number
The problem statement includes printing the N-th centered cube number for some positive value of N, which will be the user input. A centered cube number is the number of points in a three-dimensional pattern created by a point surrounded by concentric cubical layers of points, with i^2 points on the square faces of the ith layer. It is equivalently the number of points in a body-centered cubic pattern within the cube with n + 1 points along each of its edges. You can refer to wikipedia for figurative representation of the centered cube number which will help in better ...
Read MoreDifference between Static and Dynamic Hashing
Hashing is a computation technique in which hashing functions take variable-length data as input and issue a shortened fixed-length data as output. The output data is often called a "Hash Code", "Key", or simply "Hash". The data on which hashing works is called a "Data Bucket". Characteristics of Hashing Technique Hashing techniques come with the following characteristics − The first characteristic is, hashing technique is deterministic. Means, whatever number of times you invoke the function on the same test variable, it delivers the same fixed-length result. The second characteristic is its unidirectional action. There is no way you can ...
Read MoreWhat are the substitution techniques in information security?
Substitution technique is a classical encryption approach where the characters present in the initial message are restored by the other characters or numbers or by symbols. If the plain text (original message) is treated as the string of bits, thus the substitution technique would restore bit pattern of plain text with the bit pattern of cipher text.There are various types of substitution ciphers which are as follows −Monoalphabetic Cipher − In monoalphabetic substitution cipher, a character in a plaintext is always restored or changed to the similar character in the ciphertext indifferent of its position in the text.For instance, if ...
Read MoreWhat is Query Optimization?
Query optimization is of great importance for the performance of a relational database, especially for the execution of complex SQL statements. A query optimizer decides the best methods for implementing each query.The query optimizer selects, for instance, whether or not to use indexes for a given query, and which join methods to use when joining multiple tables. These decisions have a tremendous effect on SQL performance, and query optimization is a key technology for every application, from operational Systems to data warehouse and analytical systems to content management systems.There is the various principle of Query Optimization are as follows −Understand ...
Read MoreMinimum Removals are Required such that a given String Consists only of a Pair of Alternating Characters
Minimum removals required such that a given string consists only of a pair of alternating characters is a common problem in computer science and is encountered frequently in applications involving string manipulation. In this tutorial, we will solve this problem using the C++ programming language. We will begin by explaining the problem statement in detail and discussing its importance in various real-world applications. Then, we will provide a step-by-step algorithm to solve this problem and demonstrate its implementation in C++. Finally, we will conclude with some insights into the time and space complexity of our solution ...
Read More