Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
As we know that both DES and AES are the type of symmetric key block cipher which are used in such encryption where only one key (a secret key) is used to both encrypt and decrypt electronic information. The entities communicating via symmetric encryption must exchange the key so that it can be used in the decryption process. Now on the basis of characteristics we can distinguish between AES and DES.Following are the important differences between DES and AES ciphers.Sr. No.KeyDES CipherAES Cipher1DefinitionData Encryption Standard also known as DES is a symmetric key block cipher that was introduced in the ... Read More
Both Synthesized and Inherited Attribute are the part of semantics of a language that provide meaning to its constructs, like tokens and syntax structure. Semantics help interpret symbols, their types, and their relations with each other and its analysis judges whether the syntax structure constructed in the source program derives any meaning or not. Now on the basis of features of attributes we can distinguish between Synthesized and Inherited AttributesFollowing are the important differences between Synthesized and Inherited Attributes.Sr. No.KeySynthesized AttributeInherited Attribute1DefinitionSynthesized attribute is an attribute whose parse tree node value is determined by the attribute value at child nodes.To ... Read More
Both Magnetic Tape and Magnetic Disk are the type of non-volatile magnetic memory and used to store the data. On the basis of architecture and features we can distinguish between both Magnetic Tape Memory and Magnetic Disk Memory. Following are the important differences between Magnetic Tape Memory and Magnetic Disk Memory.Sr. No.KeyMagnetic Tape MemoryMagnetic Disk Memory1DefinitionMagnetic tape is type of non-volatile memory uses thin plastic ribbon is used for storing data and as data use to be stored on ribbon so data read/write speed is slower due to which is mainly used for data backups.On other hand Magnetic Disk is ... Read More
As we know that in C language 'while' keyword is used to define a loop which works on the condition passed as argument to the loop. Now as condition can have two values either true or false so the code inside while block will be executed repeatedly if condition is true and if condition is false the code will not be executed.Now passing the argument to the while loop we can distinguish between while(1) and while(0) as while(1) is the loop where the condition is always treated as true and so the code inside the block start executing repeatedly. Additionally, ... Read More
Both Where and Having are the two keywords used in SQL query to filter and summarize the data that is retrieved from database based on given condition.On the basis of features of both keywords we can distinguish between Where and Having as follows −Sr. No.KeyWhereHaving1DefinitionWHERE clause in SQL query specifies search conditions for the rows returned by the it and limits rows to a specific row-set. In case if user wants to get the particular records based on some specific classification or condition then using ‘where’ clause is useful.The WHERE clause is used to specify the required condition (on aggregate ... Read More
As we know that Cryptography comprises of two processes which are namely as encryption and decryption performed at sender and receiver end respectively. Basically Cryptography is practiced or implemented for doing secure communication between sender and receiver in the public environment in such a manner that other than these two parties no one could get or understand the message that is delivered.On the basis of type of encryption and decryption of the message we can distinguish between Classical and Quantum Cryptography as follows −Sr. No.KeyClassical CryptographyQuantum Cryptography1BasisIn Classical Cryptography encryption and decryption is done on the basis of mathematical computation.On ... Read More
Both HTML and ASP are the web development languages and are widely used in developing web server pages and applications.On the basis of nature of both of the languages we can distinguish between HTML and ASP as follows −Sr. No.KeyHTMLASP1DefinitionHTML is a client-side language which mainly use for developing user interface.HTML stands for Hypertext MarkUp Language in which "Hypertext" refers to the hyperLinks that an HTML page may contain and "MarkUp language" refers to the way tags are used to define the page layout and elements within the page.On other hand ASP is a server-side language developed by Microsoft i.e., ... Read More
Both HashTable and Dictionary are the type of data structure which are used to store data. Both of these data structures hold the stored data in key value pair.On the basis of difference between key features of these we can distinguish between HashTable and Dictionary as follows −Sr. No.KeyHashTableDictionary1DefinitionHashTable is the non-generic type of collection which is used to store data in key/value pair and is defined in System.Collections name space.On other hand Dictionary is a generic type collection defined under System.Collection.Generics name space which also store data in the form of key/value pairs.2DataTypeIn HashTable same or different data type ... Read More
Suppose we have a number. The number can be anything in between 0 to 231 – 1. We have to convert the number into words. So if the number is like 512, then the result will be Five hundred twelve.To solve this, we will follow these steps −Define some lists like less_than_20, this will hold all words from one to nineteenAnother array like tens to hold tens, twenty, thirty and so on up to ninetyAnother array for thousands, to hold thousand, million and billionDefine one function called helper(), this will take nif n is 0, then return blank stringotherwise when ... Read More
Suppose we have a binary tree. We have to find the post order traversal of this tree using iterative approach. So if the tree is like −Then the output will be: [9, 15, 7, 10, -10]To solve this, we will follow these steps −if root is null, then return empty arraycreate an array retstack := define a stack with pair [root, 0]while stack is not empty −node := top of stack, then delete element from stack.if second value of node pair is 0, thencurrent := first value of node pairinsert a pair (current, 1) into stackif right of current is ... Read More