Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Suspicious email detection is a type of mailing system where suspicious users are recognized by deciding the keywords used by him. The suspicious keywords are discovered in the mails which are sent by the user. All the blocked mails are tested by the management and recognize the users who have sent such mails.Suspicious mail detection is a type of system by which suspected users are identified by recognizing the types of words. Words can be as hijacking, explosion which can be discovered in their mails which they send to others. These type of mails are tested by the admin and ... Read More
Triple DES Algorithm used by admin to encode the messages sent to the users or sent some warnings about the different user’s suspicious event. In this research, suspicious words dictionary can be used to find the suspicious words which are not generally used in the normal messaging or communication.There are some modules of Triple DES which are as follows −Admin Login − In this project, admin can get in the username and password to validate himself to access the account panel modules.User Login − In this module, users can get in their username and password to authenticate themselves to access ... Read More
Triple DES is also called a TDES. It is a symmetric key block cipher, defining that the same key can be used to encrypt and decrypt information in fixed-length set of bits known as blocks. It is known as "Triple DES" because it uses the DES cipher three times when encrypting data.When DES was originally invented in 1976, it need a key size of 56 bits, which was an adequate level of security to oppose brute-force attacks. Because then, computers have become economical and more strong, allowing the 3DES algorithm to use DES three times successively, essentially stopping brute-force on ... Read More
The Double DES uses two example of DES cipher for encryption and two units of reverse DES cipher for decryption. Each unit of DES cipher needs multiple key for encryption which enhance the size of the key (112 bit) creating it more secure. But in the double DES can be destroyed by known plaintext attack known as meet-in-themiddle attack.Given a plaintext P and two encryption keys K1 and K2, ciphertext C is produced as C = Ek2(Ek1, (m)) decryption needed that the keys be used in reverse order −P = Dk1(Dk2, (C))A Meet-in-the-Middle (MitM) Attack is a type of cryptanalytic ... Read More
Data Encryption Standard (DES) is a block cipher algorithm that takes plain text in blocks of 64 bits and transform them to ciphertext utilizing keys of 48 bits. It is a symmetric key algorithm. It can define that the same key can be used for encrypting and decrypting data.The design of DES was invented by IBM in 1994. There are some tests on DES have proved that it satisfies some of the required element as claimed. There are some design issued which are as follows −S-Boxes − S-Boxes is a procedure that accepts the 48-bit input from the XOR operation ... Read More
Suppose we have an array A with n elements and another value d. A farmer has arranged n haybale piles on the firm. The ith pile contains A[i] hay-bales. Every day a cow can choose to move one hay-bale in any pile to an adjacent pile. The cow can do this on a day otherwise do nothing. The cow wants to maximize the hay-bales in first pile in d days. We have to count the maximum number of hay-bales on the first pile.So, if the input is like d = 5; A = [1, 0, 3, 2], then the output ... Read More
Suppose we have a number n. Amal wants to give a name to his pet. He will follow an algorithm. The name will be n characters long. The name will contain uppercase and lowercase letters 'O's and 'o's. The algorithm suggests the i-th letter of the name should be 'O' (uppercase) if i is a member of Fibonacci sequence, and 'o' (lowercase) otherwise. The letters in the name are numbered from 1 to n.So, if the input is like n = 10, then the output will be "OOOoOooOoo", because first fibonacci numbers are 1, 2, 3, 5 and so on.StepsTo ... Read More
Suppose we have an array A with n elements. In a coding contest, in total n students will participate, and before the start, every one of them has some positive rating (integer). A[i] represents the rating of ith student. After the contest ends, every student will end up with some positive integer position. We are expecting the students will take places according to their ratings. If student A has rating strictly lower than student B, A will get strictly greater position than B. We have to find the position at the end of the contest.So, if the input is like ... Read More
Suppose we have an array A with n elements. A has elements either 0 or 1. There is a tree. In consecutive n days, if A[i] is 0 it is not watered, if it is 1 then it is watered, the flower grows in the following manner −If the tree is not watered for consecutive two days, it diesIf the tree is watered on ith day, it grows 1 cmIf the tree is watered on ith and (i+1)th day consecutively, it grows 5 cm instead of 1 cm.If it is not watered on ith day, it will not grow.At the ... Read More
Suppose we have a number n. We want to split it into some non-zero digits whose sum is n. We want to find a solution with minimum possible number of different digits.So, if the input is like n = 13, then the output will be [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]StepsTo solve this, we will follow these steps −for initialize i := 0, when i < n, update (increase i by 1), do: print 1ExampleLet us see the following implementation to get better understanding −#include using namespace std; void solve(int n){ for (int i = 0; i < n; i++) printf("1, "); } int main(){ int n = 13; solve(n); }Input13Output1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,