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
Data Structure Articles
Page 85 of 164
Difference between Normalization and Denormalization
The process to alter the structure of a database is basically categorized into two ways, one is Normalization and the other is Denormalization. The basic difference between normalization and denormalization is that the database normalization removes the redundancy of data and anomalies in a poorly designed table, while denormalization combines multiple table data into one so that it can be queried quickly. Read through this article to find out more about normalization and denormalization and how they are different from each other. What is Normalization? Normalization is used to remove redundant data from the database and to store non-redundant and ...
Read MoreDifference Between Multimedia and Hypermedia
Multimedia integrates different forms of content such as text, audio, video, graphics, etc., to form a single presentation. We come across so many different forms of multimedia element on almost every webpage or App that we open. Multimedia is definitely heavy than the traditional static text-based content, but any form of multimedia can immediately attract the users' attention and convey the message quickly.Hypermedia is a mix of hypertext with media such as graphics, sounds, and animations. It can be understood as the improved version of hypertext.Read through this article to find out more about Multimedia and Hypermedia and how they ...
Read MoreDifference between Von Neumann and Harvard Architecture
There are two distinct varieties of digital computer architectures, each of which provides a description of the functioning and execution of computer systemsThe first is known as the Von Neumann Architecture, which was designed by the well-known physicist and mathematician John Von Neumann in the late 1940s.The second is known as the Harvard Architecture, which was based on the original Harvard Mark relay-based computer and used separate memory systems to store data and instructions. Both of these computer architectures were developed in the 1950s.In the original Harvard architecture, data and instructions were both stored in electro-mechanical counters, while the instructions ...
Read MoreDifference between Stack and Array
The storing and arranging of data in a predefined format so that it can be retrieved and modified in efficient ways is one of the many things that you will want to accomplish, and Data Structures are the building blocks that make it possible. Data Structures are essentially logical representations of data that are used to store data in an ordered fashion in order to facilitate the execution of a variety of operations on the data.Within a single computer programme, we have access to a variety of different ways to store and retrieve information. If you are using an object-oriented ...
Read MoreDifference between Binary Tree and Binary Search Tree
Sorting is the process of putting the data in a logical order so that it can be analysed in the most efficient manner possible. Searching is the action of looking for a certain record within a database. If the data are correctly organised in a predetermined manner, then the process of searching is going to be simple and time-effective. The topic of this article is trees, which are one of the most significant examples of non-linear data structures.The primary purpose of using trees to represent data is to illustrate a hierarchical link between the various components of the structure being ...
Read MoreWhat are the procedure of Miller-Rabin Primality Testing?
The Miller-Rabin Permality test combines the Fermat test and the Fermat root test in a classic method to find a strong pseudoprime. In this test, it can write n – 1 as the product of an odd number m and a power of 2 −$$\mathrm{n-1=m\, x\, 2^{k}}$$The Fermat test in base a can be composed as −$$\mathrm{a^{n-1}\, =\, a^{m\, x\, 2k}=\left [ a^{m} \right ]^{2k}=\left [ a^{m} \right ]\frac{2^{2}\cdot \cdot \cdot 2}{K\, times}}$$In other words, rather than calculating an−1(mod n) in one step, it can do it in k+1 steps. The advantage of using k + 1 is that each ...
Read MoreWhat are the steps of key generation using RSA algorithm?
RSA is a cryptosystem for public-key encryption, and is broadly used for securing responsive information, specifically when being sent over an insecure network including the Internet.In RSA cryptography, both the public and the private keys can encrypt a message; the inverse key from the one used to encrypt a message is used to decrypt it. This attribute is one reason why RSA has develop into the most broadly used asymmetric algorithm. It supports an approach of assuring the confidentiality, integrity, authenticity and non-reputability of digital connection and data storage.RSA need a multiplicative group G =< Z$\mathrm{\phi}$n, *, X > for ...
Read MoreWhat are the Steps in RSA in Information Security?
The RSA algorithm is a public-key signature algorithm founded by Ron Rivest, Adi Shamir, and Leonard Adleman. RSA can also encrypt and decrypt general data to securely exchange information along with managing digital signature verification.The RSA algorithm is based on the complexity contained in the factorization of large numbers. The RSA algorithm depends on the fact that there is no effective method to factor very large numbers. Therefore, deducing an RSA key would take a large amount of time and processing power.RSA algorithm is asymmetric cryptography algorithm as it operate on two different keys such as public key and private ...
Read MoreWhat are the Miller-Rabin Algorithm for testing the primality of a given number?
Miller Rabin is a fast approach to test primality of the large numbers. This algorithm is called a Rabin-miller primality test and this algorithm decides whether number is prime which is same to other tests including Fermat primality Test and Solovay- Strassen primality test.This test is based on equality or group of equalities that hold the true for prime values, thus checks whether they hold for the number, that it is required to test for primality.This algorithm is most useful known primality testing algorithm and can be used in different software libraries that based on RSA encryption and best instance ...
Read MoreWhat is Primality Testing in Information Security?
A primality test is an algorithm to decide whether an input number is prime. Some primality tests are deterministic. They always correctly decide if a number is prime or composite.The fastest known deterministic primality test was invented in 2004. There are three computer scientists, such as Agrawal, Kayal, and Saxena, invented the AKS primality test that operated in O˜ (log(n)6 ) time, where O˜ (f(n)) is represented as O(f(n).log(f(n))k) for some integer k [1]. Although a significant breakthrough, this speed is rather slow when compared to information security requirement.The advantage of prime numbers are that they are utilized in cryptography. ...
Read More