Found 1082 Questions for Data Structure

Difference between Static and Dynamic Hashing

Manisha Shejwal
Updated on 03-Aug-2022 12:16:12
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 More

Difference between Von Neumann and Harvard Architecture

Pradeep Kumar
Updated on 29-Jul-2022 09:05:50
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 More

Difference between Stack and Array

Pradeep Kumar
Updated on 25-Jul-2022 10:22:58
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 More

Difference between Binary Tree and Binary Search Tree

Pradeep Kumar
Updated on 22-Jul-2022 07:20:28
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 More

What are the Protocol Hierarchies in Computer Networks?

Bhanu Priya
Updated on 21-Mar-2022 11:34:36
A protocol is nothing but a set of rules which are followed by the communicating entities for data communication.The protocol depends on the following −Syntax − Syntax is the format of data which is to be sent or received.Semantics − Semantics is the meaning of every section of bits that are transferred.Timings − It refers to the time at which data is transferred as well as the speed at which it is transferred.The communication between the computers in the Internet is defined by different protocols. The protocols TCP (Transmission Control Protocol) and IP (Internet Protocol) build on the basis of ... Read More

What are the Service Primitives in Computer Network?

Bhanu Priya
Updated on 17-Mar-2022 07:56:26
A service is a set of primitives or we call it as operations where a user can invoke to access the service.The selective primitives tell the service to perform an action taken by peer nodes.The initiating node wants to establish a connection send CONNECT.Request − A node wants to do some work or a packet is being sent.The receiver accepts the request and CONNECT.Indication − A node is saying that it wants to set up a connection to it.The CONNECT. The node issuing the initial CONNECT. request finds out what happened via a CONNECT. Confirm primitive.Response is primitive to tell ... Read More

What do you mean by interfaces and services?

Bhanu Priya
Updated on 17-Mar-2022 06:26:58
Generally a network service is an application which runs at application layer and above and is used in computer networking.Network service provides data Storage, manipulation, presentation, communication. This is implemented using client-server architecture or peer-to-peer architecture.Service Interface is used to implement a Service-Oriented Architecture (SOA). This is implemented to achieve interoperability among the applications among various technologies.The basis of functions of each and every layered structure is to provide a service to the layer above it.Types of interface’s servicesThe types of interface’s services are as follows −Entities and peer entitiesAn entity is an active element in each and every layer, ... Read More

What are the steps of key generation using RSA algorithm?

Updated on 16-Mar-2022 10:21:54
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 More

How is RSA Algorithm Calculated?

Updated on 16-Mar-2022 10:06:24
RSA is a cryptosystem for public-key encryption, and it is broadly used for securing sensitive information, specifically when being sent over an insecure network including the Internet.RSA algorithm is the most popular asymmetric key cryptographic algorithm depends on the mathematical fact that it is simply to discover and multiply large prime numbers but complex to factor their product. It needs both private and public key.Example of RSA AlgorithmLet us take an example of this procedure to learn the concepts. For ease of reading, it can write the example values along with the algorithm steps.Choose two large prime numbers P and ... Read More

What are the Steps in RSA in Information Security?

Updated on 16-Mar-2022 10:03:43
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 More
1 2 3 4 5 6 7 ... 109 Next